Cod sursa(job #1555737)
| Utilizator | Data | 23 decembrie 2015 15:04:56 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#define NMax 1000005
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int fr[NMax],N,i,sol,j;
void read()
{
fin>>N;
}
void solve()
{
for(i=1;i<=N;i++)
{
fr[i]=i-1;
}
for(i=2;i<=N;i++)
{
for(j=i*2;j<=N;j+=i)
{
fr[j]-=fr[i];
}
}
for(i=1;i<=N;i++)
sol+=fr[i];
sol*=2;
sol++;
}
void print()
{
fout<<sol<<"\n";
}
int main()
{
read();
solve();
print();
return 0;
}
