Pagini recente » Istoria paginii runda/preoni_0/clasament | Cod sursa (job #2636263) | Cod sursa (job #783607) | Cod sursa (job #1290357) | Cod sursa (job #711137)
Cod sursa(job #711137)
#include<stdio.h>
a[999999];
long long functie(int n,int a[999999])
{
int i;
long long nr=0;
for (i=1;i<n;i++)
a[i]=i;
for (i=2;i<=n;i++)
while (i<=n)
{ a[2*i]=a[2*i]-a[i];
nr=nr+a[i];
}
return 2*nr+1;
}
int main()
{
int n;
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
printf(functie(n,a));
return 0;
}