【hdu 2669】Romantic(扩展欧几里得)
来源:互联网 发布:阿里云快照 编辑:程序博客网 时间:2024/05/19 02:42
Romantic
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5424 Accepted Submission(s): 2287
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女生专场公开赛——谁说女子不如男
Recommend
lcy | We have carefully selected several similar problems for you: 2668 2674 2671 2670 2672
【题解】【扩展欧几里得】
#include<cstdio>#include<cstring>#include<algorithm>#define ll long longusing namespace std;ll a,b,ans;ll gcd(ll a,ll b,ll &x,ll &y){if(!b) {x=1; y=0; return a;}ll d=gcd(b,a%b,x,y);ll t=x; x=y; y=t-a/b*y;return d;}inline ll exgcd(ll a,ll b,ll c){ll x,y;ll d=gcd(a,b,x,y);if(c%d) return -1;x*=c/d; b/=d;if(b<0) b=-b;ll sum=x%b;if(sum<=0) sum+=b;return sum; }int main(){while(scanf("%I64d%I64d",&a,&b)==2) { ans=exgcd(a,b,1); if(ans==-1) {printf("sorry\n"); continue;} printf("%I64d %I64d\n",ans,(1-ans*a)/b); }}
0 0
- hdu - 2669 - Romantic(扩展欧几里得)
- 【HDU】2669 - Romantic(扩展欧几里得)
- HDU 2669:Romantic(扩展欧几里得)
- 【hdu 2669】Romantic(扩展欧几里得)
- hdu 2669 Romantic (扩展欧几里得)
- HDU 2669 Romantic 扩展欧几里得
- HDU 2669 Romantic(扩展欧几里得)
- HDU 2669 Romantic (扩展欧几里得)
- hdu 2669 Romantic 扩展欧几里得
- HDU 2669 Romantic [扩展欧几里得]
- HDU 2669 Romantic扩展欧几里得
- 扩展欧几里得 Romantic (HDU
- hdu 2669 Romantic(线性同余,扩展欧几里得)
- HDU 2669 Romantic (扩展欧几里得定理)
- [数论]HDU 2669 Romantic 扩展欧几里得算法
- HDU 2669 Romantic 扩展欧几里得模板题@
- HDU 2669 Romantic【扩展欧几里得板子题】
- Romantic(扩展欧几里得)
- 【POJ 1061】青蛙的约会(扩展欧几里得)
- Java Programming Generals
- 【25.00%】【codeforces 584E】Anton and Ira
- 大文件 and 多下载任务的封装(二)--观察者模式--实现下载进度的实时更新
- JAVA回顾 (一)
- 【hdu 2669】Romantic(扩展欧几里得)
- 【LeetCode】409. Longest Palindrome (java实现)
- 设计模式之责任链模式
- JAVA回顾(二)
- 【NOIP2008】笨小猴
- 中缀表达式转换为后缀表达式
- JAVA回顾(三)
- bzoj'1646: [Usaco2007 Open]Catch That Cow 抓住那只牛
- 【POJ 1664】 放苹果 解题报告