考点:排序+素数+最大公因数+回溯剪枝
注意点:考场上遇到这种题,冷静,先看给出的时间限制(3000ms)说明暴力法肯定能得分。先写个暴力,再去优化。
方法一:暴力法(能得15分,有超时)
#include <iostream>
#include <cmath>
#include <set>
using namespace std;
int N,k,m;
struct node{
int n,A;
friend bool operator <(node n1,node n2){
if(n1.n != n2.n)return n1.n < n2.n;
else return n1.A<n2.A;
}
};
int sum_k(int x){
int sum = 0;
while(x!=0){
sum+=x%10;
x/=10;
}
return sum;
}
bool isprime(int x){
if(x<3) return false;
for(int i=2;i<sqrt(x);i++){
if(x%i==0) return false;
}
return true;
}
int gcd(int a,int b){
if(b==0) return a;
else return gcd(b,a%b);
}
int main() {
cin>>N;
for(int i=0;i<N;i++){
cin>>k>>m;
printf("Case %d\n",i+1);
set<node> ans;
int sta = pow(10,k-1);
int end = pow(10,k);
for(int j=sta;j<end;j++){
if(sum_k(j)==m){
int n = sum_k(j+1);
if(isprime(gcd(m,n))){
ans.insert(node{n,j});
}
}
}
if(ans.size()==0){
printf("No Solution\n");
}else{
for(auto i:ans){
printf("%d %d\n",i.n,i.A);
}
}
}
return 0;
}
方法二:DFS+剪枝
#include <iostream>
#include <cmath>
#include <set>
#include <vector>
using namespace std;
int N,k,m;
struct node{
int n,A;
friend bool operator <(node n1,node n2){
if(n1.n != n2.n)return n1.n < n2.n;
else return n1.A<n2.A;
}
};
int sum_k(int x){
int sum = 0;
while(x!=0){
sum+=x%10;
x/=10;
}
return sum;
}
bool isprime(int x){
if(x<3) return false;
for(int i=2;i<sqrt(x);i++){
if(x%i==0) return false;
}
return true;
}
int gcd(int a,int b){
if(b==0) return a;
else return gcd(b,a%b);
}
vector<int> tempA;
set<node> ans;
int sumk = 0;
void DFS(int st,int deep) {
if(deep>k||sumk+st>m) return;
if(deep==k){
tempA.push_back(st);
sumk+=st;
if(sumk==m){
int tag = 0,f=1;
for(int i=tempA.size()-1;i>=0;i--){
tag += (tempA[i]*f);
f*=10;
}
int n = sum_k(tag+1);
if(isprime(gcd(m,n))){
ans.insert(node{n,tag});
}
}
sumk-=st;
tempA.pop_back();
}
tempA.push_back(st);
sumk += st;
for(int i=0;i<=9;i++){
DFS(i,deep+1);
}
sumk -= st;
tempA.pop_back();
}
int main() {
cin>>N;
for(int i=0; i<N; i++) {
cin>>k>>m;
printf("Case %d\n",i+1);
ans.clear();
tempA.clear();
for(int j=1;j<=9;j++){
sumk=0;
DFS(j,1);
}
if(ans.size()==0) {
printf("No Solution\n");
} else {
for(auto i:ans) {
printf("%d %d\n",i.n,i.A);
}
}
}
return 0;
}