本作业主要涉及分支结构的算法设计,要注意分支结构的条件选取,表达式的建立以及代码结构的完备性
RunID | User | Nick Name | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
9767 | 20210348 | 少年与狗(番薯) | Accepted | 15224 KiB | 102 ms | Python | 199 bytes | 2022-11-19 13:37:49 | |
9766 | 20210348 | 少年与狗(番薯) | Accepted | 15224 KiB | 169 ms | Python | 295 bytes | 2022-11-19 13:37:30 | |
9765 | 20210348 | 少年与狗(番薯) | Accepted | 15224 KiB | 66 ms | Python | 114 bytes | 2022-11-19 13:37:13 | |
9764 | 20210348 | 少年与狗(番薯) | Accepted | 15224 KiB | 165 ms | Python | 219 bytes | 2022-11-19 13:36:47 | |
9763 | 20210348 | 少年与狗(番薯) | Accepted | 15224 KiB | 65 ms | Python | 113 bytes | 2022-11-19 13:36:30 | |
9762 | 20210348 | 少年与狗(番薯) | Runtime Error | 15224 KiB | 168 ms | Python | 95 bytes | 2022-11-19 13:35:45 | |
9761 | 20210348 | 少年与狗(番薯) | Runtime Error | 15224 KiB | 67 ms | Python | 170 bytes | 2022-11-19 13:35:24 | |
8901 | 20210348 | 少年与狗(番薯) | Accepted | 15224 KiB | 69 ms | Python | 146 bytes | 2022-10-31 02:49:59 | |
8898 | 20210348 | 少年与狗(番薯) | Accepted | 15224 KiB | 65 ms | Python | 159 bytes | 2022-10-31 02:49:35 | |
8470 | 20210348 | 少年与狗(番薯) | Accepted | 15224 KiB | 66 ms | Python | 309 bytes | 2022-10-27 08:42:58 | |
8461 | 20210348 | 少年与狗(番薯) | Wrong Answer | 15224 KiB | 65 ms | Python | 309 bytes | 2022-10-27 08:40:57 | |
8268 | 20210348 | 少年与狗(番薯) | Accepted | 15224 KiB | 95 ms | Python | 96 bytes | 2022-10-27 08:09:22 |