UVA - 11774 Doom's Day

 

    看样例猜结论hhhhhh，竟然蒙对了。。(正确性待证明)

 

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int gcd(int x,int y){ return y?gcd(y,x%y):x;}
int T,n,m;
int main(){
	scanf("%d",&T);
	for(int i=1;i<=T;i++){
		scanf("%d%d",&n,&m);
		printf("Case %d: %d\n",i,(n+m)/gcd(n,m));
	}
	return 0;
}

　　

转载于:https://www.cnblogs.com/JYYHH/p/8949444.html