Pagini recente » Cod sursa (job #649217) | Cod sursa (job #1712485) | Cod sursa (job #2437147) | Cod sursa (job #923261) | Cod sursa (job #769734)
Cod sursa(job #769734)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
int x,y,n,i,j,sum=0,max=0,l[100001],e[100001];
f>>n;
for(i=1;i<=n;i++)
{
f>>l[i];
if(l[i]>max)max=l[i];
}
for(int i=1;i<=max;i++)
e[i]=i-1;
for(int i=2;i<=max;i++)
for(j=i+i;j<=max;j=j+i)
e[j]-=e[i];
for(i=1;i<=n;i++)
{
g<<long long(e[l[i]]*l[i])*2<<endl;
}
return 0;
}