Cod sursa(job #1150222)
Utilizator | Radu Cebotari radu_cebotari | Data | 22 martie 2014 18:09:10 |
---|---|---|---|
Problema | Sum | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
using namespace std;
int phi[1000000];
void solve()
{
int i,j;
for(i = 1 ; i<=100001 ; i++)
phi[i] = i-1;
for(i = 1 ; i <= 100001 ;i++)
for( j = 1 ; j <= 100001 ; j++)
phi[j]-=phi[i];
}
int main()
{
ifstream in("sum.in");
ofstream out("sum.out");
int T,n;
in>>T;
solve();
for( ; T ; --T)
{
in>>n;
out<<2*phi[n]<<"\n";
}
in.close();
out.close();
return 0;
}