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