Pagini recente » Cod sursa (job #1275713) | Cod sursa (job #2437705) | Cod sursa (job #2439816) | Cod sursa (job #1754133) | Cod sursa (job #546895)
Cod sursa(job #546895)
#include <stdio.h>
using namespace std;
int n,cn,p1,p2,p;
int A[10001],q,i;
FILE *f,*g;
int main()
{
f=fopen("multimi2.in","r");
g=fopen("multimi2.out","w");
fscanf(f,"%d",&n);
p=(n*(n+1))/2;;
p1=p/2;
p2=p-p1;
fprintf(g,"%d\n",p2-p1);
cn=n;
while (p1>=n)
{
A[++q]=n;
p1-=n--;
}
if (p1>0)
A[++q]=p1;
fprintf(g,"%d\n",q);
for (i=1;i<=q;++i)
fprintf(g,"%d ",A[i]);
fprintf(g,"\n");
fprintf(g,"%d\n",cn-q);
for (i=1;i<p1;++i)
fprintf(g,"%d ",i);
for (i=p1+1;i<=n;++i)
fprintf(g,"%d ",i);
fclose(f);
fclose(g);
return 0;
}