Cod sursa(job #2043829)
Utilizator | Data | 20 octombrie 2017 16:57:54 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n,i,j,v[1000001];
long long s=0;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
v[i]=i-1;
for(i=2;i<=n;i++) //ciurul lui Erathosten
for(j=i*2;j<=n;j+=i)
v[j]=v[j]-v[i];
for(i=1;i<=n;i++)
s+=v[i];
fout<<s*2+1;
}