@Downgoat redhat and va linux brought linux and open source thinking in general to the corporate world
redhat survived the tech bubble and still does surprisingly well, va did not
however its dying breath gave us sourceforge
today you might know redhat for Fedora, which was essentially conceived as a community testbed for Red Hat Enterprise Linux (and now by extension centos)
wow, $34 billion. i guess i cant be that surprised -- it is publicly traded and all
i never really thought about how big they were nowadays in numbers
cant believe im getting nostalgic over a giant ass corporation
i suppose its easier to be "sympathetic" to software corporations because there are so many more layers of indirection to their effects on the world. not like oil companies or what not
sorry, in a bit of a cynical mood after the news out of brazil
Anonymous
02:42
@quartata Now if only they had sucked in that dying breath and never created SourceForge...
This was a question asked in a competitive programming exam a few days ago. The problem statement is as follows:
You are given an array of integers and are allowed to either increase the value, keep the value or decrease the value of a number. Your task is to make the array non-decreasing by ...
Here you can see g-code parser, written in JavaScript to use in microcontoller(like espruino). But you can run it in browser, because it don't use any specific features
function gcode(str){
//Removes comment, parses command name and args
const [,f,args] = (str.match(/^([GM]\d+) ([^;]+)/)...
Write a program or function that takes input: all resistors available and a resistance value and outputs a truthy value of whether or not it is possible to get the resistance by using those resistors.
Rules:
Any format for input will do.The last number is the required resistance in the examples...
Your language has a NSFW method to perform modular exponentiation. code-golfnumberstring
Inspired by the page about Modular Exponentiation on Wikipedia, but due to some bugs, the line originally reading Java's java.math.BigInteger class has a modPow() method to perform modular exponentiation bec...
I feel tired to do "find the pattern" exercise such as
1 2 3 4 (5)
1 2 4 8 (16)
1 2 3 5 8 (13)
Please write a program that finds the pattern for me.
Here, we define the pattern as a recurrence relation that fits the given input, with the smallest score. If there are multiple answers with the ...
@primo Wow, that is really short. I should get round to learning to golf in perl one of these days. Are there any advantages to the chars vs bytes, or are your solutions typically just ASCII?
@trichoplax Disagree. It's getting a trickle of stars here and there meaning more people are agreeing that things have changed. If folks didn't agree with the sentiment I don't think they would star it
When we define a function that needs an import, we have to add it to the byte count. So far, so good. What about cases where the definition itself doesn't need the import, but when you want to call/execute the function you need it, for example to construct parameters?
Examples can be found here ...
@flawr I'd say giving Microsoft control of all of your files is a decrease in security. What if Microsoft decides they no longer want to provide service to you because they don't agree with your political views, or because someone accused you falsely of a crime?
Inspired by this StackOverflow question.
Input:
We'll take three inputs:
A delimiter-character D to split on
A character I within we ignore the character to split on (I know, that sounds vague, but I'll explain it below)
A string S
Output:
A list/array containing the substrings after the s...
retweet shows up to all your followers and doesnt necessarily mean you like it
whats important is that they think this will "improve discourse." im trying to think what level of glowing brain centrism you have to be on to come up with this
they stopped giving support because Google started using it basically
in an attempt to get them to stop suing
well, thats speculation, but the timing makes sense
i suspect all of redhat's cloud stuff will go bye-bye (@PhiNotPi will need to move his things). ive used IBM Cloud a few times and it was ok but i still like heroku better as far as PaaS goes
(thanks to @JonathanFrech for the title)
Challenge
Write a program or function that, given a collection of positive integers \$S\$ and a positive integer \$n\$, finds as many non-overlapping subcollections \$T_1, T_2, ..., T_k\$ of \$S\$ as possible, such that the sum of every \$T_m\$ is equal ...
@ETHproductions problem: the only test cases I've now got to test my submission are all ones... I guess this doesn't matter that much, but just in case...
Background
Most of you know what a Fibonacci number is. Some of you may know that all positive integers can be represented as a sum of one or more Fibonacci numbers, according to Zeckendorf's Theorem. If the number of terms in the optimal Zeckendorf Representation of an integer n is itself a Fib...
Someone sent me this description of a joke sorting algorithm, and I thought it would make for a fun golf.
Given a list of positive integers remove all elements that aren't larger than all elements that precede them. Here's an example in Haskell.
stalin :: [Int] -> Int -> [Int]
stalin [] n = []
...
Find the minimal initial values
Consider a sequence F of positive integers where F(n) = F(n-1) + F(n-2) for n >= 2. The Fibonacci sequence is one example of this type of sequence for F(0) = F(1) = 1, but any two initial values will yield a different sequence. For example F(0) = 1, F(1) = 4 pro...
@mbomb007 yeah, I do not really want that in the first place. but it seems all software today needs you to log/sign up/register at some point. So far I managed to use windows without registering anywhere, but I really do not like that either
I noticed that with the pro versions you get a lot more control e.g. on the updates etc
for real @downgoat you gotta bring this Treat back., you could probably host it on google cloud or azure or whatever for free. but it has to be you who hosts it
This was a question asked in a competitive programming exam a few days ago. The problem statement is as follows:
You are given an array of integers and are allowed to either increase the value, keep the value or decrease the value of a number. Your task is to make the array non-decreasing by ...
Write a program or function that takes input: all resistors available and a resistance value and outputs a truthy value of whether or not it is possible to get the resistance by using those resistors.
Rules:
Any format for input will do.The last number is the required resistance in the examples...
I feel tired to do "find the pattern" exercise such as
1 2 3 4 (5)
1 2 4 8 (16)
1 2 3 5 8 (13)
Please write a program that finds the pattern for me.
Here, we define the pattern as a recurrence relation that fits the given input, with the smallest score. If there are multiple answers with the ...
Inspired by this StackOverflow question.
Input:
We'll take three inputs:
A delimiter-character D to split on
A character I within we ignore the character to split on (I know, that sounds vague, but I'll explain it below)
A string S
Output:
A list/array containing the substrings after the s...
(thanks to @JonathanFrech for the title)
Challenge
Write a program or function that, given a collection of positive integers \$S\$ and a positive integer \$n\$, finds as many non-overlapping subcollections \$T_1, T_2, ..., T_k\$ of \$S\$ as possible, such that the sum of every \$T_m\$ is equal ...
Someone sent me this description of a joke sorting algorithm, and I thought it would make for a fun golf.
Given a list of positive integers remove all elements that aren't larger than all elements that precede them. Here's an example in Haskell.
stalin :: [Int] -> Int -> [Int]
stalin [] n = []
...
Find the minimal initial values
Consider a sequence F of positive integers where F(n) = F(n-1) + F(n-2) for n >= 2. The Fibonacci sequence is one example of this type of sequence for F(0) = F(1) = 1, but any two initial values will yield a different sequence. For example F(0) = 1, F(1) = 4 pro...
