299. 分数加法-网研14

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int GCD(int a, int b) {
	return b == 0 ? a : GCD(b, a % b);
}
int main(int argc, char** argv) {
	int T;
	scanf("%d", &T);
	while (T--) {
		int a, b;
		scanf("%d%d", &a, &b);
		int max = a > b ? a : b;
		int ah = max == a ? 1 : pow(2, max - a);
		int bh = max == b ? 1 : pow(2, max - b);
		int h = ah + bh;
		int l = pow(2, max);
		int gcd = GCD(h, l);
		printf("%d/%d\n", h / gcd, l / gcd);
	}	
	return 0;
}