Pagini recente » Cod sursa (job #471617) | Cod sursa (job #2273045) | Cod sursa (job #1755357) | Cod sursa (job #2141752) | Cod sursa (job #1207536)
#include <iostream>
#include <stdio.h>
using namespace std;
long long maxim(long long a,long long b)
{
if(a<b)
return b;
else return a;
}
long long minim(long long a,long long b)
{
if(a<b)
return a;
else return b;
}
long n=5,s=0,p[300000]={};
int main()
{
FILE *pFile=fopen("sum.in","r");
fscanf(pFile,"%ld",&n);
for(long i=1;i<=2*100010;i++)
p[i]=i-1;
for(long i=2;i<=2*100010;i++){
// if(i*i<=100010)
if(p[i]==i-1)
for(int j=i+i;j<=2*100010;j+=i)
p[j]-=p[j]/i;
}
long aux;
FILE * pF=fopen("sum.out","w+");;
for(long i=1;i<=n;i++){
fscanf(pFile,"%ld",&aux);
aux=p[aux]*2*aux;
fprintf(pF,"%ld \n",aux);
}
}