Cod sursa(job #379002)
Utilizator | Simoiu Robert SpiderMan | Data | 30 decembrie 2009 11:40:03 |
---|---|---|---|
Problema | Sum | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
#define MAX 100005
long long sum;
long n,x,j,i;
long long v[MAX];
void ciur()
{
for (int i = 1; i <= MAX; ++i)
v[i] = i-1;
for (int i = 2; i <= MAX; ++i)
if (v[i]==i-1)
for (int j = 2*i; j <= MAX; j += i)
v[j] -= v[i];
}
int main()
{
ciur();
ifstream f("sum.in");
ofstream g("sum.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>x;
sum=v[x]*x*2;
g<<sum<<"\n";
}
return 0;
}