关闭
当前搜索:

Codeforces Round #361 (Div. 2) D (树状数组+二分)

D. Friends and Subsequences time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output Mike and !Mike are old childhoo...
阅读(78) 评论(0)

Codeforces Round #365 (Div. 2) D (树状数组)

D. Mishka and Interesting sum time limit per test 3.5 seconds memory limit per test 256 megabytes input standard input output standard output Little Mishka enjoys progra...
阅读(87) 评论(0)

Codeforces Round #452 (Div. 2) A-C题解

哎............ A. Splitting in Teams time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There wer...
阅读(337) 评论(1)

Codeforces Round #451 (Div. 2) A-C题解

伤心总是难免的,明明是送分场,愣是掉了61分。 A. Rounding time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasya has...
阅读(373) 评论(0)

Codeforces Round #450 (Div. 2) A-C题解

A. Find Extra One time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You have n distinct points on a plane, none of them lie on OY axis. Check that there is a point after removal of which the remaining ...
阅读(402) 评论(0)

Codeforces Round #449 (Div. 2) A-C题解

A. Scarborough Fair time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Are you going to Scarborough Fair? Parsley, sage, rosemary and thyme. Remember me to one who lives there. He once was the true l...
阅读(254) 评论(0)

Codeforces Round #422 (Div. 2) C Hacker, pack your bags! (二分orDP)

Hacker, pack your bags! time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output It's well known that the best way to distract from something is to do one's favourite thing. Job is such a thing for Leha. So...
阅读(208) 评论(0)

Codeforce 839C Journey (dfs+概率)

C. Journey time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output There are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roa...
阅读(556) 评论(0)

Educational Codeforces Round 33 (Rated for Div. 2) A-C题解

A. Chess For Three time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to pract...
阅读(458) 评论(0)

Codeforces Round #447 (Div. 2) A-C题解

A. QAQ time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output "QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth. Now Diamond has given Bort a string consi...
阅读(547) 评论(0)

Codeforces Round #446 (Div. 2) A-C 题解

A. Greed time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Jafar has n cans of cola. Each can is described by two integers: remaining volume of cola ai and can's capacity bi (ai  ≤  bi). Jafar has de...
阅读(463) 评论(2)

Codeforces Round #444 (Div. 2) A-C 题解

A. Div. 64 time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills. Her problem is following:...
阅读(521) 评论(0)

Codeforces Round #443 (Div. 2) A-C 题解

A. Borya's Diagnosis time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output It seems that Borya is seriously sick. He is going visit n doctors to find out the exact diagnosis. Each of the doctors needs the...
阅读(380) 评论(0)

Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2) A-C题解

A. Search for Pretty Integers time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given two lists of non-zero digits. Let's call an integer pretty if its (base 10) representation has at least on...
阅读(320) 评论(0)

Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) A-D题解

A. Trip For Meal time limit per test1 second memory limit per test512 megabytes inputstandard input outputstandard output Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and...
阅读(451) 评论(0)

Codeforces Round #439 (Div. 2) A-C题解

A. The Artful Expedient time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Rock... Paper! After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyom...
阅读(869) 评论(0)

Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) A-C题解

A. Bark to Unlock time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output As technologies develop, manufacturers are making the process of unlocking a phone as user-friendly as possible. To unlock its new p...
阅读(685) 评论(0)

Codeforces Round #435 (Div. 2) A-C题解+D代码

Codeforces Round #435 (Div. 2) A.Mahmoud and Ehab and the MEX B. Mahmoud and Ehab and the bipartiteness C.Mahmoud and Ehab and the xor D.Mahmoud and Ehab and the binary string...
阅读(412) 评论(0)

Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1) A-C题解

C. Did you mean... time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Beroffice text editor has a wide range of features that help working with text. One of the features is an automatic search for typos...
阅读(793) 评论(0)

Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises) A—C题解

传送门:点击打开链接 A. Fraction time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Petya is a big fan of ...
阅读(474) 评论(0)
35条 共2页1 2 下一页 尾页
    个人资料
    • 访问:60509次
    • 积分:2099
    • 等级:
    • 排名:千里之外
    • 原创:154篇
    • 转载:1篇
    • 译文:0篇
    • 评论:17条
    联系方式
    欢迎谈论交流:1245985209
    博客专栏