QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #85972 | #5361. 土豆评测机 | xiaoyaowudi | 0 | 1ms | 1744kb | C++14 | 2.2kb | 2023-03-08 22:24:13 | 2023-03-08 22:26:24 |
Judging History
answer
#include <cstdio>
int main()
{
puts("assign i n");
puts("label rp");
puts("calc i i - 1");
puts("read");
puts("assign k x");
puts("calc k k + 2654435769");
puts("calc t k >> 16");
puts("calc k k ^ t");
puts("calc k k * 2246822507");
puts("calc t x >> 13");
puts("calc k k ^ t");
puts("calc k k * 3266489909");
puts("calc t k >> 16");
puts("calc k k ^ t");
puts("assign q k");
puts("calc k k / 601");
puts("calc t k == 0");
puts("cjump nm");
puts("calc k k - 1");
puts("label nm");
puts("calc k k * 601");
puts("calc k k + 145");
puts("assign j 0");
puts("label ins");
puts("calc t q << 13");
puts("calc q q ^ t");
puts("calc t q >> 17");
puts("calc q q ^ t");
puts("calc t q << 5");
puts("calc q q ^ t");
puts("calc t q % 601");
puts("calc t t <= 300");
puts("cjump nins");
puts("calc a[j] a[j] ^ k");
puts("calc j j + 15");
puts("calc a[j] a[j] ^ x");
puts("calc j j - 15");
puts("label nins");
puts("calc j j + 1");
puts("calc t 15 - j");
puts("cjump ins");
puts("assign t i");
puts("cjump rp");
puts("assign j 0");
puts("assign i 0");
puts("label al");
puts("assign p 0");
puts("assign k 0");
puts("label ca");
puts("calc t i >> k");
puts("calc t t & 1");
puts("calc t t ^ 1");
puts("cjump nadd");
puts("calc p p ^ a[k]");
puts("label nadd");
puts("calc k k + 1");
puts("calc t 15 - k");
puts("cjump ca");
puts("calc t p % 601");
puts("calc t t - 145");
puts("cjump nna");
puts("assign p 0");
puts("assign k 0");
puts("label cb");
puts("calc t i >> k");
puts("calc t t & 1");
puts("calc t t ^ 1");
puts("cjump nxor");
puts("calc k k + 15");
puts("calc p p ^ a[k]");
puts("calc k k - 15");
puts("label nxor");
puts("calc k k + 1");
puts("calc t 15 - k");
puts("cjump cb");
puts("assign k 0");
puts("label check");
puts("calc t k == j");
puts("cjump ok");
puts("calc t result[k] == p");
puts("cjump nok");
puts("calc k k + 1");
puts("jump check");
puts("label ok");
puts("calc t j == m");
puts("cjump nok");
puts("assign result[j] p");
puts("calc j j + 1");
puts("label nok");
puts("label nna");
puts("calc i i + 1");
puts("calc t 32768 - i");
puts("cjump al");
puts("end");
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 1736kb
input:
1
output:
assign i n label rp calc i i - 1 read assign k x calc k k + 2654435769 calc t k >> 16 calc k k ^ t calc k k * 2246822507 calc t x >> 13 calc k k ^ t calc k k * 3266489909 calc t k >> 16 calc k k ^ t assign q k calc k k / 601 calc t k == 0 cjump nm calc k k - 1 label nm calc k k * 601 calc k k + 145 ...
result:
wrong answer too many instructions
Test #2:
score: 0
Wrong Answer
time: 1ms
memory: 1592kb
input:
2
output:
assign i n label rp calc i i - 1 read assign k x calc k k + 2654435769 calc t k >> 16 calc k k ^ t calc k k * 2246822507 calc t x >> 13 calc k k ^ t calc k k * 3266489909 calc t k >> 16 calc k k ^ t assign q k calc k k / 601 calc t k == 0 cjump nm calc k k - 1 label nm calc k k * 601 calc k k + 145 ...
result:
wrong answer too many instructions
Test #3:
score: 0
Wrong Answer
time: 1ms
memory: 1476kb
input:
3
output:
assign i n label rp calc i i - 1 read assign k x calc k k + 2654435769 calc t k >> 16 calc k k ^ t calc k k * 2246822507 calc t x >> 13 calc k k ^ t calc k k * 3266489909 calc t k >> 16 calc k k ^ t assign q k calc k k / 601 calc t k == 0 cjump nm calc k k - 1 label nm calc k k * 601 calc k k + 145 ...
result:
wrong answer WA
Test #4:
score: 0
Wrong Answer
time: 1ms
memory: 1744kb
input:
4
output:
assign i n label rp calc i i - 1 read assign k x calc k k + 2654435769 calc t k >> 16 calc k k ^ t calc k k * 2246822507 calc t x >> 13 calc k k ^ t calc k k * 3266489909 calc t k >> 16 calc k k ^ t assign q k calc k k / 601 calc t k == 0 cjump nm calc k k - 1 label nm calc k k * 601 calc k k + 145 ...
result:
wrong answer WA
Test #5:
score: 0
Wrong Answer
time: 1ms
memory: 1596kb
input:
5
output:
assign i n label rp calc i i - 1 read assign k x calc k k + 2654435769 calc t k >> 16 calc k k ^ t calc k k * 2246822507 calc t x >> 13 calc k k ^ t calc k k * 3266489909 calc t k >> 16 calc k k ^ t assign q k calc k k / 601 calc t k == 0 cjump nm calc k k - 1 label nm calc k k * 601 calc k k + 145 ...
result:
wrong answer WA
Test #6:
score: 0
Wrong Answer
time: 1ms
memory: 1476kb
input:
6
output:
assign i n label rp calc i i - 1 read assign k x calc k k + 2654435769 calc t k >> 16 calc k k ^ t calc k k * 2246822507 calc t x >> 13 calc k k ^ t calc k k * 3266489909 calc t k >> 16 calc k k ^ t assign q k calc k k / 601 calc t k == 0 cjump nm calc k k - 1 label nm calc k k * 601 calc k k + 145 ...
result:
wrong answer too many instructions
Test #7:
score: 0
Wrong Answer
time: 1ms
memory: 1500kb
input:
7
output:
assign i n label rp calc i i - 1 read assign k x calc k k + 2654435769 calc t k >> 16 calc k k ^ t calc k k * 2246822507 calc t x >> 13 calc k k ^ t calc k k * 3266489909 calc t k >> 16 calc k k ^ t assign q k calc k k / 601 calc t k == 0 cjump nm calc k k - 1 label nm calc k k * 601 calc k k + 145 ...
result:
wrong answer too many instructions
Test #8:
score: 0
Wrong Answer
time: 1ms
memory: 1480kb
input:
8
output:
assign i n label rp calc i i - 1 read assign k x calc k k + 2654435769 calc t k >> 16 calc k k ^ t calc k k * 2246822507 calc t x >> 13 calc k k ^ t calc k k * 3266489909 calc t k >> 16 calc k k ^ t assign q k calc k k / 601 calc t k == 0 cjump nm calc k k - 1 label nm calc k k * 601 calc k k + 145 ...
result:
wrong answer too many instructions