Pagini recente » Cod sursa (job #2981177) | Cod sursa (job #2841016) | Cod sursa (job #2551039) | Cod sursa (job #684212) | Cod sursa (job #2226378)
#include <fstream>
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
typedef long long ll;
typedef long double ld;
const int N=100000+5;
ll phi[N];
int main()
{
for(int i=1;i<N;i++)
phi[i]=i;
for(int i=2;i<N;i++)
if(phi[i]==i)
for(int j=i;j<N;j+=i)
phi[j]/=i,phi[j]*=(i-1);
int t;
fin>>t;
while(t--)
{
int foo;
fin>>foo;
ll tourist=phi[foo];
tourist+=tourist;
tourist*=foo;
fout<<tourist<<"\n";
}
return 0;
}