题目链接

题面：

题意：
问 ∑ i = 1 n i 2 \sum_{i=1}^ni^2 ∑i=1n​i2 是不是一个完全平方数。

结论：
只有 n=1，或者n=24 时是完全平方数。

代码：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#include<list>
#include<ctime>
#define ui unsigned int
#define ll long long
#define llu unsigned ll
#define ld long double
#define pr make_pair
#define pb push_back
#define lc (cnt<<1)
#define rc (cnt<<1|1)
#define len(x) (t[(x)].r-t[(x)].l+1)
#define tmid ((l+r)>>1)
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))
using namespace std;

const int inf=0x3f3f3f3f;
const ll lnf=0x3f3f3f3f3f3f3f3f;
const double dnf=1e18;
const int mod=1e9+7;
const double eps=1e-1;
const double pi=acos(-1.0);
const int hp=13331;
const int maxn=200100;
const int maxp=400100;
const int maxm=600100;
const int up=200000;

int main(void)
{
    int tt;
    scanf("%d",&tt);
    while(tt--)
    {
        ll n;
        scanf("%lld",&n);
        if(n==1||n==24) printf("Fake news!\n");
        else printf("Nobody knows it better than me!\n");
    }
    return 0;
}