CodeForces - 584A
Description 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. Input 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. Output 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. Sample Input
Input
3 2
Output
712 Source
//题意:
给你一个n,t,让你输出一个可以被t整除的一个n位数。
|
CodeForces - 584A Olesya and Rodion (模拟)水
最新推荐文章于 2019-06-07 17:43:13 发布