Cod sursa(job #1334570)
Utilizator | Data | 4 februarie 2015 15:00:46 | |
---|---|---|---|
Problema | Sum | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include<cstdio>
using namespace std;
int v[100005];
void ciur(int x)
{
for(int i=2;i<=x;++i)
{
if(v[i]==0)
{
for(int j=2*i;j<=x;j=j+i)
{
if(v[j]==0)
v[j]=(j/i)*(i-1);
else
v[j]=(v[j]/i)*(i-1);
}
v[i]=i-1;
}
}
}
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
int n,x,i;
scanf("%d",&n);
ciur(100000);
for(i=1;i<=n;++i)
{
scanf("%d",&x);
printf("%d\n",2*x*v[x]);
}
return 0;
}