mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
Create 1721.c
This commit is contained in:
parent
5286254a6d
commit
ebbacd0e89
37
QUSTOJ/1721.c
Normal file
37
QUSTOJ/1721.c
Normal file
|
@ -0,0 +1,37 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
//Written by Kiritow. 求最大公约数
|
||||
long gcd(long a,long b)
|
||||
{
|
||||
if(a==0||b==0)
|
||||
{
|
||||
if(a+b==0)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
return (a==0)?b:a;
|
||||
}
|
||||
|
||||
while(a!=b)
|
||||
{
|
||||
if(a>b)
|
||||
{
|
||||
a=a-b;
|
||||
}
|
||||
else
|
||||
{
|
||||
b=b-a;
|
||||
}
|
||||
}
|
||||
return a;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
int a,b;
|
||||
scanf("%d%d",&a,&b);
|
||||
int ans=gcd(a,b);
|
||||
printf("%d\n%d\n",ans,a*b/ans);
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user