HDOJ1576 扩展欧几里得

A/B

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

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  1299  1573  1222 

分析： n = A%9973, so n = A - (A/9973)*9973

A = B*x for some integer x, so n = Bx - (A/9973)*9973

gcd(B,9973) = 1, so Bx+9973y = 1

if we find a solution x1 , x = x1*n

since x>0, so x = (x%9973+9973)%9973

代码如下：

#include <cstdio>
using namespace std;

int T;
int n,b;
int x,y,gcd;

int extend_gcd(int a, int b, int &x, int &y){
   if (b==0) {
      x = 1;
      y = 0;
      return a;
   }
   int r = extend_gcd(b,a%b,y,x);
   y -= x*(a/b);
   return r;
}

int main(){
    scanf("%d",&T);
    while (T--){
        scanf("%d %d",&n,&b);
        gcd = extend_gcd(b,9973,x,y);
        x *= n;
        x = (x%9973+9973)%9973;
        printf("%d\n",x);
    }
    return 0;
}