HDU 5167(map + 暴力)

#include <cstdio>
#include <cstring>
#include <queue>
#include <map>
#include <iostream>
using namespace std;
typedef long long LL;
const LL Max = 1000000000;
LL num[50];
map<LL, bool> m;
void init()
{
queue<LL> q;
m[0] = true;
m[1] = true;
num[0] = 0;
num[1] = 1;
for (int i = 2; i < 46; i++)
{
num[i] = num[i - 1] + num[i - 2];
q.push(num[i]);
m[ num[i] ] = true;
}
while (!q.empty())
{
int temp =  q.front();
q.pop();
for (int i = 1; i < 46; i++)
{
LL res = temp * num[i];
if (res > Max)
break;
if (m[ res ])
continue;
m[ res ] = true;
q.push(res);
}
}

}
int main()
{
init();
int test, n;
scanf("%d", &test);
while (test--)
{
scanf("%d", &n);
if (m[ n ])
printf("Yes\n");
else
printf("No\n");
}
return 0;
}