#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w)
{
int n=w.size();
vector<int> rez;
int p=l/w[0];
if (p*w[0]==l&&p<=n)
for (int i=0;i<p;i++)
rez.push_back(i);
else if ((p+1)*w[0]>=l&&(p+1)*w[0]<=u&&p+1<=n)
for (int i=0;i<=p;i++)
rez.push_back(i);
return rez;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
212 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
212 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
296 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
300 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
296 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
212 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
212 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
212 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
212 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
296 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
300 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
296 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
212 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
212 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
0 ms |
212 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
212 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
212 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
296 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
300 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
296 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
212 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
212 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
0 ms |
212 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
212 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
212 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
296 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
300 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
296 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
212 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
212 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
0 ms |
212 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
212 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
212 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
212 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
296 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
300 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
296 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
212 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
212 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
212 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
212 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
0 ms |
212 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |