Cod sursa(job #2326458)
| Utilizator | Data | 23 ianuarie 2019 16:12:47 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
#define nmax 1000005
int n, s[nmax], suma;
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
{
s[i] = i - 1;
suma += s[i];
}
for(int i = 2; i <= n; i++)
for(int j = i+1; j <= n; j += i)
{
s[j] -= s[i];
suma -= s[i];
}
fout << suma * 2 + 1;
}
