HDOJ 2669 Romantic
来源:互联网 发布:mysql 一小时之前 编辑:程序博客网 时间:2024/06/06 17:46
Romantic
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3660 Accepted Submission(s): 1493
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
#include <cstdio>typedef long long LL;LL exgcd(LL a, LL b, LL & x, LL & y) {if (b == 0) {x = 1;y = 0;return a;}LL gcd = exgcd(b, a % b, x, y);LL tmp = x;x = y;y = tmp - a / b * y;return gcd;}int main() {LL a, b, x, y;while (~scanf("%lld%lld", &a, &b)) {LL gcd = exgcd(a, b, x, y);if (gcd != 1)puts("sorry");else {LL tmp = b / gcd;x = (x % tmp + tmp) % tmp;y = (1 - x * a) / b;printf("%lld %lld\n", x, y);}}return 0;}
0 0
- HDOJ 2669 Romantic
- HDOJ-2669 Romantic(数论)
- hdoj-【2669 Romantic】
- HDOJ 2669 Romantic(exgcd裸题)
- HDOJ-----2669---Romantic扩展欧几里得
- HDOJ 2669 Romantic (扩展欧几里德)
- HDOJ 题目2669 Romantic(拓展的欧几里得,模板)
- hdoj 2669 Romantic 【扩展欧几里得 求解最小非负解】
- hdoj 2669 Romantic 【扩展欧几里得 求解最小非负解】
- HDOJ 4901 The Romantic Hero
- HDOJ 4901 - The Romantic Hero 简单dp
- HDU 2669 Romantic
- hdu 2669 C - Romantic
- hdu 2669 Romantic
- Romantic(hdu 2669)
- 【HDU】 2669 Romantic
- HDU 2669 Romantic
- hdu 2669 Romantic
- session过期时间
- Serializable接口
- 学习hibernate遇到的问题2
- POJ The Triangle (dp数塔)
- 神经网络笔记
- HDOJ 2669 Romantic
- c++builder 将Handle句柄转成对象
- 排序算法进阶(一)——快速排序算法(基本类型与复杂类型)
- 【练习笔记】剑指offer-面试题5 :从尾到头打印链表
- 文字滚动JS代码
- 认识SVM
- Leetcode #212 Word Search II
- Nginx下Redmine2.6配置
- POJ 2385 Apple Catching (DP)