HDU 2669----Romantic(扩展欧几里德求乘法逆元)
2015-06-07 19:20
369 查看
我觉得这个算法的难点是对递归调用的理解
具体的参见我上一篇博客[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
The input contains multiple test cases.
Each case two nonnegative integer a,b (0<a, b<=2^31)
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
77 51 10 44 34 79
[align=left]Sample Output[/align]
2 -3 sorry 7 -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; }
相关文章推荐
- [单片机分享] 教你在单片机上套公式实现卡尔曼滤波器
- XShell连接虚拟机Linux
- Scala连接mariaDB笔记
- Linux安装 PyQt-x11-gpl-4.11.3.tar.gz笔记
- mariaDB中的DATE_FORMAT() 函数用法笔记
- C++ tips: std::stringstream 对象的复用
- 排序
- CentOS6.3编译fibjs
- H264 获取SPS与PPS(附源码)
- 来淄博旅游
- 整理音乐 (链表归并)
- linux命令总结(二)
- 决策树 学习笔记
- 双向链表
- Linux常用打包压缩备份
- 自动部署工具fabric
- HAProxy基础知识整理
- C++ tips: throw和throw+对象的差别
- Android 5.0 Activity切换动画
- 【学习笔记】【C语言】逻辑运算符