Cod sursa(job #1481560)
| Utilizator | Data | 4 septembrie 2015 19:51:23 | |
|---|---|---|---|
| Problema | Sum | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
const int NMAX=100005;
int n;
long long phi[NMAX];
int main()
{
int i,j,x;
fin>>n;
for (i=1;i<NMAX;i++) phi[i]=(1LL*i*(2*i-1))-i;
for (i=1;i<NMAX;i++)
for (j=2;(i*j)<NMAX;j++)
phi[i*j]-=1LL*phi[i]*j;
for (i=1;i<=n;i++)
{
fin>>x;
fout<<phi[x]<<"\n";
}
return 0;
}
