1 solutions
-
0
C :
#include<stdio.h> int main() { int m,n; int gcd,lcm; scanf("%d%d",&m,&n); gcd=m; while(m%gcd!=0||n%gcd!=0) --gcd; lcm=m/gcd*n; printf("%d\n",gcd); printf("%d\n",lcm); return 0; }C++ :
#include<iostream> using namespace std; int gcd(int a,int b) { while (a%b) { int r=a%b; a=b; b=r; } return b; } int lcm(int a,int b) { return a*b/gcd(a,b); } int main() { int m,n; cin>>m>>n; cout<<gcd(m,n)<<endl; cout<<lcm(m,n)<<endl; return 0; }
- 1
Information
- ID
- 17590
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By