Cod sursa(job #1908995)
| Utilizator | Data | 7 martie 2017 11:19:07 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int v[1000010],n;
void solve(int n)
{
for(int i=2;i<=n;i++)
{
v[i]=i-1;
}
for(int i=2;i<=n;i++)
{
for(int j=i+i;j<=n;j+=i)
{
v[j]=-v[i];
}
}
}
int main()
{
solve(1000000);
fin>>n;
long long sum=1;
for(int i=2;i<=n;i++)
{
sum+=2*v[i];
}
fout<<sum;
return 0;
}
