Pagini recente » Borderou de evaluare (job #103694) | Cod sursa (job #1245149) | Cod sursa (job #1219698) | Cod sursa (job #720792) | Cod sursa (job #2476750)
#include <cstdio>
using namespace std;
int p[1000005], n, sum;
void calc()
{
for(int i=2; i<=n; i++)
{
for(int j=i+i; j<=n; j+=i)
{
p[j]-=p[i];
}
sum+=p[i];
}
}
int main()
{
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
scanf("%d", &n);
p[1]=1;
for(int i=2; i<=n; i++)
p[i]=i-1;
calc();
printf("%d", 2*sum+1);
return 0;
}