Cod sursa(job #2476728)
| Utilizator | Data | 19 octombrie 2019 11:15:50 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int a[1000005],n;
void init()
{
a[1] = 1;
for(int i=2; i<=n; ++i)
a[i] = i-1;
}
void scad()
{
for(int i=2; i<=n; ++i)
{
for(int j=i+i; j<=n; j+=i)
a[j] -= a[i];
}
}
void sum()
{
int s=0;
for(int i=2; i<=n; ++i)
s +=a[i];
g<<s*2+1;
}
int main()
{
f>>n;
init();
scad();
sum();
return 0;
}
