Cod sursa(job #275428)
Utilizator | Data | 10 martie 2009 14:16:09 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<fstream>
#define MAX 1000001
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long V[MAX],n,sum,i,j;
int main()
{f>>n;
for(i=1;i<=n;i++)
V[i]=i-1;
for(i=1;i<=n;i++)
{
for(j=2*i;j<=n;j=j+i)
V[j]-=V[i];
sum+=V[i];
}
g<<2*sum+1;
return 0;
}