Cod sursa(job #2837429)
Utilizator | Data | 22 ianuarie 2022 10:34:22 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long n, a[1000001], s;
void citire()
{
a[1]=1;
f >> n;
for(int i=2; i<=n; i++)
a[i]=i-1;
}
void afisare()
{
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];
}
g << s*2+1;
}
int main()
{
citire();
afisare();
return 0;
}