Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Dirichlet's Theorem on Arithmetic Progressions
Description If For example, the arithmetic sequence beginning with 2 and increasing by 3, i.e.,
contains infinitely many prime numbers
Your mission, should you decide to accept it, is to write a program to find the Input The input is a sequence of datasets. A dataset is a line containing three positive integers The end of the input is indicated by a line containing three zeros separated by a space. It is not a dataset. Output The output should be composed of as many lines as the number of the input datasets. Each line should contain a single integer and should never contain extra characters. The output integer corresponding to a dataset FYI, it is known that the result is always less than 10 Sample Input 367 186 151 179 10 203 271 37 39 103 230 1 27 104 185 253 50 85 1 1 1 9075 337 210 307 24 79 331 221 177 259 170 40 269 58 102 0 0 0 Sample Output 92809 6709 12037 103 93523 14503 2 899429 5107 412717 22699 25673 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator