A/B
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6595 Accepted Submission(s): 5226
Problem Description
要求(A/B)%9973,但由于A很大,我们只给出n(n=A%9973)(我们给定的A必能被B整除,且gcd(B,9973) = 1)。
Input
数据的第一行是一个T,表示有T组数据。
每组数据有两个数n(0 <= n < 9973)和B(1 <= B <= 10^9)。
每组数据有两个数n(0 <= n < 9973)和B(1 <= B <= 10^9)。
Output
对应每组数据输出(A/B)%9973。
Sample Input
2 1000 53 87 123456789
Sample Output
7922 6060另(A/B)%9973=k 则(A/B)=k+9973x ==> A=kB+9973*B。由 A%9973=n ==> kB%9973=n ==> kB=n+9973y ==> kB/n=1+9973y/n。最终可写成 (k/n)B+9973(-y/n)=1 ==> kb+9973(-y)=n,扩展欧几里得求解k。#include<stdio.h> #include<algorithm> #include<string.h> #include<math.h> using namespace std; int e_gcd(int a, int b, int &x, int &y) { if (b == 0) { x = 1, y = 0; return a; } int ans = e_gcd(b, a%b, x, y); int temp = x; x = y; y = temp - (a / b)*y; return ans; } int cal(int a, int b, int c) { int ans, gcd, x, y; gcd = e_gcd(a, b, x, y); if (c%gcd != 0) return -1; x = c / gcd*x; b /= gcd; b = abs(b); ans = x%b; if (ans <= 0) ans += b; return ans; } int main() { int t, n, a, b, x, y; scanf("%d", &t); while (t--) { scanf("%d%d", &n, &b); printf("%d\n", cal(b, 9973, n)); } return 0; }