Multiples in the String

AtCoder

IDagc070_a

Time2000ms

Memory256MB

Difficulty—

This problem is **output-only**. No input is given. Present one pair $(X, S)$ of a positive integer $X$ and a string $S$ that satisfies all of the following conditions. * $X$ is a positive integer at least $10^{50}$ and less than $10^{5000}$. * $S$ is a string of length at most $5000$, consisting of digits from `0` to `9`. * For every integer $i$ such that $1 \leq i \leq 1000$, the following condition is satisfied: * The decimal representation of $X$ multiplied by $i$ is a (contiguous) substring of $S$. ## Input No input is given for this problem. [samples]

API Response (JSON)

{
  "problem": {
    "name": "Multiples in the String",
    "description": {
      "content": "This problem is **output-only**. No input is given. Present one pair $(X, S)$ of a positive integer $X$ and a string $S$ that satisfies all of the following conditions. *   $X$ is a positive integer ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc070_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "This problem is **output-only**. No input is given.\nPresent one pair $(X, S)$ of a positive integer $X$ and a string $S$ that satisfies all of the following conditions.\n\n*   $X$ is a positive integer ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments