Cod sursa(job #2434261)
Utilizator | Data | 1 iulie 2019 12:55:07 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[1000000];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
long long n,i,j,S=0;
f>>n;
for(i=2;i<=n;i++) v[i]=i-1;//consideram numere prime//
for(i=2;i<=n;i++)
for(j=2*i;j<=n;j+=i)
{
v[j]=v[j]-v[i];
}
for(i=1;i<=n;i++)
{
S=S+v[i];
}
g<<2*S+1;
return 0;
}