Submission #5874932

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#include <assert.h>
#include <unordered_set>
#include <random>



using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(ll i = 0; i < n; i++)





















 
int main(){
    ll n, t, e;
    cin >> n >> t >> e;
    vector<ll> flag(t * 2 + 1);
    REP(i, n){
        ll x;
        cin >> x;
        for(ll j = x; j <= t * 2; j += x){
            flag[j] = i + 1;
        }
    }
    for(ll i = max(t - e, 0LL); i <= min(t + e, 2 * t); i++){
        if(flag[i]){
            cout << flag[i] << endl;
            return 0;
        }
    }
    cout << -1 << endl;
}

Submission Info

Judge Result