This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4+10, inf = 0x3f3f3f3f;
int n, q, prime[maxn], dp[maxn];
int solve(int pos){
if(pos <= 0) return 0;
if(dp[pos]!=-1) return dp[pos];
int tot = inf;
for(int i=1; i<=n; i++){
int aux = pos % prime[i];
if(aux) tot = min(tot, 1 + solve(pos - aux));
}
return dp[pos] = tot;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin >> n >> q;
for(int i=1; i<=n; i++) cin >> prime[i];
memset(dp, -1, sizeof dp);
while(q--){
int nj;
cin >> nj;
if(solve(nj) != inf) cout << solve(nj) << "\n";
else cout << "oo\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |