A/B
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3727 Accepted Submission(s): 2853
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)。
Output
对应每组数据输出(A/B)%9973。
Sample Input
2
1000 53
87 123456789
Sample Output
7922
6060
Author
xhd
Source
HDU 2007-1 Programming Contest
Recommend
linle | We have carefully selected several similar problems for you: 1788 1211 1787 1299 1573
来源: http://acm.hdu.edu.cn/showproblem.php?pid=1576
//! A/B = 9973r + X
//! A = 9973 * s + n
//! B已知
//! -->9973 * s + n= 9973rB + XB
//! -->n = 9973(rB - s) + XB -->XB = n + 9973Y
//! -->(X/n)B + (-Y/n)*9973 = 1 -->(B,9973)=1 (mod 9973)
//! -->未知量Y X -->扩展欧几里得算法求解得到X/n 再乘以n后取模得解#include <iostream>
#include <cstdio>
using namespace std;
void exgcd(int a,int b,int &x,int &y,int &d)
{
if(!b) { d=a; x=1; y=0;}
else {exgcd(b,a%b,y,x,d);y-=x*(a/b);}
}
int main(void)
{
//freopen("D:\\test.txt","r",stdin);
int T;scanf("%d",&T);
for(int i=1,n,B,x,y,r;i<=T;i++)
{
scanf("%d %d",&n,&B);
exgcd(B,9973,x,y,r);
x=(x%9973+9973)%9973; //这一步处理很重要
cout<<(x*n)%9973<<endl;
}
}