OJ Board

(1)
i=0;
a=(++i)+(++i);
then a==4

(2)
i=0;
a=(++i)+(++i)+(++i);
then a==7

(3)
i=0;
a=(++i)+(++i)+(++i)+(++i);
then a==11

i just test this with vc++ 6.0 & gcc 3.2 for win32
i wonder how to explain it.

thanks for your reply.
i have got AC by using backtracking. i wander how someone can solve it in 0ms?

i still cannot understand the problem.

for this case:
6 3
###
#.#
#*#
#*#
#.#
###

why it has a solution?

and, what does "within a mine there may not be any grid square with more than two directly connected grid squares" mean?

the c/c++ complier used in ACM/ICPC final contest 2004 is gcc 3.2, but the one used here is only 2.9.5. There are lots of difference between the two complier.

Some data are so big that it takes much time to read.
But when i use file buffer , it can not be compiled on the judger.