Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7187 Accepted Submission(s): 3027
| Problem Description The Sky is Sprite. The Birds is Fly in the Sky. The Wind is Wonderful. Blew Throw the Trees Trees are Shaking, Leaves are Falling. Lovers Walk passing, and so are You. ................................Write in English class by yifenfei  Girls are clever and bright. In HDU every girl like math. Every girl like to solve math problem! Now tell you two nonnegative integer a and b. Find the nonnegative integer X and integer Y to satisfy X*a &＃43; Y*b &＃61; 1. If no such answer print "sorry" instead. Input The input contains multiple test cases. Each case two nonnegative integer a,b (0 Output output nonnegative integer X and integer Y, if there are more answers than the X smaller one will be choosed. If no answer put "sorry" instead. Sample Input 77 51 10 44 34 79 Sample Output 2 -3 sorry 7 -3 Author yifenfei Source HDU女生专场公开赛——谁说女子不如男 Recommend lcy | |||
|
思路&＃xff1a;
裸的拓展欧几里得求乘法逆元 好像不开long long会wa掉
代码&＃xff1a;
#include
#include
#include
#include
#include
using namespace std;
long long t,a,b,x,y,gcd;
long long exgcd(long long a,long long b,long long &x,long long &y)
{if(b&＃61;&＃61;0){x&＃61;1,y&＃61;0;return a;}long long r&＃61;exgcd(b,a%b,x,y),tmp;tmp&＃61;x,x&＃61;y,y&＃61;tmp-a/b*y;return r;
}
int main()
{while(~scanf("%lld%lld",&a,&b)){gcd&＃61;exgcd(a,b,x,y);x%&＃61;b;if(gcd!&＃61;1) printf("sorry\n");else {while(x<&＃61;0) x&＃43;&＃61;b/gcd; y&＃61;(1-a*x)/b; printf("%lld ",x);printf("%lld\n",y);}}return 0;
}
![[大整数乘法] java代码实现](https://img1.php1.cn/3cd4a/24c6f/9f3/0133bb25da242824.jpeg)
京公网安备 11010802041100号