摘要： View Code #include<iostream>#include<algorithm>using namespace std;int maxn,ans;int p[]={2,3,5,7,11,13,17,19,23};int n;void DFS(int cnt,int num,int pi,int lim){ if(num>maxn){maxn=num,ans=cnt;} else if(num==maxn&&cnt<ans)ans=cnt; int P=p[pi]; for(int i=1;i<=lim;i++,P*=p[p 阅读全文