Pagini recente » Cod sursa (job #2567587) | Cod sursa (job #566641) | Cod sursa (job #2883892) | Cod sursa (job #177815) | Cod sursa (job #992845)
Cod sursa(job #992845)
#include<fstream>
#include<algorithm>
using namespace std ;
ifstream fin("sum.in");
ofstream fout("sum.out");
#define maxn 100001
int phi[maxn] ;
int N ;
int main()
{
for(int i = 1; i <= maxn; ++i )
phi[i] = i - 1 ;
for(int i = 2; i <= maxn; ++i )
for(int j = 2 * i; j <= maxn; j += i )
phi[j] -= phi[i] ;
fin >> N ;
while( N-- )
{
int X ;
fin >> X ;
int sol = X * phi[X] * 2 ;
fout << sol << "\n" ;
}
return 0 ;
}