{"problem":{"name":"Bombs Searching Game","description":{"content":"There is a $50 \\\\times 50$ field. The cell at $i$-th row and $j$-th column is denoted $(i, j)$ (0-indexed).   One day, square1001 puts $250$ bombs in this field. In each cell, there is 1 or 0 bomb.   ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"s8pc_3_h"},"statements":[{"statement_type":"Markdown","content":"There is a $50 \\\\times 50$ field. The cell at $i$-th row and $j$-th column is denoted $(i, j)$ (0-indexed).  \nOne day, square1001 puts $250$ bombs in this field. In each cell, there is 1 or 0 bomb.  \nYou want to know where the bombs are by asking some questions.  \n\n![image](https://atcoder.jp/img/s8pc-3/f963d1cafbb260ddc067f68c6292487c.png)\n\n  \nYou can ask this question many times.  \n\n*   You can ask the number of bombs in the rectangular area in which upper-left cell is $(a, b)$ and lower-right cell is $(c, d)$.\n\n  \nPlease find all bombs' positions asking as few questions as possible.  \n  \nNote: This problem Input/Output type is special. Please read Input/Output. If you want to use `scanf/printf`, you have to write `fflush(stdout)`.\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"s8pc_3_h","tags":[],"sample_group":[],"created_at":"2026-03-03 11:01:14"}}