Romantic(扩展欧几里得)注意数据范围
来源:互联网 发布:23years old牙膏 知乎 编辑:程序博客网 时间:2024/05/05 22:18
Romantic
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5697 Accepted Submission(s): 2421
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<cstdio>#include<iostream>using namespace std;long long g;void exgcd(long long a,long long b,long long & x,long long &y){ if(b==0) { g=a; x=1; y=0; } else { exgcd(b,a%b,y,x); y-=x*(a/b); }}int main(){//ax+by=1; long long a,b,x,y; while(~scanf("%lld%lld",&a,&b)) { exgcd(a,b,x,y); if(g!=1) puts("sorry"); else { x%=b; while(x<0) x+=b; y=(1-a*x)/b; printf("%lld %lld\n",x,y); } } return 0;}
1 0
- Romantic(扩展欧几里得)注意数据范围
- Romantic(扩展欧几里得)
- Romantic(扩展欧几里得算法)
- HDU2669:Romantic(扩展欧几里得)
- Romantic(扩展欧几里得求逆元(裸题))
- hdu - 2669 - Romantic(扩展欧几里得)
- 【HDU】2669 - Romantic(扩展欧几里得)
- HDU 2669:Romantic(扩展欧几里得)
- 【hdu 2669】Romantic(扩展欧几里得)
- hdu 2669 Romantic (扩展欧几里得)
- hdu2669 Romantic(扩展欧几里得入门)
- hdu2669 Romantic(扩展欧几里得)
- Romantic 欧几里得的扩展
- 扩展欧几里得 Romantic (HDU
- Romantic 扩展欧几里得
- HDU 2669 Romantic 扩展欧几里得
- HDU 2669 Romantic(扩展欧几里得)
- HDU 2669 Romantic (扩展欧几里得)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) C. Molly's Chemicals
- 选择类控件-----ComboBox控件---CheckBox控件
- 回文数字判断
- php 无限分类递归及其排序详细解读
- Java笔试面试题整理第三波
- Romantic(扩展欧几里得)注意数据范围
- 科大讯飞语义
- 2017.2.25【初中部 提高组】模拟赛B组 最短路径(path) 题解
- {@link}与@see的简单使用以及区别--如何写好Java代码注释。
- 苏嵌 补17.02.27
- Spring+SpringMVC+MyBatis+easyUI整合基础篇(五)讲一下maven
- UML类图和包图
- 1021. 个位数统计
- 1002 数塔取数问题 51NOD