Goffi and GCD
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 935 Accepted Submission(s): 313
Problem Description
Goffi is doing his math homework and he finds an equality on his text book:
gcd(n−a,n)×gcd(n−b,n)=nk .
Goffi wants to know the number of ( a,b ) satisfy the equality, if
Goffi wants to know the number of ( a,b ) satisfy the equality, if