A9992 | $Olesya and Rodion$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Olesya loves numbers consisting of $n$ digits, and Rodion only likes numbers that are divisible by $t$ . Find some number that satisfies both of them. Your task is: given the $n$ and $t$ print an integer strictly larger than zero consisting of $n$ digits that is divisible by $t$ . If such number doesn't exist, print $-1$ .

The single line contains two numbers, $n$ and $t$ ( $1<=n<=100$ , $2<=t<=10$ ) — the length of the number and the number it should be divisible by.

Print one such positive number without leading zeroes, — the answer to the problem, or $-1$ , if such number doesn't exist. If there are multiple possible answers, you are allowed to print any of them.

输入 #1

3 2

输出 #1

C++ 编辑器

输入

输出