Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
40941 | jiabokai | 最大公约数、最小公倍数 | C++ | Accepted | 0 MS | 252 KB | 305 | 2024-02-18 11:29:52 |
#include<bits/stdc++.h> using namespace std; int gcd(int n,int m){ int r; do{ r=m%n; m=n; n=r; }while(r!=0); return m; } long long lcm(int n,int m){ return (long long)n*m/gcd(n,m); } int main() { int n,m; cin>>n>>m; cout<<gcd(n,m)<<","<<(long long)lcm(n,m); return 0; }