Codeforces
Never_Say-Never
这个作者很懒,什么都没留下…
展开
-
CodeForces 597 A. Divisibility
DescriptionFind the number of k-divisible numbers on the segment [a, b]. In other words you need to find the number of such integer values xthat a ≤ x ≤ b and x is divisible by k.Input原创 2016-07-21 23:00:22 · 294 阅读 · 0 评论 -
Codeforces Round #367 (Div. 2)ABeru-taxi
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th t原创 2016-08-12 12:13:02 · 249 阅读 · 0 评论 -
CodeForces 659A Round House(技巧)
Vasya lives in a round building, whose entrances are numbered sequentially by integers from 1 to n. Entrance n and entrance 1 are adjacent.Today Vasya got bored and decided to take a walk in t原创 2016-08-11 11:37:50 · 274 阅读 · 0 评论 -
Codeforces 557B Pasha and Tea (思维)
Pasha decided to invite his friends to a tea party. For that occasion, he has a large teapot with the capacity of w milliliters and 2n tea cups, each cup is for one of Pasha's friends. The i-th cup原创 2016-08-11 10:35:05 · 455 阅读 · 0 评论 -
CodeForces 660ACo-prime Array
DescriptionYou are given an array of n elements, you must make it a co-prime array in as few moves as possible.In each move you can insert any positive integral number you want not greater than原创 2016-08-22 20:20:01 · 259 阅读 · 0 评论 -
CodeForces 580BKefa and Company
DescriptionKefa wants to celebrate his first big salary by going to restaurant. However, he needs company.Kefa has n friends, each friend will agree to go to the restaurant if Kefa asks. Each fr原创 2016-07-21 23:52:37 · 253 阅读 · 0 评论 -
CodeForces 612BHDD is Outdated Technology
DescriptionHDD hard drives group data by sectors. All files are split to fragments and each of them are written in some sector of hard drive. Note the fragments can be written in sectors in arbitr原创 2016-07-21 23:47:17 · 263 阅读 · 0 评论 -
【CodeForces】597B - Restaurant(贪心)
DescriptionA restaurant received n orders for the rental. Each rental order reserve the restaurant for a continuous period of time, the i-th order is characterized by two time values — the start原创 2016-07-21 23:43:04 · 256 阅读 · 0 评论 -
Codeforces 615A Bulbs 【水题】
DescriptionVasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off. There are n buttons, each of them is connected to some set of bulbs. Vasya can pres原创 2016-07-21 23:40:40 · 298 阅读 · 0 评论 -
Codeforces 610A Pasha and Stick
DescriptionPasha has a wooden stick of some positive integer length n. He wants to perform exactly three cuts to get four parts of the stick. Each part must have some positive integer length and t原创 2016-07-21 23:34:24 · 220 阅读 · 0 评论 -
CodeForces612AThe Text Splitting(枚举)
DescriptionYou are given the string s of length n and the numbers p, q. Split the string s to pieces of length p and q.For example, the string "Hello" for p = 2, q = 3 can be split to the two原创 2016-07-21 23:29:55 · 216 阅读 · 0 评论 -
CodeForces 599A Patrick and Shopping
DescriptionToday Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is a d1 meter long r原创 2016-07-21 23:14:49 · 492 阅读 · 0 评论 -
codeforces 598A Tricky Sum
Description求和是一种最常见的运算,我们经常做的就是1加到n的和。例如,1加到100的和是5050。但是现在,我们稍微变动一下求和方法,对于属于2的幂次的数,我们做的是减法,其余仍旧做加法。例如,当n=4的时候,最后的结果应该是-1-2+3-4=-4,因为1、2、4分别是2的0次方、2的1次方、2的2次方。现在请你来计算t次这样的运算。Input输入第原创 2016-07-21 23:06:58 · 279 阅读 · 0 评论 -
Codeforces Round #367 (Div. 2) B - Interesting drink
Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in n different shops in the cit原创 2016-08-12 15:57:20 · 222 阅读 · 0 评论