Cod sursa(job #1793536)
Utilizator | Data | 31 octombrie 2016 09:50:50 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
const int NMAX = 1000001;
int v[NMAX];
int main()
{
int n;
long long sol=0;
in>>n;
for(int i=1; i<=n; i++)
{
v[i]=i-1;
}
for(int i=2; i<=n; i++)
{
for(int j=i+i; j<=n; j+=i)
{
v[j]=v[j]-v[i];
}
sol+=v[i];
}
out<<sol*2+1;
}