fork download
  1. #include <algorithm>
  2. #include <fstream>
  3. #include <iterator>
  4. #include <numeric>
  5. #include <cmath>
  6. #include <vector>
  7. #include <string>
  8. #include <iostream>
  9. #include <stdio.h>
  10.  
  11. using namespace std;
  12.  
  13. int main() {
  14. long long q1,q2,q3,q4,q5,q6,q7,q8,q9,q10,q11,i,y,p,u,o,o1,o2,n,k,k1,k2,k3,k4,k5,k6,k7,k8,k9,k10,k11,k12,k13,q12,q13;
  15. cin >> n;
  16. o1=n;
  17. o=1;
  18.  
  19. for (q1=0;q1<=((long long)(log(n)/log(2)+0.001));q1++)
  20. {
  21. k1=1;
  22. u=1;
  23. for (i=0; i<q1; i++) k1=k1*2;
  24. for (q2=0; q2<=min(q1,(long long)((log(n/k1)/log(3)+0.001))); q2++)
  25. {
  26. k2=k1;
  27. for (i=0;i<q2;i++) k2=k2*3;
  28. for (q3=0;q3<=min(q2,((long long)(log(n/k2)/log(5)+0.001)));q3++)
  29. {
  30. k3=k2;
  31. for (i=0;i<q3;i++) k3=k3*5;
  32. for (q4=0;q4<=min(q3,((long long)(log(n/k3)/log(7)+0.001)));q4++)
  33. {
  34. k4=k3;
  35. for (i=0;i<q4;i++) k4=k4*7;
  36. for (q5=0;q5<=min(q4,((long long)(log(n/k4)/log(11)+0.001)));q5++)
  37. {
  38. k5=k4;
  39. for (i=0;i<q5;i++) k5=k5*11;
  40. for (q6=0;q6<=min(q5,((long long)(log(n/k5)/log(13)+0.001)));q6++)
  41. {
  42. k6=k5;
  43. for (i=0;i<q6;i++) k6=k6*13;
  44. for (q7=0;q7<=min(q6,((long long)(log(n/k6)/log(17)+0.001)));q7++)
  45. {
  46. k7=k6;
  47. for (i=0;i<q7;i++) k7=k7*17;
  48. for (q8=0;q8<=min(q7,((long long)(log(n/k7)/log(19)+0.001)));q8++)
  49. {
  50. k8=k7;
  51. for (i=0;i<q8;i++) k8=k8*19;
  52. for (q9=0;q9<=min(q8,((long long)(log(n/k8)/log(23)+0.001)));q9++)
  53. {
  54. k9=k8;
  55. for (i=0;i<q9;i++) k9=k9*23;
  56. for (q10=0;q10<=min(q9,((long long)(log(n/k9)/log(29)+0.001)));q10++)
  57. {
  58. k10=k9;
  59. for (i=0;i<q10;i++) k10=k10*29;
  60. for (q11=0;q11<=min(q10,((long long)(log(n/k10)/log(31)+0.001)));q11++)
  61. {
  62. k11=k10;
  63. for (i=0;i<q11;i++) k11=k11*31;
  64. for (q12=0;q12<=min(q11,((long long)(log(n/k11)/log(37)+0.001)));q12++)
  65. {
  66. k12=k11;
  67. for (i=0;i<q12;i++) k12=k12*37;
  68. for (q13=0;q13<=min(q12,((long long)(log(n/k12)/log(41)+0.001)));q13++)
  69. {
  70. k13=k12;
  71. for (i=0;i<q13;i++) k13=k13*41;
  72. u=1;
  73. u=u*(q1+1)*(q2+1)*(q3+1)*(q4+1)*(q5+1)*(q6+1)*(q7+1)*(q8+1)*(q9+1)*(q10+1)*(q11+1)*(q12+1)*(q13+1);
  74. k=k13;
  75. if ((o==u) and (o1>k) and (k>0))
  76. {
  77. o1=k;
  78. o=u;
  79. }
  80. if ((o<u) and (k<=n) and (k>0))
  81. {
  82. o1=k;
  83. o=u;
  84. }
  85. }
  86. }
  87. }
  88. }
  89. }
  90. }
  91. }
  92. }
  93. }
  94. }
  95. }
  96. }
  97. }
  98.  
  99. cout << o << " " << o1;
  100. }
  101.  
  102.  
Success #stdin #stdout 0.01s 4536KB
stdin
Standard input is empty
stdout
18432 130429015516800