7oSkaaa

M2

May 27th, 2022 (edited)
111
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.23 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  6. #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++);
  7. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
  8. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  9. #define fixed(n) fixed << setprecision(n)
  10. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  11. #define fill(vec, value) memset(vec, value, sizeof(vec));
  12. #define Num_of_Digits(n) ((int)log10(n) + 1)
  13. #define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
  14. #define all(vec) vec.begin(), vec.end()
  15. #define rall(vec) vec.rbegin(), vec.rend()
  16. #define sz(x) int(x.size())
  17. #define debug(x) cout << #x << ": " << (x) << "\n";
  18. #define fi first
  19. #define se second
  20. #define Pair pair < int, int >
  21. #define ll long long
  22. #define ull unsigned long long
  23. #define Mod  1'000'000'007
  24. #define OO 2'000'000'000
  25. #define EPS 1e-9
  26. #define PI acos(-1)
  27.  
  28. template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
  29.     for (auto &x: v) in >> x;
  30.     return in;
  31. }
  32.  
  33. template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
  34.     for (const T &x: v) out << x << ' ';
  35.     return out;
  36. }
  37.  
  38. void AhMeD_HoSSaM(){
  39.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  40.     freopen("shop.in", "r", stdin);
  41.     /*#ifndef ONLINE_JUDGE
  42.         freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  43.     #endif*/
  44. }
  45.  
  46. ll cost(ll n){
  47.     if(n == 1) return 1;
  48.     ll cost = 0;
  49.     while(n % 2 == 0) cost += 2, n /= 2;
  50.     for(int i = 3; i <= sqrt(n); i += 2)
  51.         while(n % i == 0)
  52.             cost += i, n /= i;
  53.     if(n > 2) cost += n;
  54.     return cost;
  55. }
  56.  
  57. void Solve(){
  58.     int n, x, cnt = 0;
  59.     cin >> n >> x;
  60.     vector < ll > v(n);
  61.     cin >> v;
  62.     for(auto& i : v) i = cost(i);
  63.     sort(all(v));
  64.     for(auto& i : v){
  65.         if(i <= x) cnt++, x -= i;
  66.         else break;
  67.     }
  68.     cout << cnt << "\n";
  69. }
  70.  
  71. int main(){
  72.     AhMeD_HoSSaM();
  73.     int t = 1;
  74.     cin >> t;
  75.     while(t--)
  76.         Solve();
  77.     return 0;
  78. }
Add Comment
Please, Sign In to add comment