Frequently Asked Questions
Here is a small table to help you deduce your score:
K | Score = Q/(Q-1), where Q=log10(1-K) |
0.01 | 0.0043458 |
0.1 | 0.043755 |
0.2 | 0.088348 |
0.5 | 0.23138 |
0.9 | 0.5 |
0.99 | 0.66667 |
0.999 | 0.75 |
0.9999 | 0.8 |
0.99999 | 0.83333 |
0.999999 | 0.85714 |
1-10-n | n/(n+1) |
1-10-99 | 0.99 |
- When will be the next contest ?
Frankly, we don't know.
We need a C coder to write an efficient scorer.
We need somebody to write the rules.
- Pseudocode, please !
Pseudocode to create the coefficients ci,k:
k=0
for b1=-1,0,1
for b2=-1,0,1
...
for bn=-1,0,1
k=k+1
for j=1,..,n
cj,k=bj;
endfor bn
...
endfor b2
endfor b1
Coefficients are available, determine sums:
for m=1,k
sm=0
for j=1,...,n
sm=sm+cj,k*aj;
end for m;
Now compute the number of distinct primes in the 3n sums.