Cod sursa(job #1434473)
| Utilizator | Data | 10 mai 2015 18:03:19 | |
|---|---|---|---|
| Problema | Sum | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define n 100010
long long phi[n];
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
int x, p ;
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=j+i)
{
phi[j]=phi[j]/i;
phi[j]=phi[j]*(i-1);
}
}
f>>p;
while(p)
{
f>>x;
g<<phi[x]*x*2<<"\n";
--p;
}
}
