Cod sursa(job #2515770)
| Utilizator | Data | 29 decembrie 2019 15:30:57 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<iostream>
#include<fstream>
#include<math.h>
#include<string.h>
using namespace std;
#define NMAX 2000005
ifstream fin("fractii.in ");
ofstream fout("fractii.out");
int v[1000000];
int main()
{
int n;
fin>>n;
for(int i=1;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[j]-v[i];
}
}
long long s=0;
for(int i=1;i<=n;i++)
{
s+=v[i]*2;
}
s++;
fout<<s;
return 0;
}
