NYOJ 972 核桃的数量【最小公倍数】

还要考虑0这个特殊的条件，比较坑

 

题目链接

 

 

#include<stdio.h>int gcd(int a,int b){return b==0?a:gcd(b,a%b);}int main(){int a,b,c,n,m;while(~scanf("%d%d%d",&a,&b,&c)){if(a&&b&&c){n=a/gcd(a,b)*b;m=n/gcd(n,c)*c;printf("%d\n",3*m);}else if(a==0&&b==0&&c==0)printf("0\n");else if(a==0&&b==0&&c!=0)printf("%d\n",c);else if(a==0&&b!=0&&c==0)printf("%d\n",b);else if(a!=0&&b==0&&c==0)printf("%d\n",a);else if(a==0&&b!=0&&c!=0)printf("%d\n",2*b/gcd(b,c)*c);else if(a!=0&&b==0&&c!=0)printf("%d\n",2*a/gcd(a,c)*c);else if(a!=0&&b!=0&&c==0)printf("%d\n",2*a/gcd(a,b)*b);}return 0;}