Aizu 0005 GCD and LCM【辗转相除法】
2016-04-14 13:26
525 查看
原题网址:
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0005
GCD and LCM
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld
& %llu
Submit Status Practice Aizu
0005
Appoint description:
rupak_biswas (2014-03-13)System Crawler (2016-04-09)
Description
Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b (0 < a, b ≤ 2,000,000,000). You can supporse that LCM(a, b) ≤ 2,000,000,000.
比较简单的辗转相除法裸题....
/* http://blog.csdn.net/liuke19950717 */
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int gcd(int a,int b)
{
if(!b)
{
return a;
}
return gcd(b,a%b);
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
int tp=gcd(n,m);
printf("%d %d\n",tp,n/tp*m);
}
return 0;
}
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0005
GCD and LCM
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld
& %llu
Submit Status Practice Aizu
0005
Appoint description:
rupak_biswas (2014-03-13)System Crawler (2016-04-09)
Description
Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b (0 < a, b ≤ 2,000,000,000). You can supporse that LCM(a, b) ≤ 2,000,000,000.
Input
Input consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.Output
For each data set, print GCD and LCM separated by a single space in a line.Sample Input
8 6 50000000 30000000
Output for the Sample Input
2 24 10000000 150000000
比较简单的辗转相除法裸题....
/* http://blog.csdn.net/liuke19950717 */
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int gcd(int a,int b)
{
if(!b)
{
return a;
}
return gcd(b,a%b);
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
int tp=gcd(n,m);
printf("%d %d\n",tp,n/tp*m);
}
return 0;
}
相关文章推荐
- 70. Climbing Stairs
- Aizu 2224 Save your cats【最大生成树】
- MDK 5.10 -- Reading one or more Pack descriptions failed
- VS2008或以上版本的ActiveX控件的测试工具(ActiveX Control Test Container)编译记录
- CDISC SDTM SV domain 学习笔记
- SSH出现Host key verification failed
- 了解点OpenAI及深度学习研究前沿
- 【RAID】基本结构
- sleep()、wait()、yield()、join()方法 解析
- 数据仓库专题(23):总线矩阵的另类应用-Drill Down into a More Detailed Bus Matrix
- 从人工智能的“冬天“走出来
- [Consul]Error starting agent: Failed to get advertise address: Multiple private IPs found.
- baidu实习日志(入职篇)
- 理解TimesTen错误日志信息"waiting for latch"
- marathon参考(6): 约束Constraints
- WINAPI WinMain
- Failing Oozie Launcher, Main class [org.apache.oozie.action.hadoop.ShellMain], exit code [1]
- ICPCCamp2016day 1 - All Pair Shortest Path【bitset优化】
- http://blog.csdn.net/szwangdf/article/details/23432783
- lightoj 1038 - Race to 1 Again 【概率dp】