Cod sursa(job #1324559)
| Utilizator | Data | 22 ianuarie 2015 15:48:39 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <stdio.h>
using namespace std;
int v[1000005];
long long int ciur(int n)
{
long long int nr = 0;
for(int i=2; i<=n; i++)
v[i] = i-1;
for(int i=2; i<=n; i++)
for(int j=2*i; j<=n; j=j+i)
v[j] = v[j] - v[i];
for(int i=1; i<=n; i++)
nr = nr + v[i];
nr = nr*2;
nr++;
return nr;
}
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int n;
long long k;
scanf("%d",&n);
k=ciur(n);
printf("%lld",k);
return 0;
}