Codeforces Round #324 (Div. 2) 584A. Olesya and Rodion

最新推荐文章于 2022-11-22 23:15:14 发布

qq1319479809

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量453

点赞数

分类专栏： ACM Codeforces 模拟文章标签： ACM codeforces 模拟

本文链接：https://blog.csdn.net/qq1319479809/article/details/48949189

版权

ACM 同时被 3 个专栏收录

121 篇文章 0 订阅

订阅专栏

模拟

53 篇文章 0 订阅

订阅专栏

Codeforces

44 篇文章 0 订阅

订阅专栏

本文提供 Codeforces Round #324 (Div.2) A 题目“Olesya and Rodion”的解题思路及代码实现，探讨如何寻找一个由 n 位组成的数，该数同时满足大于0且能被 t 整除的条件。

摘要由CSDN通过智能技术生成

解题报告： Codeforces Round #324 (Div. 2)

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 test(s) 
  
      input 
    
3 2

      output 
    
712

分析：求由n位数能被t整除的数，如果没有输出-1，n=1,t=10时为-1 。

#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
using namespace std;
int main()
{
    int n,t,i;
    scanf("%d%d",&n,&t);
    if(n==1&&t==10) printf("-1\n");
    else
    {
        if(t==10)
        {
            printf("1");
            for(i=1; i