某科学的程序员

C. Boredom time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Alex doesn't like boredom. That's why whenever he

Fedya studies in a gymnasium. Fedya's maths hometask is to calculate the following expression: (1n + 2n + 3n + 4n) mod 5 for given value of n. Fedya managed to complete the task. Can you? Note tha

A. Pangram 水题，不区分大小写判断字母是不是都出现过至少一次。 #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define ll long long #define e

的本题可用可不用线段树。 ①线段树解法：首先确定这是一个build()和query()解决的事，不需要update();比较特殊的是这题在query()的时候需要更新值（合并左右括号）。 思路：每个区间保存3个属性，未匹配的左、右括号和已匹配的括号（未匹配的单向括号里不含已匹配的括号）。在合并(pushUp)的时候，把2个子区间的左、右、合法括号（即已匹配）都加上来，合法括号再加上新匹

A. Laptops time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output One day Dima and Alex had an argument about the price and quality of laptops. Dima t

A. Pashmak and Garden time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Pashmak has fallen in love with an att

B. Pashmak and Flowers time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Pashmak decided to give Parmida a pai

C++的sor默认按＜号排序，对int自然可以，对结构体的就不行了，所以要重载

A. Appleman and Easy Task time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Toastman came up with a very easy

多年没打cf，感觉智商上线？