Cod sursa(job #3184573)
Utilizator | Data | 16 decembrie 2023 11:25:40 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int a=1000001;
long long n;
long long f1(long long n)
{
long long c=0;
int x[a];
for (int i=2;i<=n;i++){
x[i]=i;
}
for(int i=2;i<=n;i++)
{
if (x[i] == i)
{
for(int j=i;j<=n;j+=i)
{
x[j]=x[j]/i*(i - 1);
}
}
c=c+x[i];
}
return c;
}
int main()
{
fin >> n;
fout <<f1(n)*2+1 << endl;
return 0;
}