TLE50分求助dalao

#include <bits/stdc++.h>
using namespace std;
const int maxn = 10000 + 5;
int w[maxn],x[maxn];
int main(){
	int n,l,g;
	cin >> n >> l >> g;
	for (int i = 1; i <= n; i++){
		cin >> w[i] >> x[i];
		if (w[i] < l || x[i] < l)
			cout << "Too Young" << endl;	
		else if (w[i] > g || x[i] > g){
			int num = w[i],sum = x[i];
			while (num > g || sum > g){
				num = w[i] - w[i] / 2;
				sum = x[i] - x[i] / 2;
			}
			if (num == sum)
				cout << "Sometimes Naive" << endl;
			else
				cout << "Too Simple" << endl;
		}	
		else{
			if (w[i] == x[i])
				cout << "Sometimes Naive" << endl;
			else
				cout << "Too Simple" << endl;
		}
	}
	return 0;
}