Cod sursa(job #379292)
| Utilizator | Data | 31 decembrie 2009 16:23:11 | |
|---|---|---|---|
| Problema | Sum | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
#define MAX 100001
long long sum;
long n,x,j,i;
long long v[MAX];
void ciur()
{
for (i = 1; i <= MAX; ++i)
v[i] = i-1;
for (i = 2; i <= MAX; ++i)
for (j = 2*i; j <= MAX; j += i)
v[j] -= v[i];
}
int main()
{
ciur();
FILE *f = fopen ("sum.in","r");
FILE *g = fopen ("sum.out","w");
fscanf(f,"%ld\n",&n);
for (i=1;i<=n;i++)
{
fscanf(f,"%ld\n",&x);
sum=v[x]*x*2;
fprintf(g,"%lld\n",sum);
}
return 0;
}
