Cod sursa(job #459580)
Utilizator | Data | 30 mai 2010 12:24:00 | |
---|---|---|---|
Problema | Sum | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream in("sum.in");
ofstream out("sum.out");
long long phi[100002];
int n,i,j,T;
int main ()
{
for(i=1;i<=100000;i++)
phi[i] = i-1;
for(i=2;i<=100000;i++)
{
for(j=2*i;j<=100000;j+=i)
phi[j]-=phi[i];
}
in>>T;
while(T--)
{
in>>n;
out<<2*phi[n]*n<<'\n';
}
return 0;
}