PAT A1160 Forever (暴力搜索)

1160 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

题意：

寻找k位数A，A的各位数字之和为m，A+1的各位数字之和为n，n与m的最大公约数为大于2的素数。

解题思路：

使用set记录素数表，不难发现，A的个位数一定是9（否则n=m+1，其最大公约数一定不是大于2的素数）；
使用map<int,vector <int> >记录答案，键为n的vector存储满足条件的A，这样保证了输出时以n递增的顺序，且在暴力搜索时A以递增顺序加入ans中；

AC代码如下：

#include<iostream>
#include<cmath>
#include<set>