#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef int64_t i64; typedef double db; typedef vector> mat; typedef pair pii; typedef pair pli; typedef pair pdi; #define esc(x) cout << (x) << endl,exit(0) #define inf(T) (numeric_limits::max() / 2 - 1) #define each(i,v) for(auto i = begin(v),end_copy = end(v); i != end_copy; ++i) #define reach(i,v) for(auto i = rbegin(v),rend_copy = rend(v); i != rend_copy; ++i) #define urep(i,s,t) for(int64_t i = (s),t_copy = (t); i <= t_copy; ++i) #define drep(i,s,t) for(int64_t i = (s),t_copy = (t); i >= t_copy; --i) #define rep(i,n) urep(i,0,(n) - 1) #define rep1(i,n) urep(i,1,(n)) #define rrep(i,n) drep(i,(n) - 1,0) #define all(v) begin(v),end(v) #define rall(v) rbegin(v),rend(v) #define vct vector #define prque priority_queue #define u_map unordered_map #define u_set unordered_set #define l_bnd lower_bound #define u_bnd upper_bound #define rsz resize #define ers erase #define emp emplace #define emf emplace_front #define emb emplace_back #define pof pop_front #define pob pop_back #define mkp make_pair #define mkt make_tuple #define fir first #define sec second void setup(uint8_t prec = 10) { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(prec); #ifdef Local #define debug 1 #define print(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl cout << "-- Execution At Local ---\n" << "\n\n\n"; auto print_atexit = []() { time_t end_time = time(NULL); struct tm *ret = localtime(&end_time); cout << "\n----------------\n"; cout << "\nSuccessfully Executed At " << (ret -> tm_hour) << ":" << (ret -> tm_min) << ":" << (ret -> tm_sec) << "\n\n"; }; atexit(print_atexit); #endif } template ostream& operator << (ostream& s, pair p) { return s << p.fir << " " << p.sec; } template ostream& operator << (ostream& s, vector& v) { for(auto i = v.begin(); i != v.end(); i++) { if(i != begin(v)) s << " "; s << *i; } return s; } template void hash_combine(size_t &seed, T const &key) { hash hasher; seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2); } namespace std { template struct hash> { size_t operator()(pair const &p) const { size_t seed(0); hash_combine(seed,p.first); hash_combine(seed,p.second); return seed; } }; template struct hash> { size_t operator()(tuple const &t) const { size_t seed(0); hash_combine(seed,get<0>(t)); hash_combine(seed,get<1>(t)); hash_combine(seed,get<2>(t)); return seed; } }; } auto lam_min = [](auto x, auto y) { return min(x,y); }; auto lam_max = [](auto x, auto y) { return max(x,y); }; bool odd(i64 x) { return x & 1; } bool even(i64 x) { return !odd(x); } bool parity(i64 x, i64 y) { return odd(x) ^ even(y); } bool bit(i64 n, uint8_t e) { return n >> e & 1; } int ilog(i64 x, uint64_t b) { if(x) return ilog(x / b,b) + 1; return -1; } i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; } i64 gcd(i64 a, i64 b) { if(!b) return abs(a); if(a % b) return gcd(b, a % b); return abs(b); } i64 lcm(i64 a, i64 b) { if(a & b) return abs(a / gcd(a, b) * b); return 0; } template void chval(T& m, U x) { m = x; } template bool chmax(T& m, U x) { if(m < x) { m = x; return 1; } return 0; } template bool chmin(T& m, U x) { if(m > x) { m = x; return 1; } return 0; } i64 bins(i64 ok, i64 ng, auto judge) { while(abs(ok - ng) > 1) { i64 mid = ok + ng >> 1; (judge(mid) ? ok : ng) = mid; } return ok; } template T cmprs(T& v) { T tmp = v,ret = v; sort(all(tmp)); tmp.erase(unique(all(tmp)),end(tmp)); each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1; return ret; } const int dir[8][2] = { {1,0},{0,1},{-1,0},{0,-1},{1,1},{-1,1},{-1,-1},{1,-1} }; const i64 mod = 1e9 + 7; const db gold = sqrt(1.25) + 0.5; const db eps = 1e-15; int main() { setup(); int c,n; cin>>c>>n; vct a(n); rep(i,n) cin>>a[i]; sort(all(a)); a.erase(unique(all(a)),end(a)); n=a.size(); unordered_map dp; dp[0]=0; rep(i,n) { int lim; if(ifir; int llim=min((c-j)/a[i]+1,lim); rep(k,llim) { if(dp.count(k*a[i]+j)) { chmin(dp[k*a[i]+j],k+dp[j]); } else { dp[k*a[i]+j]=dp[j]+k; } } } } if(dp.count(c)) esc(dp[c]); esc(-1); }