Pagini recente » Cod sursa (job #250021) | Cod sursa (job #2877280) | Cod sursa (job #2880971) | Cod sursa (job #1783975) | Cod sursa (job #1207519)
#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 long n=5,s=0,p[300000]={};
int main()
{
FILE *pFile=fopen("sum.in","r");
fscanf(pFile,"%lld",&n);
for(long long i=1;i<=2*100010;i++)
p[i]=i-1;
for(long long i=2;i<=2*100010;i++){
for(long long j=i+i;j<=2*100010;j+=i){
p[j]-=p[i];
}
}
long long aux;
FILE * pF=fopen("sum.out","w+");;
for(long long i=1;i<=n;i++){
fscanf(pFile,"%lld",&aux);
aux=p[aux]*2*aux;
fprintf(pF,"%llu \n",aux);
}
// for (long long i = 1; i <= 2*n; ++i){
// phi[i]=i
// v[i]+=i;
// }
//cout<<v[6]<<" ";
// cout<<i<<" "<<phi[i]<<"\n";//cout<<i<<" "<<v[i]<<"\n";
}