PAT 甲级 2019年秋季考试 Forever 个人错误总结

我英语好差，看懂题目就花了好久，暴力解法秒写出，但是不是很好，这题可以dfs
我没有买题，所以只是给了大概的思路，不一定ac，可能过测试点不一定能过，只是样例秒过了（暴力还是要处理一定时间的）。
题目：
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.
样例：
输入：
2
6 45
7 80
输出：
Case 1
10 189999
10 279999
10 369999
10 459999
10 549999
10 639999
10 729999
10 819999
10 909999
Case 2
No Solution

#include<bits/stdc++.h>
using namespace std;
int N,k,m,n,a,num;
struct node{
	int n,a;
};
vector<node> ans;
int gcd(int a,int b){
	if(b==0)return a;
	return gcd(b,a%b);
}
int getsum(int n){
	string str=to_string(n);
	int sum=0;
	for(int i=0;i<str.size();i++){
		sum+=str[i]-'0';
	}
	return sum;
}
void dfs(int minn,int maxn,int l,int sum){
	
	if(l==k){
		if(sum==m){
			n=getsum(num+1);
			if(gcd(n,m)>2){
				node temp;
				temp.a=num;
				temp.n=n;
				ans.push_back(temp);
			}
		}
		return;
	}
	if((m-sum)>(k-l)*9)return;
	if((m-sum)<9)return;
	for(int i=minn;i<=maxn;i++){
		num=num*10+i;
		dfs(0,9,l+1,sum+i);
		num=num/10;
	}
}
int main(){
	cin>>N;
	for(int i=0;i<N;i++){
		printf("Case %d\n",i+1);
		ans.clear();
		cin>>k>>m;
		dfs(1,9,0,0);
		if(ans.size())
		for(int j=0;j<ans.size();j++){
			printf("%d %d\n",ans[j].n,ans[j].a);
		}
		else printf("No Solution\n");
	}
    return 0;
}