Submission #49053194

---

Source Code Expand

#include "atcoder/all"
#include <boost/multiprecision/cpp_int.hpp>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#include <bitset>

using namespace std;
using namespace atcoder;

using lint = long long int;
using mint = atcoder::modint;
using bint = boost::multiprecision::cpp_int;

template<typename T>
inline bool chmin(T &a, const T b) {return a > b && (a = b, true);}
template<typename T>
inline bool chmax(T &a, const T b) {return a < b && (a = b, true);}

template <typename T>
int lb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T>
int ub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }

template<typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) { for(T &e: v) is >> e; return is; }
template<typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) { for(size_t i=0; i<v.size(); i++) { os << v[i] << (i+1 == v.size() ? '\n' : ' '); } return os; }

template<typename T>
std::vector<T> &operator++(std::vector<T> &v) { for(auto&& e: v) {++e;} return v; }
template<typename T>
std::vector<T> &operator--(std::vector<T> &v) { for(auto&& e: v) {--e;} return v; }

int main(void) {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(15);

    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;

    if(N > 100 || *max_element(A.begin(), A.end()) > 100) abort();

    vector<lint> v;

    for(int m=1; m<=100; m++) {
        int ans1 = *max_element(A.begin(), A.end()) % m;
        int ans2 = 0;
        for(int j=0; j<N; j++) {
            chmax(ans2, A[j]%m);
        }
        if(ans1 != ans2) v.emplace_back(m);
    }

    int Q;
    cin >> Q;
    while(Q--) {
        lint M;
        cin >> M;
        cout << M - ub(v, M) << endl;
    }
    return 0;
}

Submission Info

Judge Result