Wondering if anyone has given this a go? codility.com/l/imc
Have tried a few challenges like this and must say this one is pretty challenging, though eventually worked through it and got a decent score. I suppose with prizes like a trip to Amsterdam and a Macbook Pro you would want it to be but....
B-splines are defined using a set of "knots", "control points", and degree. For the purposes of this challenge, the control points are not needed.
The knots are simply a list of non-decreasing real values. Note there might be repeated knots. The degree is a non-negative integer.
The set of poly...
apFjAfDCEfLsv04Phai
apFjAfDCEfLsv04P Command being timed: "/srv/wrappers/python2"
User time (seconds): 0.01
System time (seconds): 0.01
Percent of CPU this job got: 96%
Elapsed (wall clock) time (h:mm:ss or m:ss): 0:00.02
Average shared text size (kbytes): 0
Average unshared data size (kbytes): 0
Average stack size (kbytes): 0
Average total size (kbytes): 0
Maximum resident set size (kbytes): 5768
Average resident set size (kbytes): 0
Major (requiring I/O) page faults: 0
Minor (reclaiming a frame) page faults: 1024
well, one piece of advice I have is that Gehennom (and indeed, the entire dungeon, but especially Gehennom) gets much more dangerous after waking Rodney; Gehennom gets more dangerous still while you're holding the Amulet
thus, it makes sense to "prepare" while you're in the relative safety of pre-Rodney Gehennom
Calculate the chi-squared test statistic
code-golfnumberstatistics
Intoduction
A chi-squared test is a statistical test used to determine the extent of any association between two categorical varaiables. In this challenge, you will calculate the value of the chi-squared test statistic given ...
@NathanMerrill I think this is in P. The fact that there's no repeated variables means that the number of gates = number of variables - 1. The linear algorithm would start from the "branches" and work up the tree to the "root" (the logic gate that gives the answer). For each node, the score of that node is calculated from the scores of its immediate children.
Loading...
Your challenge is to make an infinite loading screen, that looks like this:
Or, to be more specific:
Take no input.
Output Loading..., with a trailing space, but no trailing newline.
Infinitely cycle through the chars |, /, - and \: every 0.25 seconds, overwrite the last one wi...
@Maltysen The rough Idea is: If you want piecewise constant functions on that grid, you can just define N(i,x) = 1 if u(i) <= x < u(i+1) and 0 elsewhere
(this is a basis)
For linear basis functions you can define these "hat" functions and so forth
But these are not really polynomials, but only piecewise polynomials.
If you then want to approximate a function by these splines, you usually want to enforce that the approximation corresponds exactly to the function at the grid points.
That menas you want to find coefficients ai such that the approximation is:
Find three existing variables `x`, `y`, `z`, for which `xy` and `yz` are also pre-existing, then do: variable=variable=variable=variable=variable=x=y==z+ + +111
Hexasweep: A two-part challenge
Part 1: The solver code-golf
Your task is to solve a Hexasweep puzzle.
A Hexasweep puzzle is set out on a grid of diamonds arranged in hexagonal shapes, of which the board looks like a hexagon, like so:
_____
/\ \
_____/ X\____\_____
/\ ...
B-splines are defined using a set of "knots", "control points", and degree. For the purposes of this challenge, the control points are not needed.
The knots are simply a list of non-decreasing real values. Note there might be repeated knots. The degree is a non-negative integer.
The set of poly...
Calculate the chi-squared test statistic
code-golfnumberstatistics
Intoduction
A chi-squared test is a statistical test used to determine the extent of any association between two categorical varaiables. In this challenge, you will calculate the value of the chi-squared test statistic given ...
Loading...
Your challenge is to make an infinite loading screen, that looks like this:
Or, to be more specific:
Take no input.
Output Loading..., with a trailing space, but no trailing newline.
Infinitely cycle through the chars |, /, - and \: every 0.25 seconds, overwrite the last one wi...
Hexasweep: A two-part challenge
Part 1: The solver code-golf
Your task is to solve a Hexasweep puzzle.
A Hexasweep puzzle is set out on a grid of diamonds arranged in hexagonal shapes, of which the board looks like a hexagon, like so:
_____
/\ \
_____/ X\____\_____
/\ ...
