当然是斗笠呀

该文被密码保护。 阅读全文

摘要： E - Apple Tree POJ - 2486 Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Ea 阅读全文

摘要： LCIS HDU - 3308 Given n integers. You have two operations: U A B: replace the Ath number by B. (index counting from 0) Q A B: output the length of the 阅读全文

摘要： "Duel!" Betting on the lovely princess Claris, the duel between Tokitsukaze and Quailty has started. There are nn cards in a row. Each card has two si 阅读全文

摘要： Recently Luba bought a monitor. Monitor is a rectangular matrix of size n × m. But then she started to notice that some pixels cease to work properly. 阅读全文

摘要： 今天的训练一共六道题，训练时间三小时，训练时间内一共做出了一道题，还WA了11次。 反思：1.因为题目没有认真阅读，导致没有正确理解题目，然后一直没写出来，还把心态写炸了。 2.心态问题很严重，已经第二次由于开题不顺，导致正常训练的成绩非常差，这次训练的C题、D题其实都属于简单题系列，D题最后都没来 阅读全文

摘要： You are given two arithmetic progressions: a1k + b1 and a2l + b2. Find the number of integers x such that L ≤ x ≤ R and x = a1k' + b1 = a2l' + b2, for 阅读全文

摘要： C. Vus the Cossack and Strings Vus the Cossack has two binary strings, that is, strings that consist only of "0" and "1". We call these strings aa and 阅读全文

摘要： 题意：对一根长为l的木棒进行切割，给出n个切割点，每次切割的价值，等于需要切割的木头长度。 一开始理解错了，认为切割点时根据当前木条的左端点往右推算。 实际上，左端点始终是不变的一直是0，右端点一直是l，切割点就是在0 ~ l 之间的点，而切割时的价值就是切割这个点的时候当前木条的长度。 状态转移方 阅读全文

摘要： Chladni Figure CodeForces - 1162D Inaka has a disc, the circumference of which is nn units. The circumference is equally divided by nn points numbered 阅读全文