摘要： https://codeforces.com/contest/1118/problem/F1 阅读全文

摘要： https://codeforces.com/contest/1118/problem/D2 和easy version的主要区别是，数据增加了。 easy version采用的是线性查找，效率低 在这里采用binary search就可以了 阅读全文

摘要： https://codeforces.com/contest/1118/problem/D1 能做完的天数最大不超过n，因为假如每天一杯咖啡，每杯咖啡容量大于1 首先对容量进行从大到小的排序， 阅读全文

摘要： Description Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. Th 阅读全文

摘要： Tanya has nn candies numbered from 11 to nn. The ii-th candy has the weight aiai. She plans to eat exactly n−1n−1 candies and give the remaining candy 阅读全文

摘要： Problem Description Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let 阅读全文

摘要： Farmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the circus. Their hoofed feet prevent them from tightrope wa 阅读全文

摘要： It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not afraid of this boring process. Jane has dec 阅读全文

摘要： Description Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and r 阅读全文

摘要： Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The exciteme 阅读全文