#include <iostream>
#include "molecules.h"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w){
bool ja=false;
int pos;
for(int i=l;i<=u;i++){
if(i%w[0]==0){
ja=true;
pos=i/w[0];
}
}
std::vector<int> res;
if(ja){
for(int i=0;i<pos;i++){
res.push_back(i);
}
}
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
5 ms |
256 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
5 ms |
256 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
5 ms |
256 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
5 ms |
256 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
5 ms |
256 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |