PAT 1160 Forever （测试点分析）

最新推荐文章于 2023-05-17 00:42:27 发布

原创

最新推荐文章于 2023-05-17 00:42:27 发布 · 385 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pat考试 #c++

本文详细探讨PAT考试中的1160题——'Forever number'，分析输入输出规格，并提供解题思路。关键在于理解题目对整数A及其加1后的数字位和的约束，以及这些位和的最大公约数必须是大于2的素数。文章通过案例分析，指出剪枝策略的重要性，以避免超时，同时强调在素数判断时需注意的细节。

"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.