Cod sursa(job #2476765)
| Utilizator | Data | 19 octombrie 2019 11:24:59 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <cstdio>
using namespace std;
int n;
long long sum;
long long a[1000005];
void init(){
a[1] =1;
for(int i=2; i<=n; i++)
a[i]=i-1;
}
void scad(){
for(int i=2; i<=n; i++){
sum += a[i];
for(int j=i+i; j<=n; j+=i)
a[j]=a[j]-a[i];
}
sum*=2;
printf("%lld", sum+1);
}
int main()
{
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
scanf("%d", &n);
init();
scad();
return 0;
}
