fork download
  1. /* Author: Ishan Pandey */
  2. /* All the Gods, All the Heavens, All the Hells are within you. */
  3.  
  4. #include<bits/stdc++.h>
  5. using namespace std;
  6. #define int long long
  7. #define ll long long
  8. #define ull unsigned long long
  9. #define ld long double
  10.  
  11. #define mp make_pair
  12. #define pb push_back
  13. #define eb emplace_back
  14. #define rep(i,n) for(int i=0;i<n;++i)
  15. #define repa(i,a,b) for(int i=a;i<=b;++i)
  16. #define repd(i,a,b) for(int i=a;i>=b;--i)
  17.  
  18. #define endl '\n'
  19. #define vvll vector<vector<int> >
  20. #define vll vector<int>
  21. #define mii map<int,int>
  22. #define mll map<int, int>
  23.  
  24. #define all(sdk) (sdk.begin(),sdk.end())
  25. #define sz(x) (int)x.size()
  26.  
  27. #define sll set<int>
  28. #define pll pair<int,int>
  29. #define pqbig priority_queue<int>
  30. #define pqsmall priority_queue<int,vi,greater<int> >
  31.  
  32. #define fi first
  33. #define se second
  34. #define gc getchar()
  35. #define fill(ar,val) memset(ar, val, sizeof(ar))
  36.  
  37. const long double PI = acos(-1.0);
  38. const int mod = 1000*1000*1000 + 7;
  39.  
  40. inline int add(int a, int b){ return a+b >= mod ? a+b-mod : a+b;}
  41. inline void inc(int &a, int b){ a = add(a, b);}
  42. inline int sub(int a, int b){ return a-b < 0 ? a-b+mod : a-b;}
  43. inline void dec(int &a, int b){ a = sub(a, b);}
  44. #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
  45. #define prec(x, n) fixed<<setprecision(n)<<x
  46.  
  47. void start_func()
  48. {
  49. fastio;
  50. #ifndef ONLINE_JUDGE
  51. freopen("input.txt", "r", stdin);
  52. freopen("output.txt", "w", stdout);
  53. #endif
  54. }
  55.  
  56.  
  57. void solve()
  58. {
  59. int n, d;
  60. cin>>n>>d;
  61. int arr[n+10];
  62.  
  63. rep(i, n)
  64. cin>>arr[i];
  65.  
  66. sort(arr, arr + n);
  67.  
  68. rep(i, n)
  69. {
  70. if(arr[i] == d)
  71. {
  72. cout<<"1"<<endl;
  73. return;
  74. }
  75. }
  76.  
  77.  
  78. rep(i, n)
  79. {
  80.  
  81. if(arr[i] >= d)
  82. {
  83.  
  84. cout << "2" << endl;
  85. return;
  86. }
  87. }
  88. int ans = (d-1) / (arr[n-1]) +1;
  89.  
  90.  
  91. cout<< ans <<'\n';
  92.  
  93. }
  94.  
  95. signed main()
  96. {
  97. start_func();
  98.  
  99. int t=1;
  100. cin>>t;
  101. while(t--)
  102. {
  103. solve();
  104. }
  105.  
  106. return 0;
  107. }
Success #stdin #stdout 0s 4508KB
stdin
1
2 4
1 6
stdout
2