Cod sursa(job #2837401)
Utilizator | Data | 22 ianuarie 2022 10:26:57 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <iostream>
using namespace std;
int n, a[100005], s;
void f()
{
a[1]=1;
cin >> n;
for(int i=2; i<=n; i++)
a[i]=i-1;
}
void g()
{
for(int i=2; i<=n; i++)
{
s+=a[i];
for(int j=i+i; j<=n; j+=i)
a[j]=a[j]-a[i];
}
cout << s*2+1;
}
int main()
{
f();
g();
return 0;
}