|
||||||||||
Calculation 2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7539 Accepted Submission(s): 3032 Problem Description Given a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said to be coprime to B if A, B share no common positive divisors except 1. Input For each test case, there is a line containing a positive integer N(1 ¡Ü N ¡Ü 1000000000). A line containing a single 0 follows the last test case. Output For each test case, you should print the sum module 1000000007 in a line. Sample Input
Sample Output
Author GTmac Source | ||||||||||
|