codeforces
文章平均质量分 81
KeyboardPianist
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #386 (Div. 2)C. Tram
C. Tramtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe tram in Berland goes along a straight line from the point 0 to the p原创 2016-12-18 22:33:43 · 573 阅读 · 0 评论 -
CodeForces702D. Road to Post Office(二分or数学)
D. Road to Post Officetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy has a car and he wants to get from home to the post原创 2016-09-15 20:17:15 · 494 阅读 · 0 评论 -
Codeforces Round #313 (Div. 2)560D. Equivalent Strings
D. Equivalent Stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday on a lecture about strings Gera原创 2016-08-31 10:10:23 · 796 阅读 · 0 评论 -
Codeforces586D. Phillip and Trains(DFS)
D. Phillip and Trainstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe mobile application store has a new原创 2016-08-18 15:07:15 · 548 阅读 · 0 评论 -
CodeForces 614C. Peter and Snow Blower
C. Peter and Snow Blowertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPeter got a new snow blower as a N原创 2016-08-04 09:15:44 · 771 阅读 · 0 评论 -
Codeforces670E. Correct Bracket Sequence Editor
E. Correct Bracket Sequence Editortime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Polycarp started to develop a text ed原创 2016-07-27 22:10:07 · 385 阅读 · 0 评论 -
Codeforces673C Bear and Colors(枚举区间)
C. Bear and Colorstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBear Limak has n colored balls, arranged in one long row. Ball原创 2016-07-27 20:50:24 · 772 阅读 · 0 评论 -
Codeforces681C Heap Operations
C. Heap Operationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya has recently learned data structure named "Binary heap".原创 2016-07-23 20:54:44 · 540 阅读 · 0 评论 -
CodeForces 688C-NP-Hard Problem(dfs)
C. NP-Hard Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Pari and Arya did some research about NP-Hard proble原创 2016-07-24 23:10:25 · 515 阅读 · 0 评论 -
Codeforces596C. Wilbur and Points
C. Wilbur and Pointstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWilbur is playing with a set of n points on the原创 2016-08-11 00:29:28 · 512 阅读 · 0 评论 -
Codeforces 701D. As Fast As Possible(二分)
D. As Fast As Possibletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOn vacations n pupils decided to go on excursion and gather原创 2016-10-09 19:01:01 · 571 阅读 · 0 评论 -
2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest G. Car Repair Shop(优先队列)
链接:http://codeforces.com/contest/730/problem/GG. Car Repair Shoptime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputPolycarp s原创 2016-10-23 22:46:50 · 696 阅读 · 0 评论 -
Codeforces Round #387 (Div. 2)D. Winter Is Coming(优先队列)
D. Winter Is Comingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe winter in Berland lasts n days. For each day we know the f原创 2016-12-19 13:07:59 · 716 阅读 · 0 评论 -
Codeforces739B. Alyona and a tree(树+二分)
B. Alyona and a treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlyona has a tree with n vertices. The root of the tree is t原创 2016-12-18 22:45:22 · 1502 阅读 · 0 评论 -
Codeforces Round #386 (Div. 2)D. Green and Black Tea
D. Green and Black Teatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInnokentiy likes tea very much and today he wants to drink原创 2016-12-18 22:22:20 · 721 阅读 · 0 评论 -
Codeforces Round #385 (Div. 1)A. Hongcow Builds A Nation
A. Hongcow Builds A Nationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHongcow is ruler of the world. As ruler of the world,原创 2016-12-18 22:13:30 · 520 阅读 · 0 评论 -
Codeforces Round #383 (Div. 2)C. Arpa's loud Owf and Mehrdad's evil plan
C. Arpa's loud Owf and Mehrdad's evil plantime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs you have noticed, there are lovely g原创 2016-12-07 06:53:50 · 886 阅读 · 0 评论 -
Codeforces724 D. Dense Subsequence(字符串贪心)
D. Dense Subsequencetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a string s, consisting of lowercase English le原创 2016-11-18 11:50:04 · 568 阅读 · 0 评论 -
Codeforces700B. Connecting Universities
B. Connecting Universitiestime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTreeland is a country in which there are n towns conne原创 2016-09-29 21:10:33 · 462 阅读 · 0 评论 -
CodeForces 731C. Socks(DFS)
C. Sockstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputArseniy is already grown-up and independent. His mother decided to leave原创 2016-10-24 21:06:53 · 406 阅读 · 0 评论 -
codeforces680C
C. Bear and Prime 100time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThis is an interactive problem. In the output section below原创 2016-06-27 12:59:13 · 533 阅读 · 0 评论 -
codeforces 653B Bear and Compressing (dfs)
B. Bear and Compressingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a little polar bear. Polar bears hate long strin原创 2016-05-07 14:11:21 · 746 阅读 · 0 评论 -
Codeforces 631C-Report
C. Reporttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEach month Blake gets the report containing main economic indicators of原创 2016-03-26 15:37:05 · 560 阅读 · 0 评论 -
Educational Codeforces Round 2 B. Queries about less or equal elements
B. Queries about less or equal elementstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two arrays of integer原创 2015-12-16 13:11:52 · 758 阅读 · 0 评论 -
Educational Codeforces Round 2 A. Extract Numbers
A. Extract Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given string s. Let's call word any larg原创 2015-12-16 13:03:59 · 801 阅读 · 0 评论 -
Codeforces Round #335 (Div. 2) C.Sorting Railway Cars
C. Sorting Railway Carstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn infinitely long railway has a train consis原创 2015-12-14 21:07:34 · 510 阅读 · 0 评论 -
Codeforces Round #335 (Div. 2) B.Testing Robots
B. Testing Robotstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Cybernetics Failures (CF) organisation made a p原创 2015-12-14 21:01:09 · 448 阅读 · 0 评论 -
Codeforces Round #335 (Div. 2) A.Magic Spheres
A. Magic Spherestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputCarl is a beginner magician. He has a blue,b viole原创 2015-12-14 20:53:41 · 475 阅读 · 0 评论 -
CodeForces 590A Median Smoothing
给出一段01的序列,问是否能通过题目中给的方法得到一个稳定的序列,输出变化次数和最后稳定的序列变化方法:a1 = b1, an = bn, bi 是 ai-1, ai, ai+1的中位数(2 多试几个就知道没有达不到稳定的情况,要变化的都是0101这种与相邻的值不同,那么就可以求序列中最长的010101这种相邻之间的值不同的子序列,它的变化次数就是答案。如果这种序列的两端是一样原创 2015-10-31 22:17:23 · 507 阅读 · 0 评论 -
Educational Codeforces Round 1 B. Queries on a String
题目:点击打开链接求余然后模拟#include #include #define maxn 20005char s[maxn], c[maxn];void fun(int l, int r, int k){ int Move = k%(r-l+1), p; for(int i = l;i <= r;i++){ p = i - l;原创 2015-11-14 08:33:00 · 504 阅读 · 0 评论 -
Educational Codeforces Round 1 A. Tricky Sum
题目:http://codeforces.com/contest/598/problem/A求等差数列和再减去1~n内为2的整数次幂的值的2倍#include #include #define ll long long intll Sum(ll n){ return (n + n*(n-1)/2);}int main(){ int T; ll ask,原创 2015-11-14 08:28:35 · 373 阅读 · 0 评论 -
Codeforces Round #334 (Div. 2) B. More Cowbell
题目连接B. More Cowbelltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKevin Sun wants to move his preci原创 2015-12-05 11:08:43 · 325 阅读 · 0 评论 -
Codeforces Round #340 (Div. 2) C. Watering Flowers
C. Watering Flowerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA flowerbed has many flowers and two fountains.You can adju原创 2016-01-25 11:17:03 · 571 阅读 · 0 评论 -
Codeforces Round #333 (Div. 2) B. Approximating a Constant Range
B. Approximating a Constant Rangetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Xellos was doing a p原创 2015-12-06 15:25:47 · 391 阅读 · 0 评论 -
Codeforces650B Image Preview
B. Image Previewtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya's telephone contains n photos. Photo nu原创 2016-03-13 22:42:40 · 628 阅读 · 0 评论 -
Codeforces650A Watchmen
A. Watchmentime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWatchmen are in a danger and Doctor Manhattan tog原创 2016-03-13 22:36:07 · 464 阅读 · 0 评论 -
Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) C. Constellation
C. Constellationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputCat Noku has obtained a map of the night sky. On this map, he fo原创 2016-02-03 20:51:19 · 413 阅读 · 0 评论 -
Good Bye 2015 C. New Year and Domino dp+容斥原理
C. New Year and Dominotime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThey say "years are like dominoes, tumbling one after the原创 2016-02-02 10:04:44 · 447 阅读 · 0 评论 -
Codeforces Round #337 (Div. 2) C Harmony Analysis
C. Harmony Analysistime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe semester is already ending, so Danil made an effort and d原创 2016-01-31 17:59:51 · 330 阅读 · 0 评论 -
Codeforces Round #336 (Div. 2) C. Chain Reaction
C. Chain Reactiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n beacons located at distinct positions on a number原创 2015-12-26 17:30:26 · 511 阅读 · 0 评论