584A.md (973B)
1 Source: https://codeforces.com/problemset/problem/584/A 2 3 A. Olesya and Rodion 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 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. 22 23 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. 24 25 Input 26 27 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. 28 29 Output 30 31 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. 32 33 Examples 34 35 Input 36 37 ``` 38 3 2 39 ``` 40 41 Output 42 43 ``` 44 712 45 ```