zoukankan      html  css  js  c++  java
  • 7-1 Forever (20分)

    7-1 Forever (20分)
    "Forever number" is a positive integer A with K digits, satisfying the following constrains:

    the sum of all the digits of A is m;
    the sum of all the digits of A+1 is n; and
    the greatest common divisor of m and n is a prime number which is greater than 2.
    Now you are supposed to find these forever numbers.

    Input Specification:
    Each input file contains one test case. For each test case, the first line contains a positive integer N (≤5). Then N lines follow, each gives a pair of K (3<K<10) and m (1<m<90), of which the meanings are given in the problem description.

    Output Specification:
    For each pair of K and m, first print in a line Case X, where X is the case index (starts from 1). Then print n and A in the following line. The numbers must be separated by a space. If the solution is not unique, output in the ascending order of n. If still not unique, output in the ascending order of A. If there is no solution, output No Solution.

    Sample Input:
    2
    6 45
    7 80
    Sample Output:
    Case 1
    10 189999
    10 279999
    10 369999
    10 459999
    10 549999
    10 639999
    10 729999
    10 819999
    10 909999
    Case 2
    No Solution

  • 相关阅读:
    R set.seed()
    R tapply()
    R table
    清除R console中出现加号+
    r向量映射
    Java常识1
    IDEA配置
    SQL.字符串重叠项数量统计
    SQL.数据库内拆分字符串并返回数据表
    IDEA--TomCat配置
  • 原文地址:https://www.cnblogs.com/houzm/p/13373736.html
Copyright © 2011-2022 走看看