Cod sursa(job #378926)
| Utilizator | Data | 29 decembrie 2009 23:19:44 | |
|---|---|---|---|
| Problema | Sum | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream.h>
using namespace std;
#define MAX 100000
long long sum;
long n,x,j,i;
long long v[MAX];
void ciur()
{
for (i=1;i<=MAX;i++)
v[i]=i-1;
for (i=2;i<=MAX;i++)
for (j=2*i;j<=MAX;j+=i)
v[j]-=v[i];
}
int main()
{
ciur();
ifstream f("sum.in");
ofstream g("sum.out");
f>>n;
// cout << "n = "<< n << "\n";
for (i=1;i<=n;i++)
{
f>>x;
//cout << "x = " << x <<" ";
sum=v[x]*x*2;
g<<sum<<"\n";
}
f.close();
g.close();
return 0;
} 