标签:
http://acm.hdu.edu.cn/showproblem.php?pid=2669
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4235 Accepted Submission(s): 1771
Sample Input
77 51
10 44
34 79
Sample Output
2 -3
sorry
7 -3
扩展欧几里得模板题
1 #include<iostream> 2 #include<cstdio> 3 using namespace std; 4 #define ll __int64 5 6 ll x, y; 7 ll exgcd(ll a, ll b){ 8 if(b == 0){ 9 x = 1; 10 y = 0; 11 return a; 12 } 13 ll d = exgcd(b, a%b); 14 ll t = x; 15 x = y; 16 y = t-a/b*y; 17 return d; 18 } 19 20 int main(){ 21 ll a, b; 22 while(~scanf("%I64d%I64d",&a,&b)){ 23 //cout<<a<<b<<endl; 24 //ll g = 0; 25 ll g = exgcd(a, b); 26 if(g == 1){ 27 while(x < 0){ 28 x += b; 29 y -= a; 30 } 31 printf("%I64d %I64d\n",x,y); 32 } 33 else 34 printf("sorry\n"); 35 } 36 return 0; 37 }
标签:
原文地址:http://www.cnblogs.com/wudi-accept/p/5350146.html