text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, a, mx = -1, ans;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> a;
if (k % a == 0) {
mx = max(mx, a);
ans = k / mx;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, i, j, t, max = 0;
scanf("%d%d", &n, &k);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
for (i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
max = a[i];
break;
}
}
printf("%d", k / max);
}
|
#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 = l;
maxim = l;
while (i < n) {
if (l % a[i] == 0) {
b = l / a[i];
}
if (b <= maxim) maxim = b;
i++;
}
printf("%d", maxim);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int m, min = 100000;
while (n--) {
cin >> m;
if (k % m == 0 && (k / m) < min) min = k / m;
}
cout << min;
}
|
#include <bits/stdc++.h>
using namespace std;
int t, n, k;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
t = 1;
while (t--) {
cin >> n >> k;
vector<int> arr(n);
int mini = 10000000, val;
double d;
for (int i = (1); i < (n + 1); i++) {
cin >> val;
d = k / (val * 1.0);
if (d - floor(k / (val * 1.0)) == 0) {
mini = min(k / val, mini);
}
}
cout << mini << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int mx = -1;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
if ((k % tmp) == 0) mx = max(mx, tmp);
}
cout << k / mx << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
void NITRO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const long long N = 1e+17;
const int MOD = 998244353;
const long long INF = 1e+18;
void SOLVE() {
int n, k, ans = 111;
cin >> n >> k;
while (n--) {
int num;
cin >> num;
if (k % num == 0) ans = min(k / num, ans);
}
cout << ans;
}
int main() {
int t = 1;
while (t--) {
SOLVE();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int Array[n + 5];
for (int i = 0; i < n; i++) cin >> Array[i];
sort(Array, Array + n);
int ans = 1;
for (int i = n - 1; i >= 0; i--) {
if (k % Array[i] == 0) {
ans = Array[i];
break;
}
}
ans = k / ans;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, j, n, m, mas[105], ab[105], rez;
int main() {
cin >> n >> m;
i = 0;
while (i < n) {
cin >> mas[i];
if (m % mas[i] == 0) {
ab[i] = m / mas[i];
}
i = i + 1;
}
i = 0;
rez = 1000000000;
while (i < n) {
if (ab[i] > 0) {
rez = min(rez, ab[i]);
}
i = i + 1;
}
cout << rez;
return (0);
}
|
#include <bits/stdc++.h>
int main() {
int result = 0, min = 1e9;
int buckets = 0, length = 0;
scanf(" %d %d", &buckets, &length);
if (buckets < 1 || length > 100) {
return EXIT_FAILURE;
}
int a[buckets], maxdiv[buckets];
for (int i = 0; i < buckets; ++i) {
scanf("%d", &a[i]);
}
for (int i = 0; i < buckets; ++i) {
if (length % a[i] == 0) {
maxdiv[i] = length / a[i];
} else {
maxdiv[i] = 700;
}
}
for (int i = 0; i < buckets; ++i) {
min = min < maxdiv[i] ? min : maxdiv[i];
}
printf("%d\n", min);
return EXIT_SUCCESS;
}
|
#include <bits/stdc++.h>
long long cmpfunc(const void* a, const void* b) {
return (*(long long*)a - *(long long*)b);
}
int main(void) {
long long int test, i, j, n, count,
flag = 0, o1 = 0, o2 = 0, b1, x, m, l, max, sum2, min, f, k, r, o, sum1,
sum = 0, y, count1 = 0, a[3000] = {0}, b[3000] = {0}, c[26] = {0};
scanf("%lld%lld", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%lld", &x);
a[x]++;
}
for (i = k; i >= 1; i--) {
if (a[i] != 0 && k % i == 0) {
printf("%lld", k / i);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a, mx = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a;
if (k % a == 0) {
mx = max(mx, a);
}
}
cout << k / mx;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[105];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
ans = k / a[i];
break;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long int gcd(long long int a, long long int b) {
return b ? gcd(b, a % b) : a;
}
int main() {
int n, k;
cin >> n >> k;
int ans = 1e9;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (k % a == 0) {
ans = min(ans, k / a);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int main() {
int a[100], b[100], n, l, i, k = 0, max = 0;
scanf("%d%d", &n, &l);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (l % a[i] == 0) {
b[k] = a[i];
k++;
}
}
max = b[0];
for (i = 0; i < k; i++) {
if (b[i] > max) {
max = b[i];
}
}
printf("%d", (l / max));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, ans = 1000;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (m % x == 0) ans = min(ans, m / x);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, ans;
inline int GetInt() {
int num = 0, k = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') k = -1;
ch = getchar();
}
while (isdigit(ch)) {
num = num * 10 + ch - '0';
ch = getchar();
}
return num * k;
}
int main() {
n = GetInt(), k = GetInt();
ans = k;
for (int i = 1; i <= n; i++) {
int x = GetInt();
if (k % x) continue;
ans = min(ans, k / x);
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int s, h = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (k % s == 0 && s > h) h = s;
}
cout << k / h << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, t = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
if (ch == '-') t = -1, ch = getchar();
while (ch <= '9' && ch >= '0') x = x * 10 + ch - 48, ch = getchar();
return x * t;
}
int n, K;
int a[200];
int main() {
n = read();
K = read();
int ans = 1e9;
for (int i = 1; i <= n; ++i) {
int x = read();
if (K % x == 0) ans = min(ans, K / x);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int g[1000], n, k, ans = 1e9;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> g[i];
if (k % g[i] == 0) ans = min(ans, k / g[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, k, ans = 0;
cin >> n >> k;
long long int a[n];
for (long long int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (long long int i = 0; i < n; i++) {
if (k % a[i] == 0) ans = a[i];
}
ans = k / ans;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, r, temp;
int j;
j = 0;
cin >> n >> r;
int ara[n], m;
int ara2[100];
for (i = 0; i < n; i++) {
cin >> ara[i];
}
for (i = 0; i < n; i++) {
if (r % ara[i] == 0) {
ara2[j] = r / ara[i];
j++;
}
}
temp = ara2[0];
for (i = 0; i < j; i++) {
if (temp > ara2[i]) {
temp = ara2[i];
}
}
cout << temp << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int min = k + 1;
for (int i = 0; i < n; ++i) {
int bucket;
cin >> bucket;
if (k % bucket == 0) {
int times = k / bucket;
if (min > times) {
min = times;
}
}
}
cout << min << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 0; i < n; i++) cin >> a[i];
int min1 = 1000;
for (int i = 0; i < n; i++) {
if (k % a[i] == 0) {
min1 = min(min1, k / a[i]);
}
}
cout << min1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> k >> n;
vector<int> a(k);
for (int i = 0; i < k; ++i) cin >> a[i];
sort(a.begin(), a.end());
for (int i = k - 1; i >= 0; --i) {
if (n % a[i] == 0) {
cout << n / a[i];
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 31) - 1;
const long long LINF = (1ll << 63) - 1;
const double DINF = numeric_limits<double>::infinity();
const int MOD = 1e9 + 7;
const double EPS = 1e-7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw(MOD);
long long rnd(long long x, long long y) {
static uniform_int_distribution<long long> d;
return d(mmtw) % (y - x + 1) + x;
}
template <class T>
T binpow(T n, T k) {
if (k == 1) return n;
if (k & 1) return binpow(n, k - 1) * n;
T a = binpow(n, k / 2);
return a * a;
}
template <class T>
T fact(T n) {
if (n == 1) return 1;
return n * fact(n - 1);
}
int n, k;
int a[105];
int main() {
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]) << endl;
return 0;
}
}
return 123;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int q[N];
int n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> q[i];
sort(q + 1, q + n + 1);
for (int i = n; i >= 1; i--)
if (k % q[i] == 0) {
cout << k / q[i] << "\n";
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[100 + 5], ans = 100000000;
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
if (k == a[n - 1]) {
cout << 1 << endl;
return 0;
}
for (int i = 0; i < n; ++i) {
if (k % a[i] == 0) {
ans = min(ans, k / a[i]);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
static void init() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
}
int main(int argc, char** argv) {
init();
int n, len;
std::cin >> n >> len;
std::vector<int> vec(n);
for (size_t i = 0; i < n; i++) std::cin >> vec[i];
std::sort(vec.begin(), vec.end());
std::vector<int>::reverse_iterator it = vec.rbegin();
while (it != vec.rend()) {
if (len % *it == 0) {
std::cout << len / *it << std::endl;
return 0;
}
it++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, l = 0;
vector<long long> a;
cin >> n >> k;
a.resize(n);
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
for (long long i = n; i > -1; i--) {
if (k % a[i] == 0) {
cout << k / a[i];
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, ans = 9999999, d, n, k, t, i;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> t;
if (k % t == 0) {
ans = min(k / t, ans);
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int maxDiv = 1;
int n, k;
scanf("%d%d", &n, &k);
int nr;
for (int i = 0; i < n; ++i) {
scanf("%d", &nr);
if (k % nr == 0 && ((maxDiv == -1) || (nr > maxDiv))) {
maxDiv = nr;
}
}
printf("%d\n", k / maxDiv);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arra[n];
for (int i = 0; i < n; i++) {
cin >> arra[i];
}
sort(arra, arra + n);
for (int i = n - 1; i >= 0; i--) {
if (k % arra[i] == 0) {
cout << k / arra[i];
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const long long int linf = 99999999999999999ll;
const int maxn = 1e5 + 10;
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
return (a * b) / gcd(a, b);
}
int a[maxn];
int main() {
ios_base::sync_with_stdio(false);
int n, k, mx = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
if (k % a[i] == 0) {
mx = max(mx, a[i]);
}
}
cout << k / mx << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, hrs = 0, i, j, t;
scanf("%d%d", &n, &k);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
for (i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
hrs = (k / a[i]);
break;
}
}
if (hrs == 0) hrs = k;
printf("%d", hrs);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int a[105];
scanf("%d%d", &n, &k);
int ans = 100;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (k % a[i] == 0) ans = min(ans, k / a[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> vec;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
vec.push_back(temp);
}
sort(vec.rbegin(), vec.rend());
for (int i = 0; i < n; i++) {
if (k % vec[i] == 0) {
k = k / vec[i];
break;
}
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a, ans = 10000;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a;
if (k >= a && k % a == 0) ans = min(ans, k / a);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:10000000")
using namespace std;
const double PI = acos(-1.0);
const int INF = 1e9;
const int MOD = INF + 7;
const long long BIGINF = 1e16;
int n, k, elem, mini = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> elem;
if (k % elem == 0) mini = min(k / elem, mini);
}
cout << mini << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
long long a, b, x, y, z, n, m, k;
int arr[N];
double m2;
int main() {
cin >> n >> k;
arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (k % arr[i] == 0) x = arr[i];
}
cout << k / x;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200;
int n, a[N], k, ans = 100;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (k % a[i] == 0) ans = min(ans, k / a[i]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a;
cin >> n >> k;
vector<int> V;
for (int i = 0; i < n; i++) {
cin >> a;
V.push_back(a);
}
sort(V.begin(), V.end());
reverse(V.begin(), V.end());
for (int i = 0; i < n; i++) {
if (k % V[i] == 0) {
cout << k / V[i];
return 0;
}
}
cout << V[0];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long n, i, j, k;
cin >> n >> k;
long a[n];
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];
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)(1e9);
const long double eps = 1e-6;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
signed main() {
long long n, k;
cin >> n >> k;
long long mx = -1;
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
if ((k % x == 0) && (x > mx)) mx = x;
}
cout << k / mx << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, ara[100], i, a, min = 100;
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &ara[i]);
}
for (i = 0; i < n; i++) {
if (k % ara[i] == 0) a = k / ara[i];
if (min > a) min = a;
}
printf("%d", min);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[101];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int c = 1;
for (int i = 0; i <= n - 1; ++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] << "\n";
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1001];
inline int cmp(int u, int v) { return u > v; }
int main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
if (m % a[i] == 0) {
cout << m / a[i] << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int ans = INT_MAX;
for (int i = 0; i < n; ++i) {
int in;
cin >> in;
if (k % in == 0) ans = min(ans, k / in);
}
cout << ans << "\n";
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int s = 0, sh = 0, d, f = 0, p = 0, b = 0, m, a, t, c = 2, n,
ans = 9999, r, o;
bool e;
int x[1001], i[110];
int main() {
cin >> n >> m;
for (int q = 0; q < n; q++) {
cin >> x[q];
}
for (int r = 0; r < n; r++) {
if (m % x[r] == 0) {
a = (m / x[r]);
ans = min(ans, a);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, K;
int x;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N >> K;
int ans = (int)1e9;
for (int i = 0; i < N; i++) {
cin >> x;
if (K % x == 0) {
ans = min(ans, K / x);
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int a[1001];
int mx = -1;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if ((a[i] <= k) && (k % a[i] == 0)) {
mx = max(a[i], mx);
}
}
cout << k / mx << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[10000];
int main() {
int n, k, ma = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (k % x == 0)
if (x > ma) ma = x;
}
cout << k / ma;
}
|
#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] << "\n";
break;
}
}
}
|
#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);
for (int i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
cout << k / a[i] << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int mini = INT_MAX;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (k % a == 0 && k / a < mini) mini = k / a;
}
cout << mini;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, x, ans = INT_MAX;
int main() {
scanf("%d%d", &n, &k);
while (n--) {
scanf("%d", &x);
if (k % x == 0) ans = min(ans, k / x);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int s = 1000;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (!(k % a)) s = min(k / a, s);
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, a;
cin >> x >> y;
a = y;
for (int i = 0; i < x; i++) {
cin >> z;
if (y % z == 0 && a > (y / z)) {
a = y / z;
}
}
cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int main() {
int n, m;
cin >> m >> n;
int min = INT_MAX;
for (int i = 0; i < m; i++) {
int q;
cin >> q;
if (n % q == 0) {
if (n / q < min) {
min = n / q;
}
}
}
cout << min;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, m, r = 0, c = 0, i;
cin >> n >> m;
long p[n];
for (i = 0; i < n; ++i) cin >> p[i];
sort(p, p + n);
for (i = n - 1; i > -1; --i) {
if (m % p[i] == 0) break;
}
cout << m / p[i];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, m;
cin >> n >> k;
m = k;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (k % a == 0) {
if (k / a < m) m = k / a;
}
}
cout << m;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
int size(const T &x) {
return x.size();
}
template <class T>
T mod(T a, T b) {
return (b + (a % b)) % b;
}
const int INF = ~(1 << 31);
const double EPS = 1e-9;
const double PI = acos(-1);
int main() {
int k, n, a;
cin >> n >> k;
int mn = INF;
for (__typeof(0) i = 0; i < (n); i++) {
cin >> a;
if ((k % a) != 0) continue;
mn = min(mn, k / a);
}
cout << mn << '\n';
return 0;
}
|
#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);
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 main() {
int n, k;
cin >> n >> k;
int a[n], b[n], m = 0;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
if (k % a[i] == 0) b[m++] = k / a[i];
}
int temp = b[0];
for (int i = 1; i < m; i++) {
if (b[i] < temp) temp = b[i];
}
cout << temp;
return 0;
}
|
#include <bits/stdc++.h>
const int nmax = 100;
using namespace std;
void swap(int *a, int k1, int k2) {
if (k1 < nmax && k2 < nmax) {
int m = a[k1];
a[k1] = a[k2];
a[k2] = m;
}
}
void sortb(int *a, char s, int n) {
int m1 = 0, m2 = m1;
if (s == '<') {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - 1 - i; j++) {
if (a[j + 1] < a[j]) {
swap(a, j, j + 1);
m1++;
}
}
if (m2 == m1) break;
m2 = m1;
}
}
if (s == '>') {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - 1 - i; j++) {
if (a[j + 1] > a[j]) {
swap(a, j, j + 1);
m1++;
}
}
if (m2 == m1) break;
m2 = m1;
}
}
}
int main() {
int n, k;
int a[nmax];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sortb(a, '<', n);
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;
struct Dsu {
vector<int> parent, rnk;
Dsu(int n) {
parent.resize(n);
rnk.resize(n);
for (int i = 0; i < n; i++) {
parent[i] = i;
rnk[i] = 0;
}
}
int findparent(int i) {
if (parent[i] != i) parent[i] = findparent(parent[i]);
return parent[i];
}
bool con(int x, int y) {
if (findparent(x) == findparent(y)) return 1;
return 0;
}
void uni(int x, int y) {
int xroot = findparent(x);
int yroot = findparent(y);
if (rnk[yroot] < rnk[xroot])
parent[yroot] = parent[xroot];
else if (rnk[yroot] > rnk[xroot])
parent[xroot] = parent[yroot];
else {
rnk[xroot]++;
parent[yroot] = parent[xroot];
}
}
};
int main() {
int n, k;
scanf("%d%d", &n, &k);
int res = 1e9;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
if (k % x == 0) {
res = min(res, k / x);
}
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
long long int n, k;
cin >> n >> k;
long long int m = 101;
for (long long int i = 0; i <= n - 1; i++) {
long long int x;
cin >> x;
if (k % x == 0) m = min(m, k / x);
}
cout << m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[101], h;
int main() {
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) {
h = k / a[i];
break;
}
}
cout << h;
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, m;
cin >> n >> m;
int ans = 0;
while (n--) {
int j;
cin >> j;
if (m % j == 0 && j > ans) ans = j;
}
cout << m / ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long Mod = 1000000007;
int arr[105];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
sort(arr, arr + n);
for (int i = n - 1; i >= 0; i--) {
if (k % arr[i] == 0) {
printf("%d\n", k / arr[i]);
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
long long ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
a = abs(a);
b = abs(b);
return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
T t = 1;
return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
T t = 1;
return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
T t = 1;
return (a & (~(t << i)));
}
inline long long getnum() {
char c = getchar();
long long num, sign = 1;
for (; c < '0' || c > '9'; c = getchar())
if (c == '-') sign = -1;
for (num = 0; c >= '0' && c <= '9';) {
c -= '0';
num = num * 10 + c;
c = getchar();
}
return num * sign;
}
inline long long power(long long a, long long b) {
long long multiply = 1;
for (int i = (0); i < (b); i++) {
multiply *= a;
}
return multiply;
}
int n, k, a[105];
int main() {
int test, cases = 1;
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] << "\n";
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
int cont = b;
for (int d = 0; d < a; d++) {
cin >> c;
if (b % c == 0 && b / c < cont) {
cont = b / c;
}
}
cout << cont;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
scanf("%d", &k);
int maxn = 0;
for (int i = 1; i <= k; i++) {
int x;
scanf("%d", &x);
if (x >= 500001) {
maxn = max(maxn, 1000000 - x);
}
if (x <= 500000) {
maxn = max(maxn, x - 1);
}
}
printf("%d\n", maxn);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
long long power(long long a, long long b) {
long long ans = 1;
while (b > 0) {
if (b & 1) ans *= a;
a = a * a;
b >>= 1;
}
return ans;
}
long long powm(long long a, long long b) {
a %= MOD;
long long ans = 1;
while (b > 0) {
if (b & 1) ans = (ans * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return ans;
}
void IO() {}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
IO();
;
int n;
cin >> n;
int A[n];
for (int &x : A) cin >> x;
if (n == 1) {
cout << min(A[0] - 1, 1000000 - A[0]);
return 0;
}
int ans = min(A[n - 1] - 1, 1000000 - A[0]);
for (int i = n - 2; i >= 0; i--)
ans = min(ans, (A[i] - 1 + (1000000 - A[i + 1])) -
min(A[i] - 1, 1000000 - A[i + 1]));
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum = max(sum, min(abs(1 - a[i]), abs(1000000 - a[i])));
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, jog, k, l = 500000, m, n, a[1000009];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] <= l) jog = a[i] - 1;
}
for (int i = 1; i <= n; i++) {
if (a[i] > l) jog = max(jog, 1000000 - a[i]);
}
cout << jog;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
const int mod = (int)1e9 + 7;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
int m = (int)1e6;
int ans = m + 20;
sort(a, a + n);
for (i = 0; i < n; i++) {
if (!i) ans = min(ans, m - a[i]);
if (i == n - 1)
ans = min(ans, a[i] - 1);
else
ans = min(ans, max(a[i] - 1, m - a[i + 1]));
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
const int N = 110;
int main() {
int n;
while (~scanf("%d", &n)) {
int ans = 0, x;
while (n--) {
scanf("%d", &x);
if (x <= 500000 && x - 1 > ans)
ans = x - 1;
else if (x > 500000 && 1000000 - x > ans)
ans = 1000000 - x;
}
printf("%d\n", ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long x[1000100];
long long n;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
x[a]++;
}
long long st1 = 1;
long long st2 = 1000000;
long long tot = 0;
long long sol = 0;
while (st2 >= st1) {
st2--;
st1++;
sol++;
tot += x[st1];
tot += x[st2];
if (tot >= n) break;
}
cout << sol << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int a[N];
int main() {
int n, x, res = 1000000007;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
a[x] = 1;
}
a[0] = a[1] = 1;
for (int i = 1; i <= (1e6); i++) {
if (a[i] == 0)
a[i] = a[i - 1];
else
a[i] = i;
}
int nxt = 1000000;
for (int i = 1000000; i >= 1; i--) {
res = min(res, max(1000000 - i, a[i - 1] - 1));
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long int n;
cin >> n;
long long int f[n], b[n];
long long int ans = -1;
for (long long int i = 0; i < n; i++) {
long long int x;
cin >> x;
f[i] = x - 1;
b[i] = 1000000 - x;
ans = max(ans, min(f[i], b[i]));
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(2000000);
for (long long i = 0; i < 2000000; i++) v[i] = 0;
for (long long i = 0; i < n; i++) {
long long t1;
cin >> t1;
v[t1]++;
}
long long t = 0;
long long l = 1;
long long r = 1000000;
while (n > 0) {
t++;
l++;
r--;
if (v[l]) n--;
if (v[r]) n--;
}
cout << t;
}
|
#include <bits/stdc++.h>
int main() {
unsigned ya = 1, drug = 1000000, time_ya = 0, time_d = 0, n;
std::cin >> n;
for (auto i = 0; i < n; ++i) {
unsigned temp;
std::cin >> temp;
if (temp - ya < drug - temp) {
time_ya = std::max(time_ya, temp - ya);
} else {
time_d = std::max(time_d, drug - temp);
}
}
std::cout << std::max(time_ya, time_d) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int main() {
int n, x[N], m = 0, s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
for (int i = 0; i < n; i++) {
m = min(x[i] - 1, 1000000 - x[i]);
s = max(s, m);
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, arr[100001], a, b, t;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &arr[i]);
}
int pos1 = 1, pos2 = 1e6;
int i = 0;
while (i < n && arr[i] - pos1 <= pos2 - arr[i]) {
a = i;
i++;
}
if (i == n) {
printf("%d\n", arr[i - 1] - 1);
return 0;
}
i--;
printf("%d\n", max(arr[i] - 1, (max(0, pos2 - arr[i + 1]))));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, b = 0, tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp <= 1000000 / 2)
a = tmp - 1;
else {
b = 1000000 - tmp;
break;
}
}
cout << max(a, b);
return 0;
}
|
#include <bits/stdc++.h>
bool prizes[1000001];
int main() {
int count;
scanf("%d", &count);
for (int i = 0; i < count; i++) {
int prize;
scanf("%d", &prize);
prizes[prize] = true;
}
int lastPrize1 = 1;
for (int i = 2; i <= 500000; i++) {
if (prizes[i]) {
lastPrize1 = i;
}
}
int lastPrize2 = 1000000;
for (int i = 999999; i >= 500001; i--) {
if (prizes[i]) {
lastPrize2 = i;
}
}
int maxTime = std::max(lastPrize1 - 1, 1000000 - lastPrize2);
printf("%d", maxTime);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, p, k;
int main() {
cin >> n;
while (n--) {
cin >> p;
k = max(k, min(p - 1, 1000000 - p));
}
cout << k;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[n];
for (long long i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
long long pos = -1;
long long mx = 1000000;
for (long long i = 0; i < n; i++) {
if (arr[i] - 1 > mx - arr[i]) {
if (i > 0)
cout << max(arr[i - 1] - 1, mx - arr[i]) << endl;
else
cout << mx - arr[i] << endl;
return 0;
}
}
cout << arr[n - 1] - 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ar[1000007];
int main() {
long long n, i, j, k;
cin >> n;
for (i = 0; i < n; i++) {
long long x;
cin >> x;
ar[x] = 1;
}
long long s1 = 1, e1 = 1000000, cnt = 0, ans = 0;
while (1) {
ans++;
s1++;
if (ar[s1] == 1) cnt++;
if (cnt == n || s1 == e1 - 1) break;
e1--;
if (ar[e1] == 1) cnt++;
if (cnt == n || s1 == e1 - 1) break;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, i, t = 0, b, j;
scanf("%d", &n);
int a[n], x, y;
x = 1;
y = 1000000;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
b = n;
i = 0;
j = n - 1;
while (b >= 1) {
if (x == a[i]) {
a[i] = 0;
i++;
b--;
}
if (y == a[j]) {
a[j] = 0;
j--;
b--;
}
x = x + 1;
y = y - 1;
t++;
}
printf("%d", t - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int N = 1e4 + 7;
const long long int inf = 1e17;
long long int en = 1000000;
int main() {
long long int i, j, k, n, l;
cin >> n;
long long int a[n + 1];
for (i = 0; i < n; i++) scanf("%lld", &a[i]);
vector<long long int> vec;
for (i = 0; i < n; i++) {
long long int x = a[i] - 1;
long long int y = en - a[i];
if (x > y)
vec.push_back(y);
else
vec.push_back(x);
}
sort(vec.begin(), vec.end(), greater<long long int>());
cout << (*vec.begin());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, maxi, x;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > 500000) {
x = 1000000 - x;
} else
x--;
if (x > maxi) maxi = x;
}
cout << maxi;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1e5;
int num[MaxN + 5];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> num[i];
int ans, f1 = 0, f2 = 1000005;
for (int i = 1; i <= n; i++) {
if (num[i] <= 500000)
f1 = max(num[i], f1);
else
f2 = min(num[i], f2);
}
f1--;
f2 = 1000000 - f2;
ans = max(f1, f2);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mn = 1000005, k;
int main() {
int a, p;
scanf("%i", &a);
for (int i = 0; i < a; i++) {
scanf("%i", &p);
if (abs(p - 500000) < mn || (abs(p - 500000) <= mn && p > 500000)) {
mn = abs(p - 500000);
k = p;
}
}
printf("%i", min(abs(k - 1), abs(k - 1000000)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x;
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x >= 500001) {
ans2 = max(ans2, 1000000 - x);
} else {
ans1 = max(ans1, x - 1);
}
}
std::cout << max(ans1, ans2) << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
long long res = 1e18;
for (int i = 0; i < n - 1; ++i)
res = min(res, 1ll * max(a[i] - 1, 1000000 - a[i + 1]));
res = min(res, 1ll * a[n - 1] - 1);
res = min(res, 1ll * 1000000 - a[0]);
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005, M = 1000000007, BIG = 0x3f3f3f3f;
int ct = 0;
int n;
int a[N];
bool Read() {
cin >> n;
if (cin.eof()) return 0;
for (int i = 0; i < n; i++) cin >> a[i];
return 1;
}
void Process() {
int ans = 0;
for (int i = 0; i < n; i++)
ans = max(ans, min(abs(a[i] - 1), abs(a[i] - 1000000)));
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
while (Read()) Process();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int res = min(a[n - 1] - 1, maxn - a[0]);
for (int i = 0; i < n - 1; i++) {
int x = a[i] - 1;
int y = maxn - a[i + 1];
res = min(res, max(x, y));
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[1000006];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int ami = 1;
int frnd = 1000000;
int sec = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int lpos = 0;
int upos = n - 1;
while (lpos <= upos) {
int x = arr[lpos] - ami;
int y = frnd - arr[upos];
if (lpos == upos) {
sec += min(x, y);
break;
}
if (y > x)
lpos++;
else
upos--;
}
cout << sec << "\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.