Mai intai trebuie sa te autentifici.
Cod sursa(job #110206)
| Utilizator | Data | 25 noiembrie 2007 20:41:04 | |
|---|---|---|---|
| Problema | Multimi2 | Scor | 100 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 1.78 kb |
var i,j,n:longint;
begin
assign(input,'multimi2.in');reset(input);
assign(output,'multimi2.out');rewrite(output);
readln(n);
if (n mod 4=3)or(n mod 4=0) then
begin
writeln('0');
if n mod 2=0 then
begin
writeln(n div 2);
for i:=1 to n div 4 do
write(i,' ',n-i+1,' ');
writeln;
writeln(n div 2);
for i:=n div 4+1 to n div 2 do
write(i,' ',n-i+1,' ');
end
else
begin
writeln(n div 2+1);
for i:=1 to n div 4+1 do
write(i,' ',n-i,' ');
writeln;
writeln(n div 2);
for i:=n div 4+2 to (n-1) div 2 do
write(i,' ',n-i,' ');
write(n);
end;
end
else
begin
writeln(1);
if n mod 2=0 then
begin
writeln(n div 2);
for i:=1 to n div 4 do
write(i,' ',n-i+1,' ');
writeln(n div 2);
writeln(n div 2);
for i:=n div 4+1 to n div 2-1 do
write(i,' ',n-i+1,' ');
writeln(n div 2+1);
end
else
begin
writeln(n div 2+1);
for i:=1 to n div 4 do
write(i,' ',n-i,' ');
writeln(n div 2);
writeln(n div 2);
for i:=n div 4+1 to n div 2-1 do
write(i,' ',n-i,' ');
writeln(n,' ',n div 2+1);
end;
end;
close(input);close(output);
end.