hdu 5194 组合数学or暴力

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<algorithm>
 4 #include<cstring>
 5 #include<cmath>
 6 #include<queue>
 7 using namespace std;
 8 #define for0n for(i=0;i<n;i++)
 9 #define w12 while(scanf("%d%d",&n,&m)!=EOF)
10 const int maxn=1005;
11 int n,m,t;
12 int gcd(int a, int b)
13 {
14     if(b == 0)
15         return a;
16     return gcd(b, a % b);
17 }
18 int main()
19 {
20     int i,j,k;
21     #ifndef ONLINE_JUDGE
22     freopen("1.in","r",stdin);
23     #endif
24     w12
25     {
26         int a=gcd(n*m,n+m);
27         printf("%d/%d\n",n*m/a,(n+m)/a);
28     }
29 }