Pagini recente » Cod sursa (job #2934451) | Cod sursa (job #2891401) | Cod sursa (job #2194011) | Cod sursa (job #77575) | Cod sursa (job #1355209)
#include <fstream>
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)
{
if (i*i<=MAX)
for (j=i*i;j<=MAX;j+=i)
{
u[j]=1;
v[j]-=v[i];
}
else break;
}
}
int main()
{
ciur();
ifstream f("sum.in");
ofstream g("sum.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>x;
sum=v[x]*x*2;
g<<sum<<"\n";
}
return 0;
}