o-padding

AtCoder

IDabc436_a

Time2000ms

Memory256MB

Difficulty—

You are given an integer $N$ and a string $S$ consisting of lowercase English letters with length **less than** $N$. Print the string obtained by repeatedly adding the lowercase English letter `o` to the beginning of $S$ until its length becomes $N$. ## Constraints * $2\leq N \leq 100$ * $N$ is an integer. * $S$ is a string consisting of lowercase English letters with length between $1$ and $N - 1$, inclusive. ## Input The input is given from Standard Input in the following format: $N$ $S$ [samples]

Samples

Input #1

5
abc

Output #1

ooabc

Since $N=5$ and the length of $S$ is $3$, the answer is the string obtained by adding $5-3=2$ `o`s to the beginning of $S$.

Input #2

2
o

Output #2

oo

Input #3

12
vgxgpuam

Output #3

oooovgxgpuam

API Response (JSON)

{
  "problem": {
    "name": "o-padding",
    "description": {
      "content": "You are given an integer $N$ and a string $S$ consisting of lowercase English letters with length **less than** $N$. Print the string obtained by repeatedly adding the lowercase English letter `o` to ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc436_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given an integer $N$ and a string $S$ consisting of lowercase English letters with length **less than** $N$.\nPrint the string obtained by repeatedly adding the lowercase English letter `o` to ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments