Pagini recente » Cod sursa (job #1661740) | Cod sursa (job #1135599) | Cod sursa (job #1331044) | Cod sursa (job #1314010) | Cod sursa (job #1207508)
#include <iostream>
#include <fstream>
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,v[100000]={},p[300000]={};
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
f>>n;
for(long long i=1;i<=n;i++)
f>>v[i];
for(long long i=1;i<=2*100000;i++)
p[i]=i-1;
for(long long i=2;i<=2*100000;i++){
for(long long j=i+i;j<=2*n;j+=i){
p[j]-=p[i];
}
}
for(long long i=1;i<=n;i++)
g<<p[v[i]]*2*v[i]<<"\n";
// 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";
}