题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5874
代码:
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <queue>
#include <stack>
#include <map>
#include <cmath>
#define sf scanf
#define pf printf
using namespace std;
int main(){
int n,m;
while( ~sf("%d%d",&n,&m) ){
if(m >= (n / 2 * (n / 2 + (n & 1)))) pf("T\n");
else pf("F\n");
}
return 0;
}