基础数论-反素数 ural1748

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long LL;
const int INF=1e9;
int p[16]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
int sum;
LL ans,n;
void dfs(int dep,int limit,LL tmp,int num){
if(tmp>n) return;
if(num>sum){
sum=num;
ans=tmp;
}
if(num==sum && tmp<ans) ans=tmp;
for(int i=1;i<=limit;i++){
if(tmp>n/p[dep]){
break;
}
dfs(dep+1,i,tmp*=p[dep],num*(i+1));
}
}
int main(){
int kase;
scanf("%d",&kase);
while(kase--){
scanf("%lld",&n);
ans=INF;
sum=0;
dfs(0,60,1,1);
printf("%lld %d\n",ans,sum);
}
return 0;
}