2019年1月21日
HDU-3015 Disharmony Trees [数状数组]
摘要： Problem Description One day Sophia finds a very big square. There are n trees in the square. They are all so tall. Sophia is very interesting in them. 阅读全文
posted @ 2019-01-21 19:02 HazelNuto 阅读(233) 评论(0) 推荐(0) 编辑
Codeforces Round #533 (Div. 2)C. Ayoub and Lost Array
摘要： C. Ayoub and Lost Array Ayoub had an array 𝑎 of integers of size 𝑛 and this array had two interesting properties: All the integers in the array were 阅读全文
posted @ 2019-01-21 12:28 HazelNuto 阅读(414) 评论(0) 推荐(0) 编辑
2018年4月16日
Codeforces Round #447 (Div. 2)E. Ralph and Mushrooms
摘要： Ralph is going to collect mushrooms in the Mushroom Forest. There are m directed paths connecting n trees in the Mushroom Forest. On each path grow so 阅读全文
posted @ 2018-04-16 09:04 HazelNuto 阅读(248) 评论(0) 推荐(0) 编辑
2018年3月24日
Codeforces Round #471 (Div. 2)B. Not simply beatiful strings
摘要： Let's call a string adorable if its letters can be realigned in such a way that they form two consequent groups of equal symbols (note that different 阅读全文
posted @ 2018-03-24 21:49 HazelNuto 阅读(605) 评论(0) 推荐(0) 编辑
Codeforces Round #471 (Div. 2)A. Feed the cat
摘要： After waking up at hh:mm, Andrew realised that he had forgotten to feed his only cat for yet another time (guess why there's only one cat). The cat's 阅读全文
posted @ 2018-03-24 19:20 HazelNuto 阅读(416) 评论(0) 推荐(0) 编辑
2018年3月22日
POJ 3281 Dining[网络流]
摘要： Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cooked fabulous 阅读全文
posted @ 2018-03-22 11:15 HazelNuto 阅读(169) 评论(0) 推荐(0) 编辑
Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)D. Peculiar apple-tree
摘要： In Arcady's garden there grows a peculiar apple-tree that fruits one time per year. Its peculiarity can be explained in following way: there are n inf 阅读全文
posted @ 2018-03-22 10:36 HazelNuto 阅读(159) 评论(0) 推荐(0) 编辑
Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)C. Laboratory Work
摘要： Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value t 阅读全文
posted @ 2018-03-22 08:20 HazelNuto 阅读(237) 评论(0) 推荐(0) 编辑
Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)B. World Cup
摘要： The last stage of Football World Cup is played using the play-off system. There are n teams left in this stage, they are enumerated from 1 to n. Sever 阅读全文
posted @ 2018-03-22 08:15 HazelNuto 阅读(218) 评论(0) 推荐(0) 编辑
Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)A. Friends Meeting
摘要： Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the point x1 = a, another one is in the point x2 = b. 阅读全文
posted @ 2018-03-22 08:10 HazelNuto 阅读(168) 评论(0) 推荐(0) 编辑