# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155726 | souhhcong | Brunhilda’s Birthday (BOI13_brunhilda) | C++14 | 1107 ms | 212448 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 <iostream>
#include <string.h>
using namespace std;
const int N = 1e5+5, MAXN = 1e7+7, INF = 1e9+9;
int n, q, x, p[N], dp[MAXN], mx = 0;
int solve(int x)
{
//cout << x << endl;
if (dp[x] != -1)
return dp[x];
int mn = INF;
for (int i = 0; i < n; i++)
{
if (x < p[i])
{
dp[x] = 1;
return dp[x];
}
if (x % p[i] == 0) continue;
mn = min(mn,solve(x-(x%p[i]))+1);
}
dp[x] = mn;
return dp[x];
}
int main()
{
memset(dp,-1,sizeof dp);
scanf("%d %d",&n,&q);
for (int i = 0; i < n; i++)
{
scanf("%d",&p[i]);
mx = max(mx,p[i]);
}
for (int i = 1; i < mx; i++)
dp[i] = 1;
while(q--)
{
scanf("%d",&x);
solve(x);
if (dp[x] == INF) printf("oo\n");
else printf("%d\n",dp[x]);
}
}
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... |