User

B06902058

B06902058

Visitor Class 2

Accept

287

Sub

Na

Exp

Na
  • ::ffff:140.112.4.192
  • Last login 2019/11/26 11:26:17

好想喝茶 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

Recent Submission

# Problem User Verdict Len Date
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
318434 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 10) * 2 KB 2019/11/03 19:23:46
318433 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 10) * 2 KB 2019/11/03 19:22:28
318428 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B06902058 Runtime Error (score: 75) * 2 KB 2019/11/03 19:17:26