Cod sursa(job #1145448)
Utilizator | Data | 18 martie 2014 10:45:25 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long n, k, v[1000010];
int i, j;
int main()
{
f>>n;
for (i=1;i<=n;i++)
v[i]=i;
for (i=2;i<=n;i++)
if (v[i]==i)
for (j=i;j<=n;j=j+i)
{
v[j]=v[j]/i;
v[j]=v[j]*(i-1);
}
for(i=2;i<=n;i++)
k=k+v[i];
g<<2*k+1;
}