Pagini recente » Cod sursa (job #2200661) | Cod sursa (job #1480471) | Cod sursa (job #266451) | Cod sursa (job #2128358) | Cod sursa (job #2096737)
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int n, phi[100001];
char k[7];
void indiceleLuiEuler(){
for(int i=1; i<=100000; i++)
phi[i]=i-1;
for(int i=2; i<=100000; i++)
for(int j=2*i; j<=100000; j+=i)
phi[j]-=phi[i];
}
void sum(){
f.getline(k, 7);
n = atoi(k);
while(n--){
f.getline(k, 7);
g<<(long long)2*atoi(k)*phi[atoi(k)]<<"\n";
}
}
int main()
{
indiceleLuiEuler();
sum();
return 0;
}