Bombs Searching Game

AtCoder

IDs8pc_3_h

Time1000ms

Memory256MB

Difficulty—

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. You want to know where the bombs are by asking some questions. ![image](https://atcoder.jp/img/s8pc-3/f963d1cafbb260ddc067f68c6292487c.png) You can ask this question many times. * 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)$. Please find all bombs' positions asking as few questions as possible. Note: This problem Input/Output type is special. Please read Input/Output. If you want to use `scanf/printf`, you have to write `fflush(stdout)`. [samples]

API Response (JSON)

{
  "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.  \n...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments