Cod sursa(job #1434475)
Utilizator | Data | 10 mai 2015 18:05:53 | |
---|---|---|---|
Problema | Sum | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define n 100000
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-1;
}
for(int i =2 ; i<=n ; i++)
{
for(int j =i*2 ; j<=n ; j=j+i)
phi[j]=phi[j]-phi[i];
}
f>>p;
while(p)
{
f>>x;
g<<(long long)phi[x]*x*2<<"\n";
--p;
}
}