Cod sursa(job #3197196)
Utilizator | Data | 25 ianuarie 2024 22:08:26 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int g[1000001];
int main()
{
int n;
long long rez=0;
in>>n;
for(int i=2; i<=n; i++)
g[i]=i-1;
for(int i=2; i<=n; i++)
{
rez+=g[i];
for(int j=2*i; j<=n; j+=i)
g[j]-=g[i];
}
out<<2*rez+1<<'\n';
}