HDOJ 题目1576 A/B（拓展欧几里得求乘法逆元）

A/B

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3310    Accepted Submission(s): 2511

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

15071492

2015-10-11 12:04:40

Accepted

1576

0MS

1396K

550 B

G++

Who_you?

#include<stdio.h>
#include<string.h>
#define mod 9973
#define LL __int64
LL ex_gcd(LL a,LL b,LL &x, LL &y)
{
	if(b==0&&a==0)
		return -1;
	if(b==0)
	{
		x=1;
		y=0;
		return a;
	}
	else
	{
		LL d=ex_gcd(b,a%b,x,y);
		LL t=x;
		x=y;
		y=t-a/b*y;
		return d;
	}
}
LL mod_re(LL a,LL n)
{
	LL x,y;
	LL d=ex_gcd(a,n,x,y);
	if(d==1)
		return (x%n+n)%n;
	return -1;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		LL n,b;
		scanf("%I64d%I64d",&n,&b);
		LL x=mod_re(b,mod);
		printf("%I64d\n",n*x%mod);
	}
}

  
  

   
   7922
6060
  
  

 

Author

xhd

 

Source

HDU 2007-1 Programming Contest

 

Recommend

linle   |   We have carefully selected several similar problems for you:   1788  1124  1319  1370  1930