Pagini recente » Arhiva de probleme | Arhiva de probleme | Istoria paginii runda/7_martie_simulare_oji_2024_clasele_11_12 | 16simu | Cod sursa (job #295566)
Cod sursa(job #295566)
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
FILE *f=fopen("multimi2.in","r"), *t=fopen("multimi2.out","w");
int i,n,s1,s2,g=2,j,g1=1,g2=1,d;
fscanf(f,"%d",&n);
s2=n;s1=1;
for(j=n-1;j>=1;j--)
for(i=2;i<=n;i++)
{if(g!=n)
{
if(s1<=s2)
{s1=s1+i;g1++; }
else
if(s1>s2)
{s2=s2+j; g2++;}
g=g1+g2;
}
else
if(g==n)
{break;i=n+1;j=0;}
}
if(s1>s2)
d=s1-s2;
else if(s2>s1)
d=s1-s2;
fprintf(t,"%d",d,"\n","%d",g1,"\n");
for(i=1;i<=g1;i++)
fprintf(t,"%d",i);
fprintf(t,"\n","%d",g2,"\n");
for(i=n;i>=n-g2;i--)
fprintf(t,"%d",i);
fprintf(t,"\n");
fclose(f);
fclose(t);
return 0;
}