Cod sursa(job #1420503)
Utilizator | Data | 18 aprilie 2015 16:30:21 | |
---|---|---|---|
Problema | Sum | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int phi[100001],t,i,j;
void phi1()
{
for (i=1; i<=100000; i++)
phi[i]=i;
for (i=2; i<=100000; i++)
if (phi[i]==i)
for (j=i; j<=100000; j+=i)
phi[j] =(phi[j]/i)*(i-1);
}
int main()
{
f>>t;
phi1();
for(i=1; i<=t; i++)
{
f>>j;
g<<(2LL *j* phi[j])<<"\n";
}
}