fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e7+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. int consistency(int n){
  31. if(n==1) return 0;
  32.  
  33. unordered_map<int,int> mp;
  34. while(n%2==0){
  35. mp[2]++;
  36. n /= 2;
  37. }
  38. for(int i=3; i*i<=n; i+=2){
  39. while(n%i == 0){
  40. mp[i]++;
  41. n /= i;
  42. }
  43. }
  44. if(n>2) mp[n]++;
  45.  
  46. int ans = 0;
  47. for(auto& t : mp){
  48. int p = t.first;
  49. int e = t.second;
  50.  
  51. int x = 1;
  52. for(int i=1; i<=40; i++){
  53. if(i*(i+1) <= 2*e){
  54. x = i;
  55. }
  56. }
  57.  
  58. ans += x;
  59. }
  60.  
  61. return ans;
  62. }
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78. int practice(int n){
  79.  
  80.  
  81. return 0;
  82. }
  83.  
  84.  
  85.  
  86.  
  87.  
  88. void solve() {
  89.  
  90. int n;
  91. cin>> n;
  92.  
  93. cout << consistency(n) << endl;
  94.  
  95.  
  96. }
  97.  
  98.  
  99.  
  100.  
  101.  
  102. int32_t main() {
  103. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  104.  
  105. int t = 1;
  106. // cin >> t;
  107. while (t--) {
  108. solve();
  109. }
  110.  
  111. return 0;
  112. }
Success #stdin #stdout 0.01s 5320KB
stdin
3125
stdout
2