Cod sursa(job #1235478)
Utilizator | Data | 29 septembrie 2014 20:43:54 | |
---|---|---|---|
Problema | Sum | Scor | 70 |
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 i,phi[100005],j,s,x,n;
long long t;
int main()
{
for(i=1 ; i<= 100001 ; ++i)
phi[i]=i-1;
for(i=2 ; i<= 100001 ; ++i)
for(j=i*2 ; j<= 100001 ; j+=i)
phi[j]-=phi[i];
f>>n;
for(i=1;i<=n;++i)
{
f >> x;
t=(long long)phi[x]*x*2;
g << phi[x]*x*2 << "\n";
}
return 0;
}