Advertisement
MohamedAbdel3al

J. Prime Factors

Oct 20th, 2021
64
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.11 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define cin(vec) for(auto& i : vec) cin >> i
  6. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  7. #define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
  8. #define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
  9. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << " " << s << "\n";
  10. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  11. #define fixed(n) fixed << setprecision(n)
  12. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  13. #define fill(vec, value) memset(vec, value, sizeof(vec));
  14. #define Num_of_Digits(n) ((int)log10(n)+1)
  15. #define all(vec) vec.begin(),vec.end()
  16. #define rall(vec) vec.rbegin(),vec.rend()
  17. #define sz(x) int(x.size())
  18. #define TC int t; cin >> t; while(t--)
  19. #define fi first
  20. #define se second
  21. #define Pair pair < int, int >
  22. #define ll long long
  23. #define ull unsigned long long
  24. #define Mod 1'000'000'007
  25. #define OO 2'000'000'000
  26. #define EPS 1e-9
  27. #define PI acos(-1)
  28. #define imin INT_MIN
  29. #define imax INT_MAX
  30. #define getline(s) getline(cin >> ws , s) ;
  31.  
  32. void Abdel3al () {
  33. ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  34. #ifndef ONLINE_JUDGE
  35. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  36. #endif
  37. Time
  38. }
  39.  
  40. vector < ll > prime_factors ;
  41.  
  42. vector < ll > prime_factorization (ll n) {
  43. while (n % 2 == 0) prime_factors.push_back(2) , n /= 2 ;
  44. for (int i = 3; i <= sqrt(n); i += 2)
  45. while (n % i == 0) prime_factors.push_back(i) , n /= i ;
  46. if (n > 2) prime_factors.push_back(n) ;
  47. return prime_factors ;
  48. }
  49.  
  50. int main () {
  51. Abdel3al () ;
  52. int n ; cin >> n ;
  53. vector < ll > factors = prime_factorization(n) ;
  54. map <ll , int> freq ;
  55. for (auto& i : factors) freq[i]++ ;
  56. cout << '(' << factors[0] << '*' << freq[factors[0]] << ')' ;
  57. for (auto& i : freq)
  58. cout << '*' << '(' << i.first << '*' << i.second << ')' ;
  59. return 0 ;
  60. }
  61.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement