text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int n, d, mx[100005], a[100005], pre[100005], ans, cur, f;
int main() {
cin >> n >> d;
for (int i = 0; i < n; i++) cin >> a[i];
pre[0] = a[0];
for (int i = 1; i < n; i++) pre[i] = pre[i - 1] + a[i];
mx[n - 1] = pre[n - 1];
for (int i = n - 2; i > -1; i--) mx[i] = max(mx[i + 1], pre[i]);
for (int i = 0; i < n; i++) {
if (pre[i] > d) f = 1;
if (!a[i] && pre[i] + cur < 0) {
cur = d - mx[i];
ans++;
if (pre[i] + cur < 0) f = 1;
}
}
if (f)
cout << "-1\n";
else
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
long long dp[MAX] = {}, dp_max[MAX] = {};
void initiaize(int n) {
dp_max[n - 1] = dp[n - 1];
for (int i = n - 2; i >= 0; i--) dp_max[i] = max(dp_max[i + 1], dp[i]);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, l;
cin >> n >> l;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0)
dp[i] = a[i];
else
dp[i] = a[i] + dp[i - 1];
}
initiaize(n);
long long add = 0, ans = 0;
for (int i = 0; i < n; i++) {
if ((dp[i] + add) > l) {
cout << -1;
return 0;
}
if (a[i] == 0) {
if (dp[i] + add < 0) {
ans++;
add = l - dp_max[i];
if ((dp[i] + add) < 0) {
cout << -1;
return 0;
}
}
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[100010], csum[100010], mx[100010], mn[100100];
void fail() {
cout << -1 << endl;
exit(0);
}
int main() {
int n, d;
cin >> n >> d;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) csum[i] = csum[i - 1] + a[i];
mx[n + 1] = -2000000010, mn[n + 1] = 2000000010;
for (int i = 1; i <= n; i++) {
if (a[i] == 0)
mn[i] = min(mn[i + 1], csum[i]);
else
mn[i] = mn[i + 1];
}
for (int i = n; i >= 1; i--) mx[i] = max(csum[i], mx[i + 1]);
long long int del = 0, ans = 0;
for (int i = 1; i <= n; i++) {
if (mn[i] + del < 0) {
int aux = mx[i] + del;
if (aux < d) {
ans++;
del += d - aux;
}
}
if (csum[i] + del > d) fail();
if (a[i] == 0 && csum[i] + del < 0) fail();
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d, ans, x, l, r;
int main() {
ios::sync_with_stdio(0);
cin >> n >> d;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x != 0) {
l += x, r = min(d, r + x);
if (l > d) {
cout << -1;
return 0;
}
} else {
if (r < 0)
l = 0, r = d, ans++;
else
l = max(l, 0);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long n, d;
cin >> n >> d;
vector<long long> delta(n);
vector<long long> rs(n);
for (int i = 0; i < n; ++i) cin >> delta[i];
rs[0] = delta[0];
for (int i = 1; i < n; ++i) rs[i] = rs[i - 1] + delta[i];
vector<long long> maxTotDeposit(n);
long long mxSoFar = LLONG_MIN;
for (int i = n - 1; i >= 0; --i) {
mxSoFar = max(mxSoFar, rs[i]);
maxTotDeposit[i] = d - mxSoFar;
if (mxSoFar > d) {
cout << -1;
return 0;
}
}
long long dep = 0;
int ans = 0;
for (int i = 0; i < n; ++i) {
if (!delta[i] && rs[i] + maxTotDeposit[i] < 0) {
cout << -1;
return 0;
}
if (!delta[i] && rs[i] + dep < 0) {
++ans;
dep = maxTotDeposit[i];
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, abc = 864197532, N = 100007, logN = 17;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, d;
cin >> n >> d;
vector<int> a(n, 0);
for (int i = 0; i < n; ++i) cin >> a[i];
int tmp = 0;
for (int i = 0; i < n; ++i) {
if (a[i]) {
tmp += a[i];
if (tmp > d) {
cout << -1 << endl;
return 0;
}
} else {
if (tmp < 0) {
tmp = 0;
}
}
}
int ans = 0;
vector<int> pre(n, 0);
for (int i = 0; i < n; ++i) pre[i] = a[i] + (i ? pre[i - 1] : 0);
vector<int> suf = pre;
for (int i = n - 2; ~i; --i) suf[i] = max(suf[i], suf[i + 1]);
int add = 0;
for (int i = 0; i < n; ++i) {
if (pre[i] + add < 0 && a[i] == 0) {
add = d - suf[i];
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, llog = 31;
int ar[N], bal[N], suf[N];
void solve() {
int n, d;
scanf("%d%d", &n, &d);
for (int i = 0; i < n; ++i) scanf("%d", ar + i);
bal[0] = ar[0];
for (int i = 0; i < n; ++i) {
bal[i] = ar[i] + bal[i - 1];
if (bal[i] > d) {
cout << -1;
return;
}
}
suf[n - 1] = bal[n - 1];
for (int i = n - 2; i >= 0; --i) suf[i] = max(suf[i + 1], bal[i]);
int cur = 0, rez = 0;
for (int i = 0; i < n; ++i) {
if (!ar[i] && bal[i] + cur < 0) {
cur += d - suf[i] - cur;
if (bal[i] + cur < 0) {
cout << -1;
return;
}
++rez;
}
}
cout << rez;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, d;
long long a[100005];
vector<long long> save;
int main() {
scanf("%I64d%I64d", &n, &d);
for (long long i = 0; i < n; i++) scanf("%I64d", &a[i]);
long long sum = 0, cnt = 0;
long long lim = 1000000000;
for (long long i = 0; i < n; i++) {
if (a[i] == 0) {
if (sum < 0) {
if (cnt != 0 && lim >= (-sum)) {
lim += sum;
sum = 0;
} else {
cnt++;
sum = 0;
lim = 1000000000;
}
}
}
sum += a[i];
if (sum > d) {
printf("-1\n");
return 0;
}
lim = min(lim, d - sum);
}
printf("%I64d\n", cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void swap(long long* a, long long* b) {
long long temp = *a;
*a = *b;
*b = temp;
}
struct no {
long long sum, maxpre;
};
no t[4 * 100005];
void build(long long a[], long long v, long long st, long long en) {
if (st == en) {
t[v].sum = a[st];
t[v].maxpre = a[st];
} else {
long long md = (st + en) / 2;
build(a, 2 * v, st, md);
build(a, 2 * v + 1, md + 1, en);
t[v].sum = t[2 * v].sum + t[2 * v + 1].sum;
t[v].maxpre = max(t[2 * v].maxpre, t[2 * v].sum + t[2 * v + 1].maxpre);
}
}
no qry(long long v, long long st, long long en, long long l, long long r) {
no res;
res.sum = res.maxpre = 0 - 1000000007;
if (st > r || en < l) {
return res;
}
if (st >= l && en <= r) {
return t[v];
}
long long md = (st + en) / 2;
if (l > md) {
return qry(2 * v + 1, md + 1, en, l, r);
}
if (r <= md) {
return qry(2 * v, st, md, l, r);
}
no lf = qry(2 * v, st, md, l, r);
no rg = qry(2 * v + 1, md + 1, en, l, r);
res.sum = lf.sum + rg.sum;
res.maxpre = max(lf.maxpre, lf.sum + rg.maxpre);
return res;
}
int32_t main() {
long long n, d;
cin >> n >> d;
long long a[n + 1];
for (long long i = 1; i <= n; i++) cin >> a[i];
build(a, 1, 1, n);
long long sm = 0, days = 0;
bool flag = true;
for (long long i = 1; i <= n; i++) {
if (a[i] == 0) {
if (sm >= 0)
;
else {
long long mnm = qry(1, 1, n, i, n).maxpre;
if (mnm < 0)
;
else if (mnm > d) {
flag = false;
break;
} else {
sm = max(0LL, d - mnm);
days++;
}
}
} else {
sm += a[i];
}
if (sm > d) {
flag = false;
break;
}
}
if (flag)
cout << days << '\n';
else
cout << -1 << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) { return x ? gcd(y % x, x) : y; }
long long mcm(long long x, long long y) { return x * y / gcd(x, y); }
int main(int argc, char *argv[]) {
cout.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
long long N, D;
while (cin >> N >> D) {
long long ans = 0;
bool can = true;
long long mini = 0;
long long maxi = 0;
for (int i = 0; i < (N); i++) {
long long A;
cin >> A;
if (A > 0) {
if (mini + A > D) can = false;
mini = mini + A;
maxi = maxi + A;
if (maxi > D) maxi = D;
}
if (A < 0) {
mini += A;
maxi += A;
}
if (A == 0) {
if (maxi < 0) {
ans++;
maxi = D;
}
if (mini < 0) {
mini = 0;
}
}
}
if (!can) ans = -1;
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d, a[100005], b[100005], s = 0, f = 0, l = 0, k = 0;
cin >> n >> d;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
if (a[i] != 0) {
s += a[i];
if (s > d) {
cout << "-1";
f = 1;
break;
}
} else {
if (s < 0) s = 0;
}
}
if (f == 0) {
s = 0;
for (int i = 0; i < n; i++) {
if (a[i] != 0) {
if ((s + a[i]) > d) {
s = d;
} else
s += a[i];
} else {
if (s < 0) {
s = d;
l++;
}
}
}
cout << l;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int a[MAXN];
int main() {
int n, d;
scanf("%d%d", &n, &d);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
long long mi = 0, mx = 0;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == 0) {
if (mx < 0) {
ans++;
mx = d;
mi = 0;
} else {
if (mi < 0) mi = 0;
}
} else {
mi += a[i];
if (mi > d) {
puts("-1");
return 0;
}
mx += a[i];
if (mx > d) {
mx = d;
}
}
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[110000];
int pre[110000];
int limit[110000];
int main() {
int n, d;
cin >> n >> d;
for (int i = 1; i <= n; i++) {
cin >> A[i];
pre[i] += A[i];
}
for (int i = 2; i <= n; i++) {
pre[i] += pre[i - 1];
}
for (int i = n; i >= 1; i--) {
if (i != n)
limit[i] = min(limit[i + 1], d - pre[i]);
else
limit[i] = d - pre[i];
}
bool ok = 1;
for (int i = 1; i <= n; i++) {
if (limit[i] < 0) ok = 0;
if (A[i] == 0 && (limit[i] + pre[i] < 0)) ok = 0;
}
if (!ok) {
cout << -1 << endl;
} else {
long long tot = 0;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (A[i] == 0 && (tot + pre[i] < 0)) ans++, tot = limit[i];
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void readi(int &x) {
int v = 0, f = 1;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-')
f = -1;
else
v = v * 10 + c - '0';
while (isdigit(c = getchar())) v = v * 10 + c - '0';
x = v * f;
}
void readll(long long &x) {
long long v = 0ll, f = 1ll;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-')
f = -1;
else
v = v * 10 + c - '0';
while (isdigit(c = getchar())) v = v * 10 + c - '0';
x = v * f;
}
void readc(char &x) {
char c;
while ((c = getchar()) == ' ')
;
x = c;
}
void writes(string s) { puts(s.c_str()); }
void writeln() { writes(""); }
void writei(int x) {
if (!x) putchar('0');
char a[25];
int top = 0;
while (x) {
a[++top] = (x % 10) + '0';
x /= 10;
}
while (top) {
putchar(a[top]);
top--;
}
}
void writell(long long x) {
if (!x) putchar('0');
char a[25];
int top = 0;
while (x) {
a[++top] = (x % 10) + '0';
x /= 10;
}
while (top) {
putchar(a[top]);
top--;
}
}
int n, m, i, j, su[100005], mx[100005], ans, cur, a[100005];
int main() {
ios::sync_with_stdio(false);
;
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = n; i; i--) {
mx[i] = max(0, max(a[i], mx[i + 1] + a[i]));
}
for (i = 1; i <= n; i++) {
mx[i] = m - mx[i];
}
for (i = 1; i <= n; i++) {
if (cur > mx[i]) {
cout << -1;
return 0;
}
if (a[i]) {
cur += a[i];
} else {
if (cur < 0) {
if (mx[i] < 0) {
cout << -1;
return 0;
}
cur = mx[i];
ans++;
}
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
long long pref[N];
int main() {
int n, d;
cin >> n >> d;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (i)
pref[i] += pref[i - 1] + a[i];
else
pref[i] += a[i];
}
int ans = 0;
long long mini = 0, maxi = 0;
for (int i = 0; i < n; ++i) {
if (!a[i]) {
if (pref[i] + mini >= 0)
continue;
else
mini = -pref[i];
if (pref[i] + maxi < 0) {
ans++;
maxi = d - pref[i];
}
}
if (pref[i] + mini > d) return cout << -1, 0;
if (pref[i] + maxi > d) maxi = d - pref[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using std::max;
using std::min;
struct limit {
long long max, min;
};
limit lim[100010];
int n, d;
int main() {
scanf("%d%d", &n, &d);
long long sum = 0, low = 0;
for (int i = 1, x; i <= n; ++i) {
scanf("%d", &x);
sum += x;
if (sum > d) {
puts("-1");
return 0;
}
if (x == 0) {
low = max(low, -sum);
}
lim[i].max = d - sum;
lim[i].min = low;
}
for (int i = n - 1; i >= 1; --i) {
lim[i].max = min(lim[i].max, lim[i + 1].max);
}
for (int i = 1; i <= n; ++i) {
if (lim[i].max < lim[i].min) {
puts("-1");
return 0;
}
}
long long high = 0;
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (lim[i].min > high) {
++ans;
high = lim[i].max;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
constexpr int MAX_N = 100100;
using namespace std;
int n, d;
int arr[MAX_N];
int max_pre[MAX_N];
int main() {
scanf(" %d %d", &n, &d);
for (int i = 0; i < n; ++i) {
scanf(" %d", &arr[i]);
}
bool poss = true;
int cur_min = 0;
for (int i = 0; i < n; ++i) {
if (arr[i] == 0) {
cur_min = max(cur_min, 0);
} else {
cur_min += arr[i];
}
if (cur_min > d) {
poss = false;
}
}
if (!poss) {
printf("-1\n");
} else {
for (int i = n - 1; i >= 0; --i) {
max_pre[i] = max(arr[i], arr[i] + max_pre[i + 1]);
}
int ans = 0;
int cur = 0;
for (int i = 0; i < n; ++i) {
if (arr[i] == 0) {
if (cur < 0) {
++ans;
cur = d - max_pre[i];
}
} else {
cur += arr[i];
}
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long a, long long b) {
while (b) {
a %= b, swap(a, b);
}
return a;
}
inline long long lcm(long long a, long long b) {
return a * b / max(1LL, gcd(a, b));
}
mt19937 Random((long long)time(0));
inline long long rnd(long long x) { return Random() % x; }
const long long INF = (long long)1e9 + 2017;
const long long MOD = (long long)1e9 + 7;
const long double EPS = 1e-10;
const long double PI = acos(-1.0);
const long long N = 1e5 + 10;
long long arr[N], suf[N];
void source() {
long long n, d;
cin >> n >> d;
for (long long i = 0; i < n; ++i) {
cin >> arr[i];
}
suf[n - 1] = arr[n - 1];
for (long long i = n - 2; i >= 0; --i) {
suf[i] = max(0ll, suf[i + 1]) + arr[i];
}
long long cur = 0, ans = 0;
for (long long i = 0; i < n; ++i) {
cur += arr[i];
if (cur > d) {
cout << -1;
return;
}
if (!arr[i] && cur < 0) {
cur = d - suf[i];
if (cur < 0) {
cout << -1;
return;
}
ans++;
}
}
cout << ans;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios_base::fixed, ios_base::floatfield);
cout.precision(10);
source();
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
long long n, d, sol, ofs, curr;
int l[MAXN];
long long sum[MAXN], maxi[MAXN];
int main() {
cin >> n >> d;
for (int i = 0; i < n; i++) {
scanf("%d", &l[i]);
if (i == 0)
sum[i] = l[i];
else
sum[i] = sum[i - 1] + l[i];
}
maxi[n] = -100000000000000007LL;
for (int i = n - 1; i >= 0; i--) {
maxi[i] = max(maxi[i + 1], sum[i]);
}
for (int i = 0; i < n; i++) {
long long naj = maxi[i] + ofs;
if (naj > d) {
cout << -1;
return 0;
}
if (l[i] != 0) {
curr += l[i];
} else if (curr < 0) {
sol++;
ofs += d - naj;
curr += d - naj;
if (curr < 0) {
cout << -1;
return 0;
}
}
}
cout << sol;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-14;
const double pi = acos(-1.0);
int dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int a[maxn];
int main() {
int n, d;
while (~scanf("%d%d", &n, &d)) {
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int minn = 0, maxx = 0;
int res = 0;
for (int i = 0; i < n; i++) {
if (!a[i]) {
if (minn < 0) minn = 0;
if (maxx < 0) {
maxx = d, res++;
}
} else {
minn += a[i];
maxx += a[i];
if (minn > d) {
printf("-1\n");
return 0;
}
if (maxx > d) maxx = d;
}
}
printf("%d\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
enum { WHITE, GREY, BLACK };
using namespace std;
long long int inf = 1e18;
template <class T>
T gcd(T a, T b) {
return b == 0 ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <typename T>
T last_bit(T n) {
return n & 1;
}
template <class T>
T big_mod(T n, T p, T m) {
if (p == 0) return (T)1;
T x = big_mod(n, p / 2, m);
x = (x * x) % m;
if (p & 1) x = (x * n) % m;
return x;
}
template <class T>
T modInv(T a, T m) {
T x, y;
extgcd(a, m, x, y);
x %= m;
while (x < 0) {
x += m;
}
return x;
}
template <class T>
T extgcd(T a, T b, T& x, T& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
} else {
int g = extgcd(b, a % b, y, x);
y -= a / b * x;
return g;
}
}
template <class T>
T multiplication(T n, T p, T m) {
if (p == 0) return (T)0;
T x = multiplication(n, p / 2, m);
x = (x + x) % m;
if (p & 1) x = (x + n) % m;
return x;
}
template <class T>
T my_pow(T n, T p) {
if (p == 0) return 1;
T x = my_pow(n, p / 2);
x = (x * x);
if (p & 1) x = (x * n);
return x;
}
template <class T>
double getdist(T a, T b) {
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
template <class T>
T extract(string s, T ret) {
stringstream ss(s);
ss >> ret;
return ret;
}
template <class T>
string tostring(T n) {
stringstream ss;
ss << n;
return ss.str();
}
template <class T>
T Mod(T n, T m) {
return (n % m + m) % m;
}
template <class T>
T MIN3(T a, T b, T c) {
return min(a, min(b, c));
}
template <class T>
T MAX3(T a, T b, T c) {
return max(a, max(b, c));
}
template <class T>
void print_vector(T& v) {
int sz = v.size();
if (sz) cout << v[0];
for (int i = 1; i < sz; i++) cout << ' ' << v[i];
cout << "\n";
}
bool isVowel(char ch) {
ch = toupper(ch);
if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
return true;
return false;
}
bool isConsonant(char ch) {
if (isalpha(ch) && !isVowel(ch)) return true;
return false;
}
template <class R>
R Josephus(R n, R k) {
R ans = 1;
for (R i = 2; i <= n; i++) ans = (ans + k - 1) % i + 1;
return ans;
}
template <class R>
R toitent_Phi2(R a) {
R result = a;
for (R i = 2; i * i <= a; i++) {
if (a % i == 0) result = result - result / i;
while (a % i == 0) a = a / i;
}
if (a > 1) result = result - result / a;
return result;
}
template <typename T>
T Angle(T x1, T y1, T x2, T y2) {
return atan(double(y1 - y2) / double(x1 - x2));
}
long long int a[100009];
int main() {
cin.sync_with_stdio(false);
cin.tie();
;
long long int T, t;
long long int i, j, k;
long long int n, m, q;
cin >> n >> q;
long long int x = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
x += a[i];
if (a[i] == 0) {
if (x < 0) x = 0;
}
if (x > q) {
cout << "-1\n";
return 0;
}
}
long long int ans = 0;
x = 0;
for (i = 1; i <= n; i++) {
x += a[i];
if (a[i] == 0) {
if (x < 0) {
x = q;
ans++;
}
}
if (x > q) x = q;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
int n, d;
int a[maxn];
void nhap() {
cin >> n >> d;
int l = 0;
int r = 0;
int sl = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] == 0) {
if (r < 0) {
sl++;
l = 0;
r = d;
}
l = max(l, 0);
} else {
l += a[i];
r = min(r + a[i], d);
if (l > d) {
cout << -1;
return;
}
}
}
cout << sl;
}
int main() { nhap(); }
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, result;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
if (k % a == 0) result = min(result, k / a);
}
printf("%d\n", result);
return 0;
}
|
#include <bits/stdc++.h>
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
const double PI = acos(-1), EPS = 1e-7;
const int OO = 0x3f3f3f3f, N = 1e7 + 5, mod = 1e9 + 7;
using namespace std;
long long gcd(long long x, long long y) { return (!y) ? x : gcd(y, x % y); }
long long lcm(long long x, long long y) { return ((x / gcd(x, y)) * y); }
void file() {}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
}
vector<int> v, vv;
int main() {
file();
fast();
long long n, k;
cin >> n >> k;
v.resize(n);
for (int i = 0; i < n; i++) cin >> v[i];
sort(((v).begin()), ((v).end()));
for (int i = 1; i * i <= k; i++) {
if (k % i == 0) {
vv.push_back(i);
int j = k / i;
if (i != j) vv.push_back(j);
}
}
sort(((vv).begin()), ((vv).end()));
long long mx = 0;
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < vv.size(); j++) {
if (v[i] == vv[j]) {
mx = v[i];
}
}
}
cout << k / mx << '\n';
}
|
#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 && maxa < a) {
maxa = a;
}
}
cout << k / maxa;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr;
int q;
vector<int> arr1;
for (int i = 0; i < n; i++) {
cin >> q;
arr.push_back(q);
}
sort(arr.begin(), arr.end());
for (int i = 0; i < n; i++) {
if (k % arr[i] == 0) arr1.push_back(k / arr[i]);
}
cout << *min_element(arr1.begin(), arr1.end()) << endl;
;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long n, q, m, t, r, k, i, j, x, b1, b2, s1, s2,
last = 0, y, z, p, v, val = 0, minans = LLONG_MAX, a, b, c, d, flag = 0,
u;
cin >> n >> k;
vector<long long> arr(n);
for (i = 0; i < n; i++) cin >> arr[i];
for (i = 0; i < n; i++) {
if (k % arr[i] == 0) {
minans = min(minans, k / arr[i]);
}
}
cout << minans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[101], m;
int main() {
m = 101;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (k % a[i] == 0) m = min(m, k / a[i]);
}
cout << m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int y = k;
for (int x, i = 0; i < n; i++) {
cin >> x;
if (k % x) continue;
y = min(k / x, y);
}
cout << y;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, w[110], mn = 1000;
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> w[i];
for (int i = 0; i < n; i++)
if (k % w[i] == 0) mn = min(mn, (k / w[i]));
cout << mn << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<int> bckt;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, a, b = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a;
bckt.push_back(a);
}
sort(bckt.begin(), bckt.end());
for (int i = 0; i < n; i++) {
if (k % bckt[i] == 0) {
b = bckt[i];
}
}
cout << k / b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
int a = k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (k % arr[i] == 0) {
a = min(k / arr[i], a);
}
}
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:167772160000")
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int ans = 1E9;
int n, k;
cin >> n >> k;
for (int i = 0; i < (n); i++) {
int a;
cin >> a;
if (k % a != 0) continue;
ans = min(ans, k / a);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
scanf("%d", &n);
scanf("%d", &l);
int a[n];
int ans = -1;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
if (l % a[i] == 0) ans = a[i];
}
ans = l / ans;
printf("%d", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<int> b;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (k % a[i] == 0) b.push_back(a[i]);
}
sort(b.begin(), b.end());
int ans = b.size() - 1;
cout << k / b[ans];
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int i, n, length;
int a_num;
int num = 100;
scanf("%d %d", &n, &length);
for (i = 0; i < n; i++) {
scanf("%d", &a_num);
if (length % a_num == 0)
if (length / a_num < num) num = length / a_num;
}
printf("%d", num);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = -1;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (k % x == 0) {
if (ans == -1)
ans = k / x;
else
ans = min(ans, k / x);
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, minn = 1000000, ans = 0, t;
cin >> n >> k;
for (int i = 1; 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>
using namespace std;
int main() {
int n, m, num, ans = 2005;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> num;
if (!(m % num)) ans = min(ans, m / num);
}
cout << ans << '\n';
}
|
#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];
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;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int res = k;
int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (k % a[i] == 0) {
res = min(res, k / a[i]);
}
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
const int mod = 1000000007;
const int KOK = 100000;
const int li = 100005;
const int LOG = 20;
int n, m, cev, x, a[li];
vector<int> v;
char c;
string s;
int main() {
scanf("%d %d", &n, &m);
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 (m % a[i] == 0) {
printf("%d\n", m / a[i]);
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a;
int res = 100;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if ((k % a) == 0) {
if (res > (k / a)) res = k / a;
}
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, h, l, maxi;
int t[150], v[100];
cin >> n;
cin >> k;
h = k;
l = 0;
for (int i = 0; i < n; i++) {
cin >> t[i];
if (k % t[i] == 0) {
v[l] = t[i];
l++;
}
}
maxi = v[0];
for (int i = 1; i < l; i++) {
if (maxi < v[i]) maxi = v[i];
}
h = k / maxi;
cout << h;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, k;
vector<long long int> v;
cin >> n >> k;
long long int x;
while (n--) {
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end(), greater<int>());
for (long long int i = 0; i < v.size(); i++) {
if (k % v[i] == 0) {
cout << k / v[i];
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k;
cin >> n >> k;
int a[n], x = -1;
for (i = 0; i < n; i++) {
cin >> a[i];
if (k % a[i] == 0) {
if (x < a[i]) x = a[i];
}
}
cout << k / x;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[105];
int main() {
int n;
int k;
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> arr[i];
int count = 105;
int ans;
for (int i = 0; i < n; i++) {
if (k % arr[i] == 0) {
ans = k / arr[i];
}
count = min(count, ans);
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
for (int i = n - 1; i >= 0; i--) {
if (k % arr[i] == 0) {
cout << (k / arr[i]) << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, i;
scanf("%d %d", &n, &k);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int min = k;
for (i = 0; i < n; i++) {
if (k % a[i] == 0 && k / a[i] < min) min = k / a[i];
}
printf("%d", min);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
int ans = -1;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(&a[0], &a[n]);
for (int i = n - 1; i >= 0; i--)
if (k % a[i] == 0) {
ans = k / a[i];
break;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[10000], c = 0, bal, hoga, ok;
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) {
bal = k / a[i];
cout << bal << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int a, long long int b) {
if (b == 0) return 1;
long long int z = power(a, b / 2);
if (b % 2 == 0) return z * z;
return a * z * z;
}
int main() {
int n, k;
cin >> n >> k;
int ans = 1;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (k % a == 0) ans = max(ans, a);
}
cout << k / ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void XsliferX() {
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
}
int dx[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0};
int dy[9] = {0, 0, 1, -1, 1, -1, -1, 1, 0};
int main() {
XsliferX();
int n, l, x;
cin >> n >> l;
int mn = 10000;
for (int i = 0; i < n; i++) {
cin >> x;
if (l % x == 0) {
mn = min(mn, l / x);
}
}
cout << mn;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, Max;
Max = -1;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
if (k % a == 0) Max = max(Max, a);
}
printf("%d\n", k / Max);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1001;
int An[MAX];
int main() {
int n, l;
cin >> n >> l;
for (int i = 0; i < n; i++) cin >> An[i];
sort(An, An + n, greater<int>());
for (int i = 0; i < n; i++) {
if (l % An[i] == 0) {
cout << l / An[i] << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a, d;
void solve() {
cin >> n >> k;
d = 1;
for (int i = 1; i <= n; i++) {
cin >> a;
if (k % a == 0 && a >= d) d = a;
}
cout << (k / d) << "\n";
}
int main() {
std::ios::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cout << v << " ";
return *this;
}
} dbg;
int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1};
int dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
int a[111];
int main() {
int t = 0, z = 0, len;
int n = 0, k = 0, m = 0;
int ans = 0;
ans = INT_MAX;
scanf("%d %d", &n, &k);
for (int l = 0; l < n; l++) scanf("%d", &a[l]);
sort(a, a + n);
for (int l = 0; l < n; l++) {
if (!(k % a[l])) ans = min(ans, (k / a[l]));
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, mx = 0;
std::cin >> n >> k;
if (n == 123) std::cout << "Fuck-You\n";
for (int i = 0, x; i < n; i++) {
std::cin >> x;
if (!(k % x)) mx = std::max(mx, x);
}
std::cout << k / mx;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long n, k, a[105], x, mn = N;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
for (int i = n; i >= 1; i--) {
if (k % a[i] == 0) {
cout << k / a[i];
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> instersection(vector<int> &v1, vector<int> &v2) {
vector<int> v3;
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(),
back_inserter(v3));
return v3;
}
int main() {
int buck_num, garden_len;
cin >> buck_num >> garden_len;
int tmp;
vector<int> buckets;
for (int i = 0; i < buck_num; i++) {
cin >> tmp;
buckets.push_back(tmp);
}
vector<int> divs;
for (int i = 1; i <= garden_len; i++) {
if (garden_len % i == 0) divs.push_back(i);
}
vector<int> res;
res = instersection(divs, buckets);
cout << garden_len / (*(res.end() - 1));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[110], r = 1000, c = 1100;
cin >> 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) {
c = k / a[i];
}
if (c < r) {
r = c;
}
}
printf("%d", r);
}
|
#include <bits/stdc++.h>
using namespace std;
int aa[110];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &aa[i]);
}
sort(aa, aa + n);
int op;
for (int i = n - 1; i >= 0; i--) {
if (k % aa[i] == 0) {
op = k / aa[i];
break;
}
}
printf("%d\n", op);
}
|
#include <bits/stdc++.h>
int max(int, int);
int main() {
int n, i, k, a[100000], s = 1;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
if (k % a[i] == 0) s = max(a[i], s);
}
printf("%d", k / s);
return 0;
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, mn = 1000000, b;
cin >> n >> k;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (k % a == 0) b = k / a;
mn = min(mn, b);
}
cout << mn << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a;
int ans, Ans = 10000;
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a;
if (a > k) continue;
if (k % a == 0) {
ans = k / a;
if (ans < Ans) Ans = ans;
}
}
cout << Ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, ar[1000];
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> ar[i];
}
sort(ar, ar + n);
for (j = n - 1; j >= 0; j--) {
if (m % ar[j] == 0) {
cout << m / ar[j] << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
;
int n, k, a, maxi = 0;
cin >> n >> k;
while (n--) {
cin >> a;
if (k % a == 0) maxi = max(maxi, a);
}
cout << ceil((double)k / maxi) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
long long n, k;
long long h, maxx;
maxx = INT_MIN;
cin >> n >> k;
long long arr[n];
for (long long i = 0; i < n; i++) {
cin >> arr[i];
if (k % arr[i] == 0) {
maxx = max(maxx, arr[i]);
}
}
h = k / maxx;
cout << h << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a = 1, b;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> b;
if (a < b && k % b == 0) a = b;
}
cout << k / a;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
inline bool isPrime(long long int n) {
if (n <= 1) {
return false;
}
if (n <= 3) {
return true;
}
if (n % 2 == 0 || n % 3 == 0) {
return false;
}
for (int i = 5; i * i <= n; i = i + 6) {
if (n % i == 0 || n % (i + 2) == 0) {
return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
long long int t, n, a, b, c, d, e, f, x, y;
cin >> a >> b;
c = INT_MAX;
for (int i = 0; i < a; i++) {
cin >> x;
if (b % x == 0) {
c = min(c, b / x);
}
}
cout << c << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
scanf("%lld", &n);
scanf("%lld", &k);
long long i, a[n];
for (i = 0; i < n; i++) scanf("%lld", &a[i]);
sort(a, a + n);
for (i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) break;
}
printf("%lld\n", k / a[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-6;
const long long int MOD = 1e9 + 7;
const long long int MAX = 1 << 16;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int n, k, min1 = INT_MAX;
cin >> n >> k;
for (long long int i = 0; i != n; ++i) {
long long int temp;
cin >> temp;
if (temp <= k && k % temp == 0) {
min1 = min(min1, k / temp);
}
}
cout << min1 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
int main(int argc, const char* argv[]) {
int a[101] = {0}, k, n;
scanf("%d%d", &n, &k);
int temp = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (k % a[i] == 0) {
if (a[i] > temp) temp = a[i];
}
}
int ans;
ans = k / temp;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
vector<int> v(n);
for (int i = 0; i < n; i++) scanf("%d", &v[i]);
sort(v.begin(), v.end());
for (int i = n - 1; i >= 0; i--) {
if (k % v[i] == 0) {
printf("%d\n", k / v[i]);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[1005], m;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++)
if (k % a[i] == 0)
if (a[i] > m) m = a[i];
cout << k / m << endl;
return 0;
}
|
#include <bits/stdc++.h>
int n, k, a[1001];
int main() {
scanf("%d %d", &n, &k);
int i, min = k;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (k / a[i] * a[i] == k && k / a[i] < min) min = k / a[i];
}
printf("%d", min);
}
|
#include <bits/stdc++.h>
using namespace std;
int a[105];
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 + 1 + n);
for (int i = n; i >= 1; i--) {
if (k % a[i] == 0) {
printf("%d\n", k / a[i]);
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int e = 0;
for (int i = 0; i < a; ++i) {
int c;
cin >> c;
if (b % c == 0 && c > e) e = c;
}
cout << b / e;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a;
cin >> n >> k;
int smallest = k + 1;
for (int i = 0; i < n; i++) {
cin >> a;
if (k % a == 0) smallest = min(smallest, k / a);
}
cout << smallest << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, no, res = 1000000000, temp;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &no);
if (k % no == 0) {
temp = k / no;
if (temp < res) res = temp;
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[100], n, temp, m, ans;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < (n - 1); i++) {
for (int j = 0; j < n - i - 1; j++) {
if (a[j] < a[j + 1]) {
temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
for (int i = 0; i < n; i++) {
if (m % a[i] == 0) {
ans = max(0, m / a[i]);
cout << ans << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = pow(10, 9) + 7;
int gcdExtended(int a, int b, int *x, int *y);
int modInverse(int b, int m) {
int x, y;
int g = gcdExtended(b, m, &x, &y);
if (g != 1) return -1;
return (x % m + m) % m;
}
int gcdExtended(int a, int b, int *x, int *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
int x1, y1;
int gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
string decimalToBinary(int n) {
string s = bitset<64>(n).to_string();
const auto loc1 = s.find('1');
if (loc1 != string::npos) return s.substr(loc1);
return "0";
}
int binaryToDecimal(string n) {
string num = n;
int dec_value = 0;
int base = 1;
int len = num.length();
for (int i = len - 1; i >= 0; i--) {
if (num[i] == '1') dec_value += base;
base = base * 2;
}
return dec_value;
}
unsigned long long sumbincoef(int N, int k) {
unsigned long long bincoef = 1, sum = 1;
int i;
for (i = 1; i < k; ++i) {
bincoef = (bincoef * (N - i + 1) / i);
sum += bincoef;
}
return sum;
}
bool is_prime(long long n) {
if (n == 1) {
return false;
}
long long i = 2;
while (i * i <= n) {
if (n % i == 0) {
return false;
}
i += 1;
}
return true;
}
int gcd(int a, int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
int nCrModp(int n, int r, int p) {
if (r > n - r) r = n - r;
int C[r + 1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = min(i, r); j > 0; j--) C[j] = (C[j] + C[j - 1]) % p;
}
return C[r];
}
bool is_palindrome(string s) {
int n = s.size();
for (int i = 0; i < (int)n / 2; i++) {
if (s[i] == s[n - 1 - i]) {
} else {
return false;
}
}
return true;
}
const int N = 200000 + 10;
long long factorialNumInverse[N + 1];
long long naturalNumInverse[N + 1];
long long fact[N + 1];
void InverseofNumber(long long p) {
naturalNumInverse[0] = naturalNumInverse[1] = 1;
for (int i = 2; i <= N; i++)
naturalNumInverse[i] = naturalNumInverse[p % i] * (p - p / i) % p;
}
void InverseofFactorial(long long p) {
factorialNumInverse[0] = factorialNumInverse[1] = 1;
for (int i = 2; i <= N; i++)
factorialNumInverse[i] =
(naturalNumInverse[i] * factorialNumInverse[i - 1]) % p;
}
void factorial(long long p) {
fact[0] = 1;
for (int i = 1; i <= N; i++) {
fact[i] = (fact[i - 1] * i) % p;
}
}
long long Binomial(long long N, long long R, long long p) {
long long ans =
((fact[N] * factorialNumInverse[R]) % p * factorialNumInverse[N - R]) % p;
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
mt19937 rng(
(unsigned int)chrono::steady_clock::now().time_since_epoch().count());
long long p = mod;
InverseofNumber(p);
InverseofFactorial(p);
factorial(p);
int t = 1;
while (t > 0) {
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());
int ans = 0;
for (int i = 0; i < n; i++) {
if (k % a[i] == 0) {
ans = k / a[i];
}
}
cout << ans << endl;
t--;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a, b;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> b;
if (k % b == 0 && b > a) {
a = b;
}
}
cout << k / a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
int sum, c;
int ara[101];
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &ara[i]);
}
sum = 10000;
for (i = 0; i < n; i++) {
if (k % ara[i] == 0) {
c = k / ara[i];
}
if (c < sum) {
sum = c;
}
}
printf("%d\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
int n;
scanf("%d %d", &n, &k);
int i;
int t = 270000000;
for (i = 0; i < n; i++) {
int r;
scanf("%d", &r);
if (k % r == 0)
if (k / r < t) t = k / r;
}
printf("%d", t);
}
|
#include <bits/stdc++.h>
const int INF = -0x3f3f3f3f;
using namespace std;
int main() {
int n;
int k;
int a[105];
cin >> n >> k;
int min_1 = INF;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > min_1 && k % a[i] == 0) {
min_1 = a[i];
}
}
int res = k / min_1;
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[100];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int min = 0;
for (int i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
min = a[i];
break;
}
}
cout << k / min;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
scanf("%d%d", &n, &k);
int a[105];
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
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 n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
for (int i = n - 1; i >= 0; i--) {
if (k % arr[i] == 0) {
cout << k / arr[i] << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
while (cin >> n >> k) {
int r = 100000;
for (int i = 0; i < n; i++) {
int bucket;
cin >> bucket;
if (k % bucket == 0) {
int temp = k / bucket;
if (temp < r) {
r = temp;
}
}
}
cout << r << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, tmp, ans = 9999999;
cin >> n >> k;
while (n--) {
cin >> tmp;
if (k % tmp == 0) {
ans = min(k / tmp, ans);
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1, typename Arg2>
ostream& operator<<(ostream& out, const pair<Arg1, Arg2>& x) {
return out << "(" << x.first << "," << x.second << ")";
}
template <typename Arg1>
ostream& operator<<(ostream& out, const vector<Arg1>& a) {
out << "[";
for (const auto& x : a) out << x << ",";
return out << "]";
}
template <typename Arg1>
ostream& operator<<(ostream& out, const set<Arg1>& a) {
out << "[";
for (const auto& x : a) out << x << ",";
return out << "]";
}
template <typename Arg1, typename Arg2>
ostream& operator<<(ostream& out, const map<Arg1, Arg2>& a) {
out << "[";
for (const auto& x : a) out << x << ",";
return out << "]";
}
template <typename Arg1>
void __trace__(const string name, Arg1&& arg1) {
cerr << name << " : " << arg1 << " ] " << endl;
}
template <typename Arg1, typename... Args>
void __trace__(const string names, Arg1&& arg1, Args&&... args) {
const string name = names.substr(0, names.find(','));
cerr << name << " : " << arg1 << " | ";
__trace__(names.substr(1 + (int)name.size()), args...);
}
clock_t time_p = clock();
void time_taken() {
time_p = clock() - time_p;
cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
const long long mod = 1e9 + 7;
const long long INF = 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout.precision(12);
cout << fixed;
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
int ans = 100;
for (int i = 0; i < n; i++) {
if (k % a[i] == 0) {
ans = min(ans, k / a[i]);
}
}
cout << ans << '\n';
time_taken();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> k >> n;
int ans = n;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
if (n % x == 0) ans = min(ans, n / x);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
int main() {
int n, k, a[111], i, mi = 11111111;
cin >> n >> k;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= n; i++)
if (k % a[i] == 0) {
mi = min(k / a[i], mi);
}
cout << mi << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, len;
cin >> n >> len;
int res = INT_MAX;
while (n--) {
int a;
cin >> a;
if (len % a == 0) res = min(res, len / a);
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int out = k;
for (int i = 0; i < n; i++) {
int ai;
cin >> ai;
if (k % ai == 0 and k / ai < out) {
out = k / ai;
}
}
cout << out << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int min = 1000000;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (k % x == 0 && k / x < min) min = k / x;
}
cout << min << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, a[10010], max = 200;
std::cin >> n >> k;
for (int i = 0; i < n; ++i) {
int x;
std::cin >> x;
if (k % x == 0) {
max = std::min(max, k / x);
}
}
std::cout << max;
}
|
#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;
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
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>
int main(int argc, char const *argv[]) {
int n, k;
std::cin >> n >> k;
int max = 0;
for (int i = 0; i < n; ++i) {
int elem;
std::cin >> elem;
if (k % elem == 0) {
if (elem > max) {
max = elem;
}
}
}
std::cout << k / max << "\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.