10109_DualPalindromes

2022-5-16 18:16| 发布者: Hocassian| 查看: 84| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-3-89504560670900-Problem List-采集的数据-后羿采集器.html

Pro.ID

10109

Title

Dual Palindromes

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=10109

AC

96

Submit

278

Ratio

34.53%

时间&空间限制

  • Time Limit: 200/100 MS (Java/Others)     Memory Limit: 32768/32768 K (Java/Others)
  • 描述

    A number that reads the same from right to left as when read from left to right is called a palindrome. The number 12321 is a palindrome; the number 77778 is not. Of course, palindromes have neither leading nor trailing zeroes, so 0220 is not a palindrome.

    The number 21 (base 10) is not palindrome in base 10, but the number 21 (base 10) is, in fact, a palindrome in base 2 (10101).

    Write a program that reads two numbers (expressed in base 10):

    • N  ( 1 ≤ N ≤ 15 )

    • S  ( 0 < S < 10000 )

    and then finds and prints (in base 10) the first N numbers strictly greater than S that are palindromic when written in two or more number bases (2 ≤ base ≤ 10).

    Solutions to this problem do not require manipulating integers larger than the standard 32 bits.

    输入

    Multiply test case, one test case per line. Each line with space separated integers N and S.

    输出

    Description

    A number that reads the same from right to left as when read from left to right is called a palindrome. The number 12321 is a palindrome; the number 77778 is not. Of course, palindromes have neither leading nor trailing zeroes, so 0220 is not a palindrome.

    The number 21 (base 10) is not palindrome in base 10, but the number 21 (base 10) is, in fact, a palindrome in base 2 (10101).

    Write a program that reads two numbers (expressed in base 10):

    • N  ( 1 ≤ N ≤ 15 )

    • S  ( 0 < S < 10000 )

    and then finds and prints (in base 10) the first N numbers strictly greater than S that are palindromic when written in two or more number bases (2 ≤ base ≤ 10).

    Solutions to this problem do not require manipulating integers larger than the standard 32 bits.

    Input

    Multiply test case, one test case per line. Each line with space separated integers N and S.

    Output

    For each test, output N lines, each with a base 10 number that is palindromic when expressed in at least two of the bases 2..10. The numbers should be listed in order from smallest to largest.

    Sample Input

    3 25

    Sample Output

    26
    27
    28

    Source

    样例输入

    3 25

    样例输出

    26
    27
    28

    作者


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部