A/B
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 639 Accepted Submission(s): 517
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 (x未知), 因此A = kB + 9973xB,
又A%9973 = n, 所以kB%9973 = n, 故kB = n + 9973y (y未知)
故(k/n)B +(-y/n)*9973 = gcd(B,9973) = 1
扩展欧几里得 求出k/n, 再乘以个n,记得取模,就是answer了
AC代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int Extend_gcd(int a, int b, int &x, int &y) {
if(b == 0) {
x = 1;
y = 0;
return a;
}
int gcd = Extend_gcd(b, a%b, x, y);
int temp = x;
x = y;
y = temp - a/b*y;
return gcd;
}
int cal(int a, int b, int c) {
int x, y, x0;
int gcd = Extend_gcd(a, b, x, y);
if(c % gcd)
return -1;
x0 = c / gcd * x;
return x0;
}
int main()
{
int t, n, b;
scanf("%d", &t);
while(t--) {
scanf("%d%d", &n, &b);
int ans = (cal(b, 9973, 1)%9973 + 9973) % 9973;
printf("%d\n", ans*n%9973);
}
return 0;
}