Score: $200$ points

问题描述

今天，令人难忘的AtCoder新手大赛100正在进行。在这个场合，Takahashi想要给Ringo一个整数。

由于比赛的名字是AtCoder新手大赛100，如果他能得到一个可以恰好被$100$整除$D$次的正整数，Ringo将会非常开心。

请你找出第$N$个能让Ringo开心的最小整数。

以上为通义千问 qwen-max 翻译，仅供参考。

Problem Statement

Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.
As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by $100$ exactly $D$ times.

Find the $N$-th smallest integer that would make Ringo happy.

Constraints

• $D$ is $0$, $1$ or $2$.
• $N$ is an integer between $1$ and $100$ (inclusive).

Input

Input is given from Standard Input in the following format:

$D$ $N$

Output

Print the $N$-th smallest integer that can be divided by $100$ exactly $D$ times.

Sample Input 1

0 5

Sample Output 1

5

The integers that can be divided by $100$ exactly $0$ times (that is, not divisible by $100$) are as follows: $1$, $2$, $3$, $4$, $5$, $6$, $7$, ...
Thus, the $5$-th smallest integer that would make Ringo happy is $5$.

Sample Input 2

1 11

Sample Output 2

1100

The integers that can be divided by $100$ exactly once are as follows: $100$, $200$, $300$, $400$, $500$, $600$, $700$, $800$, $900$, $1 \ 000$, $1 \ 100$, ...
Thus, the integer we are seeking is $1 \ 100$.

Sample Input 3

2 85

Sample Output 3

850000

The integers that can be divided by $100$ exactly twice are as follows: $10 \ 000$, $20 \ 000$, $30 \ 000$, ...
Thus, the integer we are seeking is $850 \ 000$.

update @ 2024/3/10 17:18:24