type arr = array [0..max_length, 0..max_length] of byte;
var a: arr; i, j, n, m, k, x, y: byte; c: char; f: text;
//procedure PrintMatrix(a: arr); //begin // for var i := 0 to max_length do // begin // writeln; // for var j := 0 to max_length do // write(a[i, j], ' '); // end; // writeln; //end;
procedure labirint(i, j: byte); begin if (i <= n) and (i >= 0) and (j <= m) and (j >= 0) and (a[i, j] = 0) then begin a[i, j] := 1; k := k + 1; labirint(i, j - 1); labirint(i, j + 1); labirint(i - 1, j); labirint(i + 1, j); end; end;
begin Assign(f, 'input.txt'); Reset(f);
readln(f, n, m); for i := 0 to n do begin for j := 0 to m do begin read(f, c); case c of 'x': a[i, j] := 2; '.': a[i, j] := 0; '+': begin x := i; y := j; a[i, j] := 0; end; end; end; readln(f); end; Close(f);
# Код на ruby 2.2.3p173 def zadanie(s) numbers = [] s.split(" ").each {|t| break if t == "2*109" numbers << t.to_i }
max = numbers[0] * numbers[4] for i in 0..numbers.size - 4 for j in i + 4..numbers.size - 1 p [i,j] m = numbers[i] * numbers[j] max = m if m % 2 == 1 and m > max end end
if max % 2 == 1 return max else return "IMPOSSIBLE" end end
# Примеры применения p zadanie("11 12 2 5 7 6 10 2 8 3 2*109 4")
