# Frequently Asked Questions

Here is a small table to help you deduce your score:

K | Score = Q/(Q-1), where Q=log_{10}(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 c_{i,k}:

k=0

for b_{1}=-1,0,1

for b_{2}=-1,0,1

...

for b_{n}=-1,0,1

k=k+1

for j=1,..,n

c_{j,k}=b_{j};

endfor b_{n}

...

endfor b_{2}

endfor b_{1}

Coefficients are available, determine sums:

for m=1,k

s_{m}=0

for j=1,...,n

s_{m}=s_{m}+c_{j,k}*a_{j};

end for m;

Now compute the number of distinct primes in the 3^{n} sums.