Cod sursa(job #1357701)
Utilizator | Data | 24 februarie 2015 02:01:33 | |
---|---|---|---|
Problema | Sum | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
#define nmax 100005
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int phi[nmax+5],n,x;
int main()
{
int i,j;
for (i=2;i<nmax;i++)
phi[i]=i-1;
for (i=2;i<nmax;i++)
for (j=2*i;j<nmax;j+=i)
phi[j]-=phi[i];
for (f>>n;n;n--) {
f>>x;
g<<1LL*phi[x]*2*x<<'\n';
}
return 0;
}