Cod sursa(job #373080)
Utilizator | cont teste cnt_tst | Data | 12 decembrie 2009 17:12:34 |
---|---|---|---|
Problema | Multimi2 | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <stdio.h>
FILE*f = fopen("multimi2.in","r");
FILE*g = fopen("multimi2.out","w");
int n, Dmin, NR1, NR2, i,j;
int S1, S2;
//int M1[256], M2[256];
int main() {
fscanf(f,"%d",&n);
for (i=1;i<=n;i++) {
S1 = (i*(i+1))/2;
S2 = (n*(n+1)/2) - S1;
if (S1 >= S2) {
break;
}
}
Dmin = S1-S2;
NR1 = i;
NR2 = n-i;
fprintf(g,"%d\n%d\n",Dmin,NR1);
for (i=1;i<=NR1;i++)
fprintf(g,"%d ",i);
fprintf(g,"\n%d\n",NR2);
for (j=i;j<=n;j++)
fprintf(g,"%d ",j);
return 0;
}