Linear Regression: least squares fit of a line
code-golf
Given a set of 2d coordinates (x_i,y_i) i=1,...,n calculate paramters m,q such that the sum of the squares of the absolute errors sum( (y_i - m *x_i -q)^2 ) is minimal.
Rules
(Rules copy pasted from "Hello, World!")
Unlike our usual r...
Wireworld is fun for the whole family! Your goal is to create a Wireworld implementation in the shortest amount of code possible.
A Wireworld cell can be in one of four different states, usually numbered 0–3 in software, modeled by colors in the examples here:
Empty (Black)
Electron head (Bl...
The Death Of Low-Resolution Pixel Art (Or, Draw That Death)
code-golfgraphical-outputkolmogorov-complexity
This is an Irregular Webcomic! themed task.*
Death is a rather extensive orginization, and, although Head Death has had no trouble telling his employees apart, certain other entitie...
Seriously, 11 bytes
A port of my TI-BASIC answer. Calculates mean(X)+i*(X-mean(X)).
,;Σ½;)±+ï*+
Explanation:
, Read input
; Duplicate
Σ½ Half the sum (the mean) of the top copy
; Copy the mean
) Rotate stack to the left
Now there's...
There have been many other flag challenges posted, but not the national flag of France. Seems a most appropriate time this week.
Produce as SVG, JPEG, PNG, GIF or ANSI (in which case width has to be 78 characters) using the fewest bytes possible.
Wikipedia: Flag of France
Well, turns out Doorknob's
username on GitHub, Reddit, and other sites is
KeyboardFire. That gives me an idea...
The task
You work at KeyboardFire Inc., a company that makes special keyboards. And, by
"special", I mean that, whenever you press a key, something in your house lights
on fire! With...
Seriously, 36 bytes
2╤R`;;3@%Y"Fizz"*)5@%Y"Buzz"*(+;I`Mi
Explanation:
2╤ push the value 10**2 (100)
R pop a: push range(1,a+1)
` start function literal
;; duplicate the top of the stack twice
3 push the value 3
@ swap the top 2 values
% pop a,b: pu...
What time is it again?
popularity-contestdate-time
The challenge is simple: output the system type in any way you see fit. This includes using any standard loopholes or joke answers - whatever you want.
Rules (limited they may be):
The only standard loophole you cannot break is the new langu...
Ruby, 229 bytes
->s,m{c=m.flat_map.with_index{|x,i|x.size.times.select{|j|x[j]==?D}.map{|y|[i,y]}}
s.chars{|h|x='1234567890qwertyuiop*asdfghjkl*zxcvbnm'.index h
x,y=(x%10)*2,x/10
a,b=c.min_by{|a,b|(y-a).abs+((y%2>0?x+1:x)-b).abs}
m[a][b]='F'}
m}
Not very good, but I just had to get the first...
