1060 最复杂的数(反素数玄学dfs)

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 #define INF 0x3f3f3f3f
 4 #define eps 1e-9
 5 #define LL long long
 6 #define MX 10005
 7 
 8 const int prim[16] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
 9 
10 LL n;
11 LL big, num;
12 
13 void dfs(int step, LL sz, LL yue, int mmm)
14 {
15     if (step>=16) return;
16     if (yue>big)
17     {
18         big = yue;
19         num = sz;
20     }
21     if (yue==big&&sz<num)
22         num = sz;
23     for (int i=1;i<=63;i++)
24     {
25         if (n/sz>=prim[step]&&i<=mmm)
26             dfs(step+1,sz*=prim[step],yue*(i+1),i);
27         else break;
28     }
29 }
30 
31 int main()
32 {
33     int T;
34     scanf("%d",&T);
35     while(T--)
36     {
37         scanf("%lld",&n);
38         big=0;
39         dfs(0,1,1,64);
40         printf("%lld %lld\n",num,big);
41     }
42     return 0;
43 }