|
|
вернуться в форумmy program work. but timus don't accept answer.
var n,k,m:word;
begin
read(n,k);
if 2*n mod k=0 then m:=2*n div k
else m:=(2*n div k)+1;
write(m);
end. K can be greater than N why is this take wrong answer?
var n,k,m:word;
begin
read(n,k);
if n>k then
if 2*n mod k=0 then m:=2*n div k
else m:=(2*n div k)+1;
if n<= k then m:=2*n;
write(m);
end. When k >= n then we can cook all of them in two minutes (first minute one side, second minute second side) not in 2*n minutes.
Edited by author 23.09.2011 20:06 Thank you!!!! I did it!!! why if 2n div k <> 0 you add 1? |
|
|
