text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int a[100100];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
cout << k / a[i] << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
long long n, k, p, q, o, b, c, ans = 0, w = 2;
string s;
cin >> n >> k;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (long long i = n - 1; i >= 0; i--)
if (k % a[i] == 0) {
cout << k / a[i] << endl;
break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a, ans;
int main() {
cin >> n >> k;
ans = k;
for (int i = 1; i <= n; ++i) {
cin >> a;
if (k % a == 0) ans = min(ans, k / a);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b;
int length, max = 0, ans;
scanf("%d%d", &a, &b);
for (int i = 0; i < a; i++) {
scanf("%d", &length);
if (b % length == 0 && length > max) max = length;
}
printf("%d\n", b / max);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a;
cin >> n >> k;
int ans = 1000;
for (int i = 0; i < n; i++) {
cin >> a;
if (k % a == 0 && k / a < ans) {
ans = k / a;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int mn = 1000000;
for (int i = 0; i < n; i++)
if (!(k % arr[i])) {
mn = min(mn, (k / arr[i]));
}
cout << mn;
}
|
#include <bits/stdc++.h>
bool myfunc(int a, int b) { return (a > b); }
using namespace std;
int main(void) {
int l, n, k;
vector<int> a;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> l;
a.push_back(l);
}
sort(a.begin(), a.end(), myfunc);
for (int i = 0; i < n; i++) {
if (k % a[i] == 0) {
cout << k / a[i] << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, h = 1e9;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (k % x == 0) {
int y = k / x;
if (y < h) {
h = y;
}
}
}
cout << h;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[110];
int main() {
std::ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
reverse(a, a + n);
for (int i = 0; i < n; i++)
if (k % a[i] == 0) {
cout << k / a[i];
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n < 1 || k > 100) {
return 0;
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 1 || a[i] > 100) {
return 0;
}
}
sort(a.begin(), a.end());
for (int j = n - 1; j >= 0; j--) {
if (k % a[j] == 0) {
cout << k / a[j] << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
int a[100], i, j, maxim, h, l, n, b;
int main() {
scanf("%d", &n);
scanf("%d", &l);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
i = 0;
j = 0;
b = 0;
h = l;
maxim = l;
while (i < n) {
if (l % a[i] == 0) {
h = l / a[i];
}
if (h < maxim) maxim = h;
i++;
}
printf("%d", maxim);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int Max = 1;
for (int i = 0; i < n; i++) {
if (k % a[i] == 0 && a[i] > Max) Max = a[i];
}
cout << k / Max << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, tk, ans;
priority_queue<int> pq;
scanf("%d %d", &n, &k);
while (n--) {
scanf("%d", &tk);
if (tk <= k) pq.push(tk);
}
while (!pq.empty()) {
if (k % pq.top() == 0) {
ans = k / pq.top();
break;
} else
pq.pop();
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long n, k, res;
long a[101];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (k % a[i] == 0) res = max(res, a[i]);
}
cout << k / res;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout.precision(10);
cout << fixed;
int N, K, Min = INT_MAX;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
if (K % A == 0) Min = min(Min, K / A);
}
cout << Min;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int b = -1;
int a;
for (int i = 0; i < n; ++i) {
cin >> a;
if (k % a == 0 && b < a) {
b = a;
}
}
cout << k / b << endl;
}
|
#include <bits/stdc++.h>
int n, k;
int a[110];
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int ma = -1;
for (int i = 0; i < n; i++) {
if (k % a[i] == 0) ma = max(ma, a[i]);
}
printf("%d\n", k / ma);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
int n, k, x;
vector<int> v1;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
v1.push_back(x);
}
sort(v1.begin(), v1.end());
for (int i = n - 1; i >= 0; i--) {
if (k % v1[i] == 0) {
cout << k / v1[i];
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod_expo(long long int MOD, long long int a, long long int b) {
long long int ans = 1;
while (b) {
if (b % 2) {
ans *= a;
ans %= MOD;
}
b /= 2;
a *= a;
a %= MOD;
}
return ans % MOD;
}
void display(vector<int> v1) {
for (int i = 0; i < v1.size(); i++) {
cout << v1[i] << " ";
}
cout << endl;
}
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, 1, -1};
using namespace std;
int n, k;
int dp[500][500];
vector<int> v1;
int solve(int idx, int left) {
if (idx == n) {
if (left == 0) {
return 0;
}
return (int)1e6;
}
if (left < 0) {
return (int)(1e6 + 100);
}
if (dp[idx][left] != -1) {
return dp[idx][left];
}
cout << idx << " " << left << endl;
int ans = (int)1e6;
for (int i = 0; i <= 200; i += 1) {
ans = min(ans, i + solve(idx + 1, left - (i * v1[idx])));
}
return dp[idx][left] = ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
memset(dp, -1, sizeof(dp));
cin >> n >> k;
int ans = (int)1e6 + 1000;
for (int i = 0; i < n; i += 1) {
int x;
cin >> x;
if (k % x == 0) {
ans = min(ans, k / x);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[100], m = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int o = 0; o < n; o++) {
if (k % a[o] == 0) {
m = max(m, a[o]);
}
}
cout << k / m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = 200020;
const int N = 1000060;
const int mod = (int)1e9 + 7;
int bc[1111][1111];
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
for (int i = n - 1; i >= 0; --i) {
if (k % a[i] == 0) {
cout << k / a[i] << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int Maxn3 = 1e3 + 10;
const long long int Maxn4 = 1e4 + 10;
const long long int Maxn5 = 1e5 + 10;
const long long int Maxn6 = 1e6 + 10;
const long long int Maxn7 = 1e7 + 10;
const long long int Maxn8 = 1e8 + 10;
const long long int Maxn9 = 1e9 + 10;
const long long int Maxn18 = 1e18 + 10;
const long long int Mod1 = 1e7 + 7;
const long long int Mod2 = 1e9 + 7;
const long long int LLMax = LLONG_MAX;
const long long int LLMin = LLONG_MIN;
const long long int INTMax = INT_MAX;
const long long int INTMin = INT_MIN;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long int k, n;
cin >> n >> k;
long long int d, mn = 100000000000;
while (n--) {
cin >> d;
if (k % d == 0) ((mn) = min((mn), (k / d)));
}
return cout << mn, 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i;
int n, k;
int num[1005];
int mini = 999999;
cin >> n >> k;
for (int a = 0; a < n; a++) cin >> num[a];
for (i = 0; i < n; i++) {
if (k % num[i] == 0) {
if (k / num[i] < mini) mini = k / num[i];
}
}
cout << mini << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int menor = 10000;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
if (k % tmp == 0) {
menor = (k / tmp < menor) ? k / tmp : menor;
}
}
cout << menor << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int i, ans = 1e9, a;
for (i = 0; i < n; i++) {
cin >> a;
if (m % a == 0) {
ans = min(ans, m / a);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename... T>
void rd(T&... args) {
((cin >> args), ...);
}
template <typename... T>
void ql(T&&... args) {
((cout << args << ' '), ...);
}
template <typename... T>
void sd(T&&... args) {
((cout << args << '\n'), ...);
}
const char nl = '\n';
const int maxn = 2e5 + 17;
const int INF = 2000 * 1000 * 1000;
long long gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
bool flase = false;
void notToday() {
int k, n, time = INT_MAX;
rd(n, k);
int uh[n];
for (int i = 0; i < int(n); ++i) rd(uh[i]);
for (int i = 0; i < int(n); ++i) {
if (k % uh[i] == 0 && k / uh[i] < time) time = k / uh[i];
}
sd(time);
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long TEST = 1;
while (TEST--) {
notToday();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
bool a[200];
memset(a, false, sizeof(a));
for (int i = 0; i < n; i++) {
int c;
scanf("%d", &c);
a[c] = true;
}
for (int j = k; j >= 1; j--) {
if (a[j] && !(k % j)) {
printf("%d", k / j);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool used[11111];
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
long long n, k, ans = 0;
cin >> n >> k;
long long a[111111];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (k % a[i] == 0 && a[i] > ans) {
ans = a[i];
}
}
cout << k / ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[105];
int main() {
int n, k;
cin >> n >> k;
int j = 1000;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (k % a[i] == 0) {
j = min(k / a[i], j);
}
}
cout << j;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod(long long a) {
if (a < 0)
return -1 * a;
else
return a;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n, 0);
for (int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
for (int i = n - 1; i >= 0; i--) {
if (k % v[i] == 0) {
cout << k / v[i] << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int ans = 1 << 30;
int main() {
int k, n;
scanf("%d%d", &k, &n);
for (int i = 1; i <= k; i++) {
int a;
cin >> a;
if (n % a == 0) {
ans = min(ans, n / a);
}
}
printf("%d", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, data[105], i;
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) scanf("%d", &data[i]);
sort(data, data + n);
for (i = n - 1; i >= 0; i--)
if (k % data[i] == 0) break;
printf("%d\n", k / data[i]);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, i, t;
int a[110];
while (scanf("%d%d", &n, &k) != EOF) {
t = 1;
for (i = 0; i < n; i++) scanf("%d", a + i);
for (i = 0; i < n; i++) {
if (k % a[i] == 0) {
t = t > a[i] ? t : a[i];
}
}
t = k / t;
printf("%d\n", t);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int ans = INT_MIN;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
if (k % temp == 0) {
ans = max(ans, temp);
}
}
cout << k / ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 10;
int n, k;
int a, ans = 10000;
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (k % a == 0) ans = min(k / a, ans);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = INT_MAX;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (!(k % x)) {
ans = min(ans, k / x);
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int* a = new int[n];
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
cout << k / a[i];
break;
}
}
delete[] a;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, a[100], i, t = 0, min, array[100], j = 0, swap, d, c;
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= n; i++) {
if (k % a[i - 1] == 0) array[j++] = k / a[i - 1];
}
for (c = 0; c < (j - 1); c++) {
for (d = 0; d < j - c - 1; d++) {
if (array[d] > array[d + 1]) {
swap = array[d];
array[d] = array[d + 1];
array[d + 1] = swap;
}
}
}
printf("%d", array[0]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
;
int n, k, ans = INT_MAX;
cin >> n >> k;
int arr[105];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
if (k % arr[i] == 0) {
ans = min(ans, k / arr[i]);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, n, m, t, s, v, vedro[105];
int main() {
cin >> v >> s;
for (i = 0; i < v; i++) {
cin >> vedro[i];
}
sort(vedro, vedro + v);
for (i = v - 1; i >= 0; i--) {
if (s % vedro[i] == 0) {
cout << s / vedro[i];
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (k % arr[i] == 0) {
ans = k / arr[i];
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
int arr[n];
int final = 1;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
for (int i = n - 1; i >= 0; i--) {
if (a % arr[i] == 0) {
final = a / arr[i];
break;
}
}
cout << final;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
int k;
int fac = INT_MIN;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
if (k % v[i] == 0 && v[i] > fac) fac = v[i];
}
cout << k / fac;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, i, minn = 10000, ans = 0, t;
int main() {
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> t;
if (k % t == 0) {
ans = k / t;
if (ans < minn) minn = ans;
}
}
cout << minn;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, l;
scanf("%d", &n);
scanf("%d", &l);
int temp, buckets[n], i;
for (i = 0; i < n; i++) {
scanf("%d", &buckets[i]);
}
for (i = 0; i < n; i++) {
if (l % buckets[i] == 0) {
continue;
} else {
buckets[i] = -9999999;
}
}
temp = buckets[0];
i = 1;
while (i < n) {
if (buckets[i] != -9999999) {
temp = (temp > buckets[i]) ? temp : buckets[i];
i++;
} else {
i++;
continue;
}
}
printf("%d", l / temp);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, ans, a, j = INT_MAX;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a;
if (a <= k && k % a == 0) j = min(j, k / a);
}
cout << j;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[110];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + n + 1);
for (int i = n; i >= 1; i--) {
if (k % a[i] == 0) {
printf("%d\n", k / a[i]);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int nbuckets, gardenlen;
cin >> nbuckets >> gardenlen;
int max = -1;
int bucket;
for (int i = 0; i < nbuckets; i++) {
cin >> bucket;
max = (bucket > max && gardenlen % bucket == 0) ? bucket : max;
}
cout << gardenlen / max << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for (int i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
cout << k / a[i];
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[103];
int dp[103];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ans = 1e9;
for (int i = 0; i < n; ++i) {
int sum = 0, cnt = 0;
while (sum < k) {
sum += a[i];
++cnt;
}
if (sum == k) ans = min(ans, cnt);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k, ans = 1000000007;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int first;
cin >> first;
if (k % first == 0) ans = min(ans, k / first);
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
const int MAXN = 100024;
const int MOD = 1e9 + 7;
const double eps = 1e-8;
using namespace std;
int main() {
int n, k;
scanf("%d", &n);
scanf("%d", &k);
int MIN = 0x3f3f3f3f;
for (int i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
if (k % a == 0) {
int num = k / a;
MIN = min(MIN, num);
}
}
printf("%d\n", MIN);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, ans = (1 << 30);
scanf("%d%d", &n, &k);
for (int i = 1, a; i <= n; ++i) {
scanf("%d", &a);
if (!(k % a) && k / a < ans) ans = k / a;
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int j, n, i, a = 0, b = 0, c = 0;
cin >> n >> a;
long long int arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
for (i = 0; i < n; i++) {
if (a % arr[i] == 0) {
c = (a / arr[i]);
}
}
cout << c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int answer = 1e9;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
int a;
cin >> a;
if (k % a == 0) {
answer = min(answer, k / a);
}
}
cout << answer << '\n';
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
priority_queue<int> q;
int val;
while (n--) cin >> val, q.push(val);
while (!q.empty())
if (k % q.top())
q.pop();
else
return !printf("%d", k / q.top());
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n + 1];
int ans = 99999;
for (int k = 1; k <= n; k++) {
cin >> a[k];
}
ans = 99999;
for (int k = 1; k <= n; k++) {
if (m % a[k] == 0) {
ans = min(ans, m / a[k]);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
if (n <= 1) return false;
for (long long i = 2; i < n; i++)
if (n % i == 0) return false;
return true;
}
long long isPalindrome(string str) {
long long l = 0;
long long h = str.length() - 1;
while (h > l) {
if (str[l++] != str[h--]) {
return -1;
}
}
return 1;
}
bool is_vowel(char c) {
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'y')
return true;
return false;
}
long long gcd(long long a, long long b) {
for (long long i = min(a, b); i > 0; i--) {
if (max(a, b) % i == 0 && min(a, b) % i == 0) {
return i;
}
}
return -1;
}
int32_t main() {
long long n, k;
cin >> n >> k;
;
long long A[n];
long long ans = -1;
for (long long i = 0; i < n; i++) {
cin >> A[i];
if (k % A[i] == 0) {
ans = max(ans, A[i]);
}
}
cout << k / ans << endl;
;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
while (cin >> n >> l) {
int res = 0xffff;
int m;
for (int i = 0; i < n; i++) {
cin >> m;
if (l % m == 0 && l / m < res) res = l / m;
}
cout << res << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
while (~scanf("%d%d", &n, &m)) {
int k, ans = 1 << 29;
for (int i = 0; i < n; i++) {
scanf("%d", &k);
if (m % k == 0) ans = min(ans, m / k);
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned short int n, k, i, max1, x, MIN_hours;
cin >> n;
cin >> k;
unsigned short int *A = new unsigned short int[n];
for (i = 0; i < n; i++) {
cin >> x;
A[i] = x;
}
max1 = 1;
for (i = 0; i < n; i++) {
if (x == 0) {
cout << "error the bucket should water minimal a segment " << endl;
return 0;
}
if (k % A[i] == 0) {
if (max1 <= A[i]) {
max1 = A[i];
}
}
}
MIN_hours = k / max1;
cout << MIN_hours;
delete[] A;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k;
int a[100];
int res[100];
int most;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
if (k % a[i] == 0) {
res[i] = k / a[i];
} else
res[i] = 0;
}
most = 0;
for (int i = 0; i < n; i++) {
if (most == 0) {
if (res[i] != 0) most = res[i];
} else {
if (res[i] < most && res[i] != 0) most = res[i];
}
}
printf("%d", most);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, len;
while (cin >> n >> len) {
int ans = 0x3f3f3f3f;
for (int i = 0; i < n; i++) {
int vol;
cin >> vol;
if (len % vol == 0) ans = min(ans, len / vol);
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
if (a[i] <= k && k % a[i] == 0) {
printf("%d\n", k / a[i]);
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k;
int mi = -1;
int t;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &t);
if (k % t == 0) {
if (mi == -1)
mi = k / t;
else if (k / t < mi)
mi = k / t;
}
}
printf("%d\n", mi);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int num = 0, i = 0, len = 0, a[101] = {0};
char blank;
scanf("%d %d%c", &num, &len, &blank);
for (i = 0; i < num; i++) {
scanf("%d%c", &a[i], &blank);
}
sort(a, a + num);
for (i = num - 1; i >= 0; i--) {
if (len % a[i] == 0) break;
}
printf("%d", len / a[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 98754312;
for (int i = 0; i < n; i++) {
int val;
cin >> val;
if (k % val == 0) ans = min(ans, k / val);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, p;
scanf("%d %d", &n, &k);
if ((n <= 100) && (k <= 100)) {
int A[n];
int i, j, min;
int B[n];
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
if (A[i] > 100) {
goto label;
}
}
j = 0;
for (i = 0; i < n; i++) {
p = A[i];
if ((k % p) == 0) {
B[j] = k / p;
j++;
}
}
min = B[0];
for (i = 0; i < j; i++) {
if (B[i] < min) {
min = B[i];
}
}
printf("%d\n", min);
}
label:
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int mh = k;
for (int i = 0; i < n; ++i) {
int bs;
cin >> bs;
if (k % bs == 0) {
mh = min(mh, k / bs);
}
}
cout << mh << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a, mit;
int main() {
cin >> n >> k;
mit = 10000000;
for (int i = 0; i < n; i++) {
cin >> a;
if (k % a == 0) mit = min(mit, k / a);
}
cout << mit << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int length, n, bucket, ans = 1e9 + 7;
int main() {
cin >> n >> length;
for (int i = 0; i < n; i++) {
cin >> bucket;
if (length % bucket == 0 && bucket <= length)
ans = (ans < length / bucket ? ans : length / bucket);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int a[110];
int x;
int time, best;
best = 9999999;
cin >> n >> k;
for (x = 1; x <= n; x++) {
cin >> a[x];
}
for (x = 1; x <= n; x++) {
if (k % a[x] == 0) {
time = k / a[x];
if (best > time) {
best = time;
}
}
}
cout << best << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
int i = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
cout << k / a[i];
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(int a, int b) { return a > b; }
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
reverse(a, a + n);
for (int i = 0; i < n; i++) {
if (k % a[i] == 0) {
cout << k / a[i] << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
int a[n];
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
std::sort(a, a + n);
for (int i = n - 1; i >= 0; i--)
if (k % a[i] == 0) {
printf("%d", k / a[i]);
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, m = 100000, a;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a;
if (k % a == 0) {
m = min(k / a, m);
}
}
cout << m << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> d;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
d.push_back(temp);
}
sort(d.begin(), d.end());
for (int i = d.size() - 1; i >= 0; i--) {
if (k % d[i] == 0) {
cout << (int)(k / d[i]) << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a, maxa = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a;
if (k % a == 0) {
if (a > maxa) maxa = a;
}
}
cout << k / maxa << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, ans = 1e9;
cin >> n >> k;
for (int i = 0, x; i < n; i++) {
cin >> x;
if (k % x == 0) ans = min(ans, k / x);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int infK = 0x3f3f3f3f;
const long long infLLK = 0x3f3f3f3f3f3f3f3f;
int main() {
int i, j, k;
int num, len;
priority_queue<int> pq;
cin >> num >> len;
for (i = 0; i < num; i++) {
int temp;
cin >> temp;
if (len % temp == 0) {
pq.push(temp);
}
}
int a = pq.top();
cout << len / a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 200;
const int INF = 0x3f3f3f3f;
int n, k, a[105], minn = INF, x;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
if (k % x == 0) minn = min(minn, k / x);
}
cout << minn;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[110];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (k % a[i] != 0) a[i] = 0;
}
sort(a, a + n);
cout << k / a[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
int maxi = INT_MIN;
for (int i = 0; i < n; i++) {
if (k % arr[i] == 0) {
if (arr[i] > maxi) maxi = arr[i];
}
}
cout << k / maxi << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void sol() {
long long int n, k;
cin >> n >> k;
long long int a[n + 1];
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + n);
long long int ans = INT_MAX;
for (int i = 0; i < n; ++i) {
if (k % a[i] == 0) ans = min(ans, k / a[i]);
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
sol();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long double eps = 1e-6;
template <typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
os << to_string(p.first) << " " << to_string(p.second);
return os;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
for (ll i = (0); i < (ll)(v.size()); i++) {
if (i) os << " ";
os << v[i];
}
return os;
}
struct modint {
ll n;
public:
modint(const ll n = 0) : n((n % mod + mod) % mod) {}
static modint pow(modint a, int m) {
modint r = 1;
while (m > 0) {
if (m & 1) {
r *= a;
}
a = (a * a);
m /= 2;
}
return r;
}
modint& operator++() {
*this += 1;
return *this;
}
modint& operator--() {
*this -= 1;
return *this;
}
modint operator++(int) {
modint ret = *this;
*this += 1;
return ret;
}
modint operator--(int) {
modint ret = *this;
*this -= 1;
return ret;
}
modint operator~() const { return (this->pow(n, mod - 2)); }
friend bool operator==(const modint& lhs, const modint& rhs) {
return lhs.n == rhs.n;
}
friend bool operator<(const modint& lhs, const modint& rhs) {
return lhs.n < rhs.n;
}
friend bool operator>(const modint& lhs, const modint& rhs) {
return lhs.n > rhs.n;
}
friend modint& operator+=(modint& lhs, const modint& rhs) {
lhs.n += rhs.n;
if (lhs.n >= mod) lhs.n -= mod;
return lhs;
}
friend modint& operator-=(modint& lhs, const modint& rhs) {
lhs.n -= rhs.n;
if (lhs.n < 0) lhs.n += mod;
return lhs;
}
friend modint& operator*=(modint& lhs, const modint& rhs) {
lhs.n = (lhs.n * rhs.n) % mod;
return lhs;
}
friend modint& operator/=(modint& lhs, const modint& rhs) {
lhs.n = (lhs.n * (~rhs).n) % mod;
return lhs;
}
friend modint operator+(const modint& lhs, const modint& rhs) {
return modint(lhs.n + rhs.n);
}
friend modint operator-(const modint& lhs, const modint& rhs) {
return modint(lhs.n - rhs.n);
}
friend modint operator*(const modint& lhs, const modint& rhs) {
return modint(lhs.n * rhs.n);
}
friend modint operator/(const modint& lhs, const modint& rhs) {
return modint(lhs.n * (~rhs).n);
}
};
istream& operator>>(istream& is, modint m) {
is >> m.n;
return is;
}
ostream& operator<<(ostream& os, modint m) {
os << m.n;
return os;
}
long long extgcd(long long a, long long b, long long& x, long long& y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
long long mod_inverse(long long a, long long m) {
long long x, y;
if (extgcd(a, m, x, y) == 1)
return (m + x % m) % m;
else
return -1;
}
vector<long long> fact(1010101 + 1, inf);
long long mod_fact(long long n, long long& e) {
if (fact[0] == inf) {
fact[0] = 1;
if (1010101 != 0) fact[1] = 1;
for (ll i = 2; i <= 1010101; ++i) {
fact[i] = (fact[i - 1] * i) % mod;
}
}
e = 0;
if (n == 0) return 1;
long long res = mod_fact(n / mod, e);
e += n / mod;
if ((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
return (res * fact[n % mod]) % mod;
}
long long mod_comb(long long n, long long k) {
if (n < 0 || k < 0 || n < k) return 0;
long long e1, e2, e3;
long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2),
a3 = mod_fact(n - k, e3);
if (e1 > e2 + e3) return 0;
return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}
using mi = modint;
mi mod_pow(mi a, ll n) {
mi ret = 1;
mi tmp = a;
while (n > 0) {
if (n % 2) ret *= tmp;
tmp = tmp * tmp;
n /= 2;
}
return ret;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
using ld = long double;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int ans = k;
for (ll i = (0); i < (ll)(n); i++) {
int a;
cin >> a;
if (k % a == 0) ans = min(ans, k / a);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> vedra(n);
for (int i = 0; i < n; i++) cin >> vedra[i];
sort(vedra.begin(), vedra.end());
for (int i = n - 1; i >= 0; i--) {
if (k % vedra[i] == 0) {
cout << k / vedra[i];
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int temp = 100000;
for (int i = 0; i < n; i++) {
if (k % a[i] == 0 && temp > k / a[i]) temp = k / a[i];
}
cout << temp;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i;
cin >> n >> k;
int arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
for (i = n - 1; i >= 0; i--) {
if (k % arr[i] == 0) {
cout << k / arr[i] << endl;
goto end;
}
}
end:
return 0;
}
|
#include <bits/stdc++.h>
const long long MOD = 1e9 + 7;
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int Ans = -1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (k % x == 0 && x > Ans) Ans = x;
}
cout << k / Ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
t = 1;
while (t--) {
solve();
cout << "\n";
;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, ans = INT_MAX;
cin >> n >> k;
for (long long int i = 0; i < n; i++) {
long long int x;
cin >> x;
if (k % x == 0) {
ans = min(ans, k / x);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, k, ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long int i, j;
cin >> n >> k;
ans = k;
for (i = 1; i <= n; i++) {
cin >> j;
if (k % j == 0) ans = min(ans, k / j);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, K;
int main() {
cin >> N >> K;
int ans = K;
while (N--) {
int w;
scanf("%d", &w);
if (K % w == 0) {
ans = min(ans, K / w);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char* argv[]) {
int n, k;
cin >> n >> k;
int max = -1;
int x;
for (int i = 0; i < n; i++) {
cin >> x;
if ((k % x == 0) && (x > max)) max = x;
}
cout << (k / max) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, ans = 0, j;
int arr[101];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> j;
if (k % j == 0) {
if (j > ans) ans = j;
}
}
cout << k / ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[105], i;
int main() {
cin >> n >> k;
for (i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
for (i = n; i >= 1; i--)
if (k % a[i] == 0) return cout << k / a[i], 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 101;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (k % a == 0) {
ans = min(ans, k / a);
}
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int z, c, x[1000], q = 0;
cin >> z >> c;
for (int i = 0; i < z; i++) cin >> x[i];
sort(x, x + z);
for (int i = 0; i < z; i++) {
if (c % x[i] == 0) {
q = x[i];
}
}
cout << c / q << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int convertstringtoint(string a) {
long long int ans = 0;
for (long long int i = 0; i < a.size(); i++) {
ans = (ans * 10) + a[i] - '0';
ans = ans;
}
return ans;
}
void solve() {
long long int n, k;
cin >> n >> k;
vector<long long int> v(n);
for (long long int i = 0; i < n; ++i) cin >> v[i];
long long int ans = INT_MAX;
for (auto x : v) {
if (k % x == 0) {
ans = min(ans, k / x);
}
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t;
t = 1;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int answer = -1;
int a;
for (int i = 0; i < n; i++) {
cin >> a;
if (k % a == 0 && a > answer) {
answer = a;
}
}
cout << k / answer;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, m, i, a;
m = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a;
if ((k % a == 0) && (a > m)) m = a;
}
a = k / m;
cout << a;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.