Cod sursa(job #378996)
| Utilizator | Data | 30 decembrie 2009 11:32:11 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 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;
for (int i=2;i<=MAX;i++)
if (v[i]==i)
for (j=i;j<=MAX;j+=i) v[j] /=i, v[j] *= (i-1);
}
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;
}
