Cod sursa(job #3372420)
| Utilizator | Data | 3 noiembrie 2026 19:33:45 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 1000000;
ifstream f("fractii.in");
ofstream o("fractii.out");
int v[NMAX+1];
void euler(int n)
{
int i,j;
v[1]=1;
for(i=2;i<=n;i++)
{
v[i]=i-1;
}
for(i=2;i<=n;i++)
{
for(j=2*i;j<=n;j+=i)
v[j]-=v[i];
}
}
int main()
{
int n;
f>>n;
long long s=0;
euler(NMAX);
for(int i=1;i<=n;i++)
{
s+=v[i];
}
o<<2*s-1;
return 0;
}
