# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25866 | gs14004 | Brunhilda’s Birthday (BOI13_brunhilda) | C++11 | 1000 ms | 41080 KiB |
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;
typedef long long lint;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;
int n, q;
int nxt[10000005];
int main(){
scanf("%d %d",&n,&q);
for(int i=1; i<=n; i++){
int x;
scanf("%d",&x);
for(int j=x; j-1<=10000000; j+=x){
nxt[j-1] = x-1;
}
}
for(int i=10000000; i; i--) nxt[i] = max(nxt[i], nxt[i+1] - 1);
while(q--){
int x;
scanf("%d",&x);
int cnt = 0;
while(x > 0){
if(nxt[x] == 0){
puts("oo");
cnt = -1;
break;
}
x -= nxt[x];
cnt++;
}
if(cnt >= 0) printf("%d\n", cnt);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |