Pagini recente » Cod sursa (job #606837) | Cod sursa (job #1957959) | Cod sursa (job #60704) | Cod sursa (job #2210804) | Cod sursa (job #1205925)
#include<iostream>
#include<fstream>
#define maxn 100005
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int i,j,m,n;
long long t[maxn];
int main()
{
f>>n;
for(i=2;i<=maxn;i++)t[i]=i-1;
for(i=2;i<=maxn;i++)
if(t[i]==i-1)
for(j=i+i;j<=maxn;j+=i)
t[j]-=t[j]/i;
while(n>0)
{
f>>i;
g<<(long long)2*t[i]*i<<'\n';
n--;
}
g.close();
return 0;
}