HDU 2669----Romantic(扩展欧几里德求乘法逆元)
来源:互联网 发布:linux嵌入式开发工资 编辑:程序博客网 时间:2024/06/07 01:51
我觉得这个算法的难点是对递归调用的理解
具体的参见我上一篇博客
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 + Y*b = 1. If no such answer print "sorry" instead.
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 + Y*b = 1. If no such answer print "sorry" instead.
Input
The input contains multiple test cases.
Each case two nonnegative integer a,b (0<a, b<=2^31)
Each case two nonnegative integer a,b (0<a, b<=2^31)
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 5110 4434 79
Sample Output
2 -3sorry7 -3
#include<stdio.h>int exgcd(__int64 a,__int64 b,__int64 &x,__int64 &y) {if(b==0){x=1;y=0;return a;//a是最大公约数 }/*int temp=x; x=y; y=temp-a/b*y; return ans;*/__int64 ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}int main(){ __int64 a,b,x,y; while(scanf("%I64d%I64d",&a,&b)!=EOF) { __int64 gcd=exgcd(a,b,x,y); if(gcd==1) { x=(x%b+b)%b; y=(1-a*x)/b; printf("%I64d %I64d\n",x,y); } else printf("sorry\n"); } return 0;}
0 0
- HDU 2669----Romantic(扩展欧几里德求乘法逆元)
- hdu 2669 Romantic (乘法逆元)
- HDU 2669 Romantic(扩展欧几里德)
- HDU 2669 Romantic(扩展欧几里德)
- HDU 2669 Romantic(扩展欧几里德)
- hdu 2669 Romantic 扩展欧几里德
- HDU 2669 Romantic(扩展欧几里德)
- 扩展欧几里德算法求乘法逆元(C语言版)
- HDU 2669 Romantic(乘法逆元)
- HDU 2669Romantic(扩展欧几里德裸题)
- 扩展的欧几里德算法求乘法逆元
- ZOJ 3609 Modular Inverse(扩展欧几里德求乘法逆元)
- 用扩展欧几里德算法来求乘法逆元(…
- 扩展的欧几里德算法求乘法逆元
- HDU 3923 polya+乘法逆元+扩展欧几里德
- HDOJ 2669 Romantic (扩展欧几里德)
- 扩展欧几里德与乘法逆元
- 扩展欧几里德定理--------乘法逆元
- 来淄博旅游
- nginx模块开发入门
- java中对集合List的操作
- 给UIViewController的UINavigationController属性赋值的方法
- JobTracker和TaskTracker
- HDU 2669----Romantic(扩展欧几里德求乘法逆元)
- IP变种繁殖原理、畸形变异 IP 域名
- 04-树8. Complete Binary Search Tree (30)
- Nim连接到Python
- HDU ACM 4511 小明系列故事——女友的考验->AC自动机+DP
- CSS中的图像替换技术
- Int函数运算符重载
- C++ tips: 类成员函数的参数默认值
- Linux用户管理(3)