Cod sursa(job #378976)
Utilizator | Data | 30 decembrie 2009 10:24:41 | |
---|---|---|---|
Problema | Sum | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
#include <iostream>
using namespace std;
#define MAX 100005
long long sum;
long n,x,j,i;
long long v[MAX];
char u[MAX];
void ciur()
{
for (i=1;i<=MAX;i++)
v[i]=i-1;
for (i=2;i<=MAX;i++)
if (u[i]==0)
for (j=2*i;j<=MAX;j+=i)
{
u[i]=1;
v[j]-=v[i];
}
}
int main()
{
ciur();
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%ld\n",&n);
for (i=1;i<=n;i++)
{
scanf("%ld\n",&x);
sum=v[x]*x*2;
printf("%lld\n",sum);
}
return 0;
}