Cod sursa(job #379008)
Utilizator | Data | 30 decembrie 2009 11:48:42 | |
---|---|---|---|
Problema | Sum | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
#define MAX 100005
long long sum;
long n,x,j,i;
long long v[MAX];
int u[MAX];
void ciur()
{
for (i = 1; i <= MAX; ++i){
v[i] = i-1; u[i] = 0; }
for (i = 2; i <= MAX; ++i)
if (u[i]==0)
for (j = 2*i; j <= MAX; j += i){
v[j] -= v[i];
u[j] = 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;
}