competetive-programming/Chef_And_Linear_Chess.cpp at master · anandshivam44/competetive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
    return b ? gcd(b, a % b) : a;
}
const ll mod = 1000000007;
const ll inf = 1e18;
#define all(x) begin(x), end(x)
#define loop(i, n) for (int i = 0; i < n; i++)
#define print_array(arr)                                         \
    loop(z, sizeof(arr) / sizeof(arr[0])) cout << arr[z] << " "; \
    cout << "\n"
#define print_vector(vvv)                      \
    loop(z, vvv.size()) cout << vvv[z] << " "; \
    cout << "\n"
#define print_vector_pair(vvv)                                             \
    loop(z, vvv.size()) cout << vvv[z].first << " " vvv[z].second << "\n"; \
    cout << "\n"
#define fill_my(arr, q) fill(all(arr), q)

void solve()
{
    ll n, k;
    cin >> n >> k;
    // ll arr[n];
    // double q[n];
    vector <pair <ll, double>> v;
    // vector <int> v;
    // cout<<k<<" k "<<endl;
    ll temp1;double temp2;


    for (int i = 0; i < n; i++)
    {
        cin>>temp1;
        temp2=(double)k/(temp1);
        v.emplace_back(temp1,temp2);
        // if (v[i].second==floor(v[i].second) && v[i].second!=0)
        // {
        //     v.push_back(q[i]);
        // }

    }

    ll MIN=1000000000;
    ll index=-1;
    for (int i = 0; i < n; i++)
    {
        if (v[i].second==floor(v[i].second) && v[i].second!=0)
        {
            if (v[i].second<MIN)
            {
                index=i;
                MIN=(ll)v[i].second;
            }
        }
    }
    if (index==-1)
    {
        cout<<-1<<"\n";
    }
    else{
        cout<<v[index].first<<"\n";
    }


    // print_array(arr);
    // print_vector(v);
    // int m=q[0];
    // if (v.size()==0)
    // {
    //     cout<<-1<<"\n";
    // }
    // else {

    //     for (int i = 0; i < v.size(); i++)
    //     {
    //         m=min(m, (int)q[i]);
    //     }
    //     cout<<m<<"\n";
    // }
    // cout<<"hi"<<endl;
}

int main()
{
    clock_t time_req;
    time_req = clock();
    cin.sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }

    // time_req = clock() - time_req;
    // cout << "\nProcessor time " << (float)time_req / CLOCKS_PER_SEC<< " sec" << endl;
    return 0;
}