[Codeforces Round #713 (Div. 3)] G. Short Task (预处理打表)

题目链接：G. Short Task

题解

用nlogn的办法可以筛出1e7内每个数的因子和，然后保存第一次出现该因子和的数，如果存在则输出否则输出-1.

代码

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<unordered_set>
#include<unordered_map>
using namespace std;
//extern "C"{void *__dso_handle=0;}
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define lowbit(x) x&-x

const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e7+10;
const int maxm=100+10;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

ll d[maxn],ans[maxn];

int main()
{
	for(int i=1;i<=10000000;i++)
		for(int j=i;j<=10000000;j+=i)
			d[j]+=i;
	for(int i=1;i<=10000000;i++)
	{
		if(d[i]<=10000000 && !ans[d[i]]) ans[d[i]]=i;
	}
	int t; scanf("%d",&t);
	while (t--) {
		int c; scanf("%d",&c);
		if(!ans[c]) printf("-1\n");
		else printf("%lld\n",ans[c]);
	}
}

顺带一句，这场翻车了，编译原理还得好好学啊。