P4057 [Code+#1] 晨跑

透过现象看本质：就是求三个数的最小公倍数.

ACcode:(记得开long long)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b,c;
ll gcd(ll a,ll b){
	return b==0?a:gcd(b,a%b); 
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
void solve() {
   cin>>a>>b>>c;
   cout<<lcm(lcm(a,b),c)<<"\n";
}
int main() {

	ios::sync_with_stdio(false);
	int tt=1;
	//cin>>tt;
	while(tt--) 
	solve();
	return 0;
}

over~