Cod sursa(job #2377212)
Utilizator | Data | 8 martie 2019 23:28:49 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int N,k,s[1000005];
int main()
{
///
ifstream f("fractii.in");
ofstream g("fractii.out");
f >> N;
for(int i=2; i<=N; i++)
s[i] = i-1;
for(int i=2; i<=N; i++) {
k+=s[i];
for(int j = i+i; j<=N; j+=i)
s[j]-=s[i];
}
g<<2*k+1;
f.close();
g.close();
///
return 0;
}