发表评论取消回复
相关阅读
相关 CodeForces - 27C Unordered Subsequence(暴力模拟)
The sequence is called ordered if it is non-decreasing or non-increasing. For example, s
相关 Educational Codeforces Round 32 A. Local Extrema(模拟水题)
A. Local Extrema time limit per test 1 second memory limit per test 256 megabytes i
相关 Codeforces Round #443 (Div. 2) A. Borya's Diagnosis(水水的模拟)
A. Borya's Diagnosis time limit per test 2 seconds memory limit per test 256 megabyt
相关 codeforces 141A Amusing Joke(模拟水题)
So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and h
相关 CodeForces 144C Anagram Search(暴力模拟)
A string t is called an anagram of the string s, if it is possible to rearrange letters
相关 Codeforces Good Bye 2017 C. New Year and Curling(模拟水题)
C. New Year and Curling time limit per test 2 seconds memory limit per test 256 mega
相关 Conversion from int16_t to uint32_t
int16_t s; uint32_t ui = s; Is the result of converting a `int16_t` value to a `uin
相关 CodeForces - 1040B Shashlik Cooking(水题)
题目: B. Shashlik Cooking time limit per test 1 second memory limit per test 512 mega
相关 CodeForces - 1194B Yet Another Crosses Problem (模拟)
You are given a picture consisting of nn rows and mm columns. Rows are numbered from 11
相关 CodeForces - 1194C From S To T (模拟、水题)
You are given three strings ss, tt and pp consisting of lowercase Latin letters. You may
还没有评论,来说两句吧...