Cod sursa(job #756529)
Utilizator | Astalas Paul paul777 | Data | 9 iunie 2012 20:41:26 |
---|---|---|---|
Problema | Sum | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<fstream>
#include<cstdio>
using namespace std;
const int maxim=100010;
int v[maxim],i,j,n,x;
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
f >> n;
for(i=2;i<maxim;i++) v[i]=i;
for(i=2;i<maxim;i++)
if(v[i]==i)
for(j=i;j<maxim;j+=i) v[j]=v[j]/i*(i-1);
for(i=1;i<=n;i++) {f >> x; g << (long long)v[x]*2*x << endl;}
f.close();g.close();
return 0;
}