Cod sursa(job #531168)
| Utilizator | Data | 8 februarie 2011 23:35:43 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <stdio.h>
using namespace std;
long long n;
long long A[100002];
int t,z;
FILE *f,*g;
void solve()
{
int i,j;
for (i=1;i<=100001;++i)
A[i]=i-1;
for (i=2;i<=100001;++i)
for (j=2*i;j<=100001;j+=i)
A[j]-=A[i];
}
int main()
{
f=fopen("sum.in","r");
g=fopen("sum.out","w");
fscanf(f,"%d",&t);
solve();
for (z=1;z<=t;++z)
{
fscanf(f,"%lld",&n);
fprintf(g,"%lld \n",A[n]*n*2);
}
fclose(f);
fclose(g);
return 0;
}
