User

B06902058

B06902058

Visitor Class 2

Accept

287

Sub

Na

Exp

Na
  • ::ffff:10.5.5.203
  • Last login 2020/12/17 01:23:53

好想喝茶 syntax enable colo torte set nu set ai set bg=dark set tabstop=4 set shiftwidth=4 set mouse=a set backspace=2 set history=100 set incsearch set hlsearch :inoremap ( ()<Esc>i :inoremap " ""<Esc>i :inoremap ' ''<Esc>i :inoremap [ []<Esc>i :inoremap {<CR> {<CR>}<Esc>ko :inoremap {{ {}<ESC>i filetype indent on :hi LineNr cterm=bold ctermfg=Black ctermbg=NONE :hi CursorLineNr cterm=bold ctermfg=Green ctermbg=NONE "< F5> 编译和运行C++ map <f5> :call CompileRunGcc()<cr> func! CompileRunGcc() exec "w" exec "!gcc % -o %<" exec "! ./%<" endfunc

Solved List
3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 21 22 23 24 27 28 29 30 32 33 36 37 38 44 46 47 49 50 53 54 55 58 65 72 73 74 75 76 77 80 85 87 88 89 93 94 96 97 98 99 100 103 104 106 109 128 129 130 132 133 134 136 137 190 195 202 203 204 206 208 210 215 218 220 221 222 223 224 225 230 232 234 235 236 238 239 240 241 242 244 248 249 251 253 256 260 261 262 264 265 266 267 269 270 271 275 276 277 281 282 283 10005 10006 10007 10008 10009 10010 10011 10016 10017 10018 10019 10020 10021 10029 10030 10031 10032 10039 10040 10043 10045 10046 10049 10052 10053 10056 10059 10066 10069 10078 10079 10118 10167 10169 10171 10173 10175 10177 10178 10180 10181 10185 10187 10188 10193 10194 10195 10198 10200 20001 20005 20006 20008 20011 50000 50001 50002 50003 50004 50005 50006 50007 50008 50009 50010 50011 50012 50013 50014 50015 50016 50017 50018 50019 50020 50021 50022 50023 50024 50025 50026 50027 50028 50029 50030 50031 50032 50033 50034 50035 50036 50039 50040 50041 50042 50043 50044 50045 50046 50047 50048 50049 50050 50051 50052 50053 50054 50055 50056 50057 50058 50059 50060 50061 50062 50063 50064 50065 50066 50067 50068 50069 50070 50071 50072 50073 50074 50078 50079 50080 50081 50082 50083 50084 50085 50086 50087 50088 50089 50090 50091 50092 50093 50094 50095 50096 50097 50098 50099 50100 50101 50102 50103 50104 50105 50106 50107 50108 50110 50111 50112 50113 50114 50115 50116 50117 50120 50121 50122 50124 50159

Recent Submission (all)

# Problem User Verdict Len Date Style
374443 10030 Real / Fake Thing B06902058 Time Limit Exceeded (score: 80) C 1 KB 2020/12/17 02:56:38
374442 10030 Real / Fake Thing B06902058 Time Limit Exceeded (score: 80) C 1 KB 2020/12/17 02:54:16
374439 10030 Real / Fake Thing B06902058 Time Limit Exceeded (score: 80) C 1011 B 2020/12/17 02:49:32
334040 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B06902058 Accepted (1.0 s, 46 MB) * 4 KB 2019/11/26 14:46:26
334002 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B06902058 Output Limit Exceeded (score: 20) * 4 KB 2019/11/26 13:41:14
333999 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B06902058 Output Limit Exceeded (score: 20) * 4 KB 2019/11/26 13:32:37
333992 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B06902058 Output Limit Exceeded (score: 20) * 4 KB 2019/11/26 13:23:55
333991 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B06902058 Output Limit Exceeded (score: 20) * 4 KB 2019/11/26 13:21:53
333955 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B06902058 Wrong Answer (score: 0) * 3 KB 2019/11/26 11:37:41
333954 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B06902058 Wrong Answer (score: 0) * 3 KB 2019/11/26 11:36:38
333950 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B06902058 Wrong Answer (score: 0) * 3 KB 2019/11/26 11:31:12
333949 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B06902058 Wrong Answer (score: 0) * 3 KB 2019/11/26 11:30:28
318446 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 85) * 2 KB 2019/11/03 19:40:07
318444 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 85) * 2 KB 2019/11/03 19:38:18
318443 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Memory Limit Exceeded (score: 70) * 2 KB 2019/11/03 19:37:00
318442 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 85) * 2 KB 2019/11/03 19:36:10
318440 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 75) * 2 KB 2019/11/03 19:29:35
318439 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 10) * 2 KB 2019/11/03 19:28:50
318437 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 75) * 2 KB 2019/11/03 19:25:50
318435 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 75) * 2 KB 2019/11/03 19:24:11

What do you want to do ?

Instructor Pangfeng Liu, Web designer Akira, Peer4321, Maplewing, Morris, Daniel1147

Powered by Nodejs © 2015