Pagini recente » Cod sursa (job #1597794) | Cod sursa (job #1204994) | Cod sursa (job #2650012) | Cod sursa (job #2190652) | Cod sursa (job #308151)
Cod sursa(job #308151)
#include<stdio.h>
#include<values.h>
int modul(int n)
{
if(n<0) return -n;
return n;
}
int main()
{
freopen("multimi2.in","r",stdin);
freopen("multimi2.out","w",stdout);
int j,n,i,max=MAXLONG,c;
long long s1=0,s2=0;
scanf("%d",&n);
for(i=(n/2)+1; i<=3*n/4; ++i)
{
s1=0;
for(j=i+1; j<=n; ++j) s1+=(long long)(j);
s2=(long long)(((long long)(i)+1)*((long long)(i))/2);
if(s1-s2<max) { max=s1-s2; c=i; }
}
printf("%d\n",modul(max));
printf("%d\n",c-1);
for(i=1; i<c; ++i) printf("%d ",i);
printf("\n%d\n",n-c+1);
for(i=c; i<=n; ++i) printf("%d ",i);
return 0;
}