|
||||||||||
Second My Problem FirstTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3559 Accepted Submission(s): 1298 Problem Description Give you three integers n, A and B. Then we define Si = Ai mod B and Ti = Min{ Sk | i-A <= k <= i, k >= 1} Your task is to calculate the product of Ti (1 <= i <= n) mod B. Input Each line will contain three integers n(1 <= n <= 107),A and B(1 <= A, B <= 231-1). Process to end of file. Output For each case, output the answer in a single line. Sample Input
Sample Output
Author WhereIsHeroFrom@HDU Source | ||||||||||
|