G - Short Task(筛法求1e7求约数和)

https://codeforces.com/contest/1512/problem/G

---

思路1：

埃筛思路比较直接。nlognlogn 2s(1e7）跑了1500+ms

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e7+5;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL p[maxn];
LL num[maxn];
int main(void){
   num[0]=0;
   memset(p,-1,sizeof(p));
   for(LL i=1;i<maxn;i++){
       for(LL j=i;j<maxn;j+=i){
          num[j]+=i;
       }
   }
   for(LL i=1;i<maxn;i++){
      if(num[i]>maxn) continue;
      if(p[num[i]]==-1){
        p[num[i]]=i;
      }
   }
   int t;t=read();
   while(t--){
      int c;c=read();
      printf("%d\n",p[c]);
   }
   return 0;
}

那欧拉筛可不可以呢？可以，稍微需要思路，毕竟时间的优化需要思路的升级(343 ms)

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e7+5;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
int l,r;
int prime[maxn],f[maxn],v[maxn],cnt;
bool vis[maxn];
int ans[maxn];
void Euler(){
    ans[1]=1;
    for(LL i=2;i<=r;i++){
        if(!vis[i]){
            prime[++cnt]=i;
            f[i]=v[i]=i+1;
            vis[i]=1;
        }
        for(LL j=1;j<=cnt&&prime[j]<=r/i;j++){
            vis[i*prime[j]]=1;
            if(i%prime[j]==0){
                v[i*prime[j]]=v[i]*prime[j]+1;
                f[i*prime[j]]=f[i]/v[i]*v[i*prime[j]];
                break;
            }
            else{
                v[i*prime[j]]=prime[j]+1;
                f[i*prime[j]]=f[i]*f[prime[j]];
            }
        }
    }
}
int main(){
    memset(ans,-1,sizeof(ans));
    r=1e7+5;
    Euler();
    for(LL i=1;i<=r;i++){
        if(f[i]>1e7) continue;
        if(ans[f[i]]==-1){
            ans[f[i]]=i;
        }
    }
    int t;scanf("%d",&t);
    while(t--){
        int x;scanf("%d",&x);
        printf("%d\n",ans[x]);
    }
    return 0;
}