1433-Alice and Bob


    内存限制:256MB 时间限制:2000ms 特判: No

    通过数:1 提交数:7 难度:0


题目描述:

Alice loves numbers consisting of n digits, and Bob only likes numbers that are divisible by t. Find the smallest number that satisfies both of them.


输入描述:

The single line contains two numbers, n and t (1 ≤ n ≤ 100, 2 ≤ t ≤ 10) .

输出描述:

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.

样例输入:

3 2

样例输出:

100

提示:


来源:

上传者:Asden

书中题目链接,请点击上面链接访问!

公告

    欢迎使用NYOJ2.0!