hdoj2669Romantic【扩展欧几里得】
来源:互联网 发布:淘宝卖家发货货到付款 编辑:程序博客网 时间:2024/06/07 18:13
Romantic
Time 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.
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
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;}
0 0
- hdoj2669Romantic【扩展欧几里得】
- 【欧几里得&扩展欧几里得】
- 欧几里得和扩展欧几里得
- 欧几里得 与 扩展欧几里得
- 欧几里得&扩展欧几里得
- 欧几里得和扩展欧几里得
- 欧几里得与扩展欧几里得
- 欧几里得和扩展欧几里得
- 欧几里得 与 扩展欧几里得
- 欧几里得 扩展欧几里得
- 欧几里得与扩展欧几里得
- 欧几里得 & 扩展欧几里得
- 欧几里得 与 扩展欧几里得
- 欧几里得和扩展欧几里得
- 欧几里得与扩展欧几里得
- 扩展欧几里得
- 扩展欧几里得
- 扩展欧几里得
- Mac常用操作和设置
- Io及多线程
- Cisco交换机常用命令
- java学习资料
- HDU 4849
- hdoj2669Romantic【扩展欧几里得】
- WordPress代码高亮插件CodeColorer正确使用方法
- 【Java Web】在Eclipse下配置Tomcat服务器
- 请不要创新,打好基础,一切从模仿开始,加油
- ZooKeeper数据模型
- 安全参透之旅第2章 fping工具使用
- java基本教程之join方法详解 java多线程教程
- iOS经典讲解之Swift枚举(Enum)、协议(protocol)、扩展(Extension)
- Cocos2dx3.0的自动批次渲染原理