1204 ACdream Integration of Polynomial（数学：简单求积分）

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 1010
#define LL long long
using namespace std;

int k[MAXN], e[MAXN];

int gcd(int a, int b) {
return b ? gcd(b, a%b) : a;
}

int main(void) {
int n, x, y, tmp;
while(cin >> n) {
for(int i=1; i<=n; ++i) {
cin >> k[i] >> e[i];
}
for(int i=1; i<=n; ++i) {
x = k[i];
y = e[i]+1;
tmp = gcd(x, y);

x /= tmp;
y /= tmp;

if(y == 1 || y == -1) {
cout << x << " " << e[i]+1;
} else {
if(x*y < 0 && y<0) {
x *= -1;
y *= -1;
}
cout << x << "/" << y << " " << e[i]+1;
}
if(i < n)
printf(" ");
}
printf("\n");
}
return 0;
}