Pagini recente » Cod sursa (job #95483) | Cod sursa (job #269841) | Cod sursa (job #1926335) | Cod sursa (job #112274) | Cod sursa (job #319679)
Cod sursa(job #319679)
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*s;
long int n,i,sum,sum2,l1,l2,v1[500000],v2[500000];
int main()
{
f=fopen("multimi.in","r");
s=fopen("multimi.out","w");
fscanf(f,"%ld",&n);
sum=(n*(n+1))/2;
l1=0;
l2=0;
for(i=n;i>=1;i--)
{
if(sum2+i<=sum/2)
{
v1[l1]=i;
l1++;
sum2+=i;
}
else
{
v2[l2]=i;
l2++;
}
}
sort(v1,v1+l1);
sort(v2,v2+l2);
fprintf(s,"%ld\n",sum/2+sum%2-sum2);
fprintf(s,"%ld\n",l1);
for(i=0;i<l1;i++)
fprintf(s,"%ld ",v1[i]);
fprintf(s,"\n%ld\n",l2);
for(i=0;i<l2;i++)
fprintf(s,"%ld ",v2[i]);
return 0;
}