Cod sursa(job #1812041)
Utilizator | Data | 21 noiembrie 2016 19:51:54 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <cstdio>
using namespace std;
int n,x,v[1000005],i,j;
long long nr;
int main() {
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
v[i]=i-1;
for(i=2;i<=n;i++) {
x=v[i];
for(j=i*2;j<=n;j+=i) {
v[j]=v[j]-x;}
nr+=x; }
nr=2*nr+1;
printf("%lld",nr);
return 0;}