题目 | 用户 | 结果 | 得分 | 语言 | 用时 | 内存 | 提交时间 |
---|---|---|---|---|---|---|---|
有括号的算术表达式运算 栈 ★★ | EEEEEEEEEE | 0 | C++ | 0.912 s | 3.41 MiB | 2021-07-01 17:11:38 | |
兵马未动,粮草先行★ | AAAAAAAAAA | 100 | C++ | 0.000 s | 0.34 MiB | 2021-07-01 17:11:37 | |
[Tyvj Aug11] 括号匹配 栈 ★☆ | AAAAA | 100 | C++ | 0.915 s | 2.81 MiB | 2021-07-01 17:10:38 | |
[Tyvj Aug11] 括号匹配 栈 ★☆ | AAAAT | 80 | C++ | 1.314 s | 99.37 MiB | 2021-07-01 17:09:30 | |
兵马未动,粮草先行★ | AEEEEEEEEE | 10 | C++ | 0.836 s | 3.07 MiB | 2021-07-01 17:09:16 | |
兵马未动,粮草先行★ | AEEEEEEEEE | 10 | C++ | 0.841 s | 2.73 MiB | 2021-07-01 17:08:25 | |
有括号的算术表达式运算 栈 ★★ | EEEEEEEEEE | 0 | C++ | 0.880 s | 3.41 MiB | 2021-07-01 17:07:15 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAAEW | 80 | C++ | 0.090 s | 0.71 MiB | 2021-07-01 17:06:02 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAAWW | 80 | C++ | 0.000 s | 0.00 MiB | 2021-07-01 17:05:45 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAAEW | 80 | C++ | 0.094 s | 0.71 MiB | 2021-07-01 17:05:39 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAAEW | 80 | C++ | 0.088 s | 0.71 MiB | 2021-07-01 17:05:25 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAAEW | 80 | C++ | 0.096 s | 0.71 MiB | 2021-07-01 17:04:18 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAAEW | 80 | C++ | 0.103 s | 0.71 MiB | 2021-07-01 17:03:46 | |
加法问题 基本 ☆ | AAAAAAAAAA | 100 | C++ | 0.000 s | 0.00 MiB | 2021-07-01 17:03:07 | |
兵马未动,粮草先行★ | AEEEEEEEEE | 10 | C++ | 0.862 s | 3.07 MiB | 2021-07-01 17:03:03 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAATE | 80 | C++ | 1.592 s | 1.31 MiB | 2021-07-01 17:02:54 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAAAA | 100 | C++ | 0.000 s | 0.00 MiB | 2021-07-01 17:02:29 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | RRRRRRRRRR | 0 | C++ | 0.002 s | 3.28 MiB | 2021-07-01 17:02:27 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAATE | 80 | C++ | 1.525 s | 1.31 MiB | 2021-07-01 17:02:26 | |
[NOIP 2002]过河卒 动态规划 递推 NOIP/CSP 回溯法 ★☆ | AAAAAAAAWW | 80 | C++ | 0.000 s | 0.00 MiB | 2021-07-01 17:02:20 |