A to Z String 2

AtCoder

IDabc257_a

Time2000ms

Memory256MB

Difficulty—

Find the $X$\-th character from the beginning of the string that is obtained by concatenating these characters: $N$ copies of `A`'s, $N$ copies of `B`'s, …, and $N$ copies of `Z`'s, in this order. ## Constraints * $1 \leq N \leq 100$ * $1 \leq X \leq N\times 26$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $X$ [samples]

Samples

Input #1

1 3

Output #1

C

We obtain the string `ABCDEFGHIJKLMNOPQRSTUVWXYZ`, whose $3$\-rd character from the beginning is `C`.

Input #2

2 12

Output #2

F

We obtain the string `AABBCCDDEEFFGGHHIIJJKKLLMMNNOOPPQQRRSSTTUUVVWWXXYYZZ`, whose $12$\-th character from the beginning is `F`.

API Response (JSON)

{
  "problem": {
    "name": "A to Z String 2",
    "description": {
      "content": "Find the $X$\\-th character from the beginning of the string that is obtained by concatenating these characters: $N$ copies of `A`'s, $N$ copies of `B`'s, …, and $N$ copies of `Z`'s, in this order.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc257_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Find the $X$\\-th character from the beginning of the string that is obtained by concatenating these characters: $N$ copies of `A`'s, $N$ copies of `B`'s, …, and $N$ copies of `Z`'s, in this order.\n\n##...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments