Cod sursa(job #2563294)
Utilizator | Data | 1 martie 2020 10:27:43 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
int main()
{
int prime[1000001], n;
long long sol;
cin >> n;
for(int i = 1; i <= n; i++)
prime[i] = i-1;
for(int i = 1; i <= n; i++)
{
for(int j = 2 * i; i <= n; j += i)
prime[j] -= prime[i];
sol += prime[i];
}
cout << 1 + 2 * sol;
return 0;
}