hdoj2669Romantic【扩展欧几里得】
2015-10-25 21:18
375 查看
RomanticTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3948 Accepted Submission(s): 1639 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. Input The input contains multiple test cases. 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 51 10 44 34 79 Sample Output 2 -3 sorry 7 -3 Author yifenfei Source HDU女生专场公开赛——谁说女子不如男 |
#include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<algorithm> using namespace std; long long exgcd(long long a,long long b,long long &x,long long &y){ if(b==0){ x=1;y=0; return a; } else { long long gcd=exgcd(b,a%b,y,x); y-=(a/b)*x; return gcd; } } int main() { long long a,b; while(scanf("%lld%lld",&a,&b)!=EOF){ long long x,y; long long gcd=exgcd(a,b,x,y); if(gcd!=1){ printf("sorry\n"); } else { x%=b; if(x<=0)x+=b; printf("%lld %lld\n",x,(1-(x)*a)/b); } } return 0; }
相关文章推荐
- WordPress代码高亮插件CodeColorer正确使用方法
- OOD沉思录 --- 类和对象的关系 --- 包含关系1
- Drupal7重置密码方法
- java学习资料
- 6.序列:字符串、列表和元组
- R语言笔记004——R批量读取txt文件
- 容器的综合应用:文本查询程序
- fork() || fork()和fork() && fork()笔试题
- Wow! Such City!(最短路)
- Cisco交换机常用命令
- Io及多线程
- 通过SQL Server 2008数据库复制实现数据库同步备份
- OOD沉思录 --- 类和对象的关系 --- 使用关系原则
- Linux配置CentOS永久IP地址
- mybatis(6)动态sql
- java中接口和抽象类的区别
- 第一次参加CF的Round
- 实现逐帧动画和补间动画两种动画效果
- [54]Spiral Matrix
- 梦想还是要有的,万一实现了呢?(Get IEG PC开发)