Cod sursa(job #1354259)
Utilizator | Data | 21 februarie 2015 18:45:28 | |
---|---|---|---|
Problema | Sum | Scor | 85 |
Compilator | cpp | Status | done |
Runda | 9neplace3 | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
ofstream g("sum.out");
int i,j,x,n;
int ciur[200041];
int main()
{
for(i=2; i<=200020; ++i)
ciur[i]=i;
for(i=2; i<=200020;++i)
{
if(ciur[i]==i)
{
for(j=i*2; j<=200020; j+=i)
ciur[j]=ciur[j]/i*(i-1);
ciur[i]=i-1;
}
}
freopen("sum.in","r",stdin);
scanf("%d", &n);
for(i=1; i<=n; ++i)
{
scanf("%d",&x);
g<<(long long)2*x*ciur[x]<<'\n';
}
return 0;
}