Olesya and Rodion
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Examples
Input
Copy
3 2
Output
Copy
712

题意

找一个n位数,能整除k;

思路

任意一个,k后面加0就好了

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n,t,i;
    while(cin>>n>>t)
    {
        if(n==1)
        {
            if(t==10)
                printf("-1\n");
            else
                printf("%d\n",t);
        }
        else
        {
            if(t==10)
            {
                printf("10");
                n--;
            }
            else
                printf("%d",t);
            n--;
            for(i=0;i<n;i++)
                printf("0");
            cout<<endl;

        }
    }
    return 0;
}

Logo

瓜分20万奖金 获得内推名额 丰厚实物奖励 易参与易上手

更多推荐