Cod sursa(job #2476750)
Utilizator | Data | 19 octombrie 2019 11:19:59 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#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;
}