Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 4 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
1715 | Scheme | dfs and similar graphs trees | Statement | E | Codeforces Beta Round 22 (Div. 2 Only) {22} | PROGRAMMING | Codeforces Beta Round #22 Tutorial | 2400 | |
5497 | You're Given a String... | brute force greedy | Statement | A | Codeforces Beta Round 23 {23} | PROGRAMMING | Codeforces Beta Round #23 tutorial | 1200 | |
3426 | Party | constructive algorithms graphs math | Statement | B | Codeforces Beta Round 23 {23} | PROGRAMMING | Codeforces Beta Round #23 tutorial | 1600 | |
639 | Tree | dp | Statement | E | Codeforces Beta Round 23 {23} | PROGRAMMING | Codeforces Beta Round #23 tutorial | 2500 | |
1444 | Oranges and Apples | constructive algorithms sortings | Statement | C | Codeforces Beta Round 23 {23} | PROGRAMMING | Codeforces Beta Round #23 tutorial | 2500 | |
339 | Tetragon | geometry math | Statement | D | Codeforces Beta Round 23 {23} | PROGRAMMING | Codeforces Beta Round #23 tutorial | 2600 | |
5364 | Ring road | graphs | Statement | A | Codeforces Beta Round 24 {24} | PROGRAMMING | Codeforces Beta Round #24 solutions | 1400 | |
1807 | F1 Champions | implementation | Statement | B | Codeforces Beta Round 24 {24} | PROGRAMMING | 1500 | ||
1271 | Sequence of points | geometry implementation math | Statement | C | Codeforces Beta Round 24 {24} | PROGRAMMING | Codeforces Beta Round #24 solutions | 1800 | |
919 | Berland collider | binary search | Statement | E | Codeforces Beta Round 24 {24} | PROGRAMMING | Codeforces Beta Round #24 solutions | 2300 | |
2019 | Broken robot | dp probabilities | Statement | D | Codeforces Beta Round 24 {24} | PROGRAMMING | Codeforces Beta Round #24 solutions | 2400 | |
9883 | Phone numbers | implementation | Statement | B | Codeforces Beta Round 25 (Div. 2 Only) {25} | PROGRAMMING | Codeforces Beta Round #25 Solution Analysis | 1100 | |
89047 | IQ test | brute force | Statement | A | Codeforces Beta Round 25 (Div. 2 Only) {25} | PROGRAMMING | Codeforces Beta Round #25 Solution Analysis | 1300 | |
6462 | Roads in Berland | graphs shortest paths | Statement | C | Codeforces Beta Round 25 (Div. 2 Only) {25} | PROGRAMMING | 1800 | ||
11799 | Roads not only in Berland | ds graphs trees | Statement | D | Codeforces Beta Round 25 (Div. 2 Only) {25} | PROGRAMMING | Codeforces Beta Round #25 Solution Analysis | 1900 | |
2552 | Test | hashing strings | Statement | E | Codeforces Beta Round 25 (Div. 2 Only) {25} | PROGRAMMING | Codeforces Beta Round #25 Solution Analysis | 2300 | |
870 | Parquet | combinatorics constructive algorithms | Statement | C | Codeforces Beta Round 26 (Codeforces format) {26} | PROGRAMMING | Разбор Codeforces Beta Round #26 (ещё один) | 2200 | |
20193 | Regular Bracket Sequence | greedy | Statement | B | Codeforces Beta Round 26 (Codeforces format) {26} | PROGRAMMING | Разбор Codeforces Beta Round #26 (ещё один) | 2300 | |
32801 | Almost Prime | number theory | Statement | A | Codeforces Beta Round 26 (Codeforces format) {26} | PROGRAMMING | Разбор Codeforces Beta Round #26 (ещё один) | 2400 | |
381 | Multithreading | constructive algorithms | Statement | E | Codeforces Beta Round 26 (Codeforces format) {26} | PROGRAMMING | 2700 | ||
809 | Tickets | combinatorics math probabilities | Statement | D | Codeforces Beta Round 26 (Codeforces format) {26} | PROGRAMMING | Разбор Codeforces Beta Round #26 (ещё один) | 2800 | |
20729 | Next Test | implementation sortings | Statement | A | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 1900 | |
2828 | Unordered Subsequence | constructive algorithms greedy | Statement | C | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 2000 | |
5427 | Tournament | bitmasks brute force dfs and similar greedy | Statement | B | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | 2000 | ||
4305 | Number With The Given Amount Of Divisors | brute force dp number theory | Statement | E | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 2100 | |
2597 | Ring Road 2 | 2-sat dfs and similar ds graphs | Statement | D | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 2300 | |
4784 | pSort | dfs and similar ds graphs | Statement | B | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 1600 | |
808 | Bender Problem | implementation | Statement | A | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 2200 | |
622 | Don't fear, DravDe is kind | binary search data structures dp hashing | Statement | D | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 2600 | |
94 | DravDe saves the world | geometry math | Statement | E | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | 2700 | ||
1071 | Bath Queue | combinatorics dp probabilities | Statement | C | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 2700 | |
7238 | Spit Problem | brute force | Statement | A | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | My solution @ Round #29, [without Problem E] | 1000 | |
3012 | Traffic Lights | implementation | Statement | B | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | My solution @ Round #29, [without Problem E] | 1500 | |
5133 | Mail Stamps | data structures dfs and similar graphs implementation | Statement | C | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | My solution @ Round #29, [without Problem E] | 1700 | |
2520 | Ant on the Tree | constructive algorithms dfs and similar trees | Statement | D | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | My solution @ Round #29, [without Problem E] | 1900 | |
938 | Quarrel | graphs shortest paths | Statement | E | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | 2400 | ||
3530 | Accounting | brute force math | Statement | A | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Разбор C | 1500 | |
1214 | Codeforces World Finals | implementation | Statement | B | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Разбор C | 1700 | |
1999 | Shooting Gallery | dp probabilities | Statement | C | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Разбор C | 1800 | |
457 | King's Problem? | geometry greedy | Statement | D | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Разбор C | 2600 | |
751 | Tricky and Clever Password | binary search constructive algorithms data structures greedy hashing strings | Statement | E | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | 2700 | ||
10509 | Worms Evolution | implementation | Statement | A | Codeforces Beta Round 31 (Div. 2, Codeforces format) {31} | PROGRAMMING | 1200 | ||
4380 | Sysadmin Bob | greedy implementation strings | Statement | B | Codeforces Beta Round 31 (Div. 2, Codeforces format) {31} | PROGRAMMING | 1500 | ||
1845 | Schedule | implementation | Statement | C | Codeforces Beta Round 31 (Div. 2, Codeforces format) {31} | PROGRAMMING | 1700 | ||
1051 | Chocolate | dfs and similar implementation | Statement | D | Codeforces Beta Round 31 (Div. 2, Codeforces format) {31} | PROGRAMMING | 2000 | ||
1123 | TV Game | dp | Statement | E | Codeforces Beta Round 31 (Div. 2, Codeforces format) {31} | PROGRAMMING | 2200 | ||
2198 | Flea | math | Statement | C | Codeforces Beta Round 32 (Div. 2, Codeforces format) {32} | PROGRAMMING | Beta Round 32 | 1700 | |
1297 | Constellation | implementation | Statement | D | Codeforces Beta Round 32 (Div. 2, Codeforces format) {32} | PROGRAMMING | Beta Round 32 | 1700 | |
345 | Hide-and-Seek | geometry implementation | Statement | E | Codeforces Beta Round 32 (Div. 2, Codeforces format) {32} | PROGRAMMING | 2300 | ||
12896 | Reconnaissance | brute force | Statement | A | Codeforces Beta Round 32 (Div. 2, Codeforces format) {32} | PROGRAMMING | Beta Round 32 | 800 | |
66465 | Borze | expression parsing implementation | Statement | B | Codeforces Beta Round 32 (Div. 2, Codeforces format) {32} | PROGRAMMING | Beta Round 32 | 900 | |
4188 | What is for dinner? | greedy implementation | Statement | A | Codeforces Beta Round 33 (Codeforces format) {33} | PROGRAMMING | 1300 | ||
3058 | Wonderful Randomized Sum | greedy | Statement | C | Codeforces Beta Round 33 (Codeforces format) {33} | PROGRAMMING | Codeforces Beta Round #33 (personal participation commentaries) | 1800 | |
4698 | String Problem | shortest paths | Statement | B | Codeforces Beta Round 33 (Codeforces format) {33} | PROGRAMMING | Codeforces Beta Round #33 (personal participation commentaries) | 1800 | |
1243 | Knights | geometry graphs shortest paths sortings | Statement | D | Codeforces Beta Round 33 (Codeforces format) {33} | PROGRAMMING | 2000 | ||
131 | Helper | Statement | E | Codeforces Beta Round 33 (Codeforces format) {33} | PROGRAMMING | 2500 | |||
54603 | Sale | greedy sortings | Statement | B | Codeforces Beta Round 34 (Div. 2) {34} | PROGRAMMING | Codeforces Beta Round #34 (Div. 2) Разбор | 1000 | |
30777 | Reconnaissance 2 | implementation | Statement | A | Codeforces Beta Round 34 (Div. 2) {34} | PROGRAMMING | Codeforces Beta Round #34 (Div. 2) Разбор | 1100 | |
4313 | Page Numbers | expression parsing implementation sortings strings | Statement | C | Codeforces Beta Round 34 (Div. 2) {34} | PROGRAMMING | Codeforces Beta Round #34 (Div. 2) Разбор | 1400 | |
5302 | Road Map | dfs and similar graphs | Statement | D | Codeforces Beta Round 34 (Div. 2) {34} | PROGRAMMING | Codeforces Beta Round #34 (Div. 2) Разбор | 1700 | |
594 | Collisions | brute force implementation math | Statement | E | Codeforces Beta Round 34 (Div. 2) {34} | PROGRAMMING | Codeforces Beta Round #34 (Div. 2) Разбор | 2100 | |
6892 | Shell Game | implementation | Statement | A | Codeforces Beta Round 35 (Div. 2) {35} | PROGRAMMING | 1100 | ||
7057 | Fire Again | brute force dfs and similar shortest paths | Statement | C | Codeforces Beta Round 35 (Div. 2) {35} | PROGRAMMING | 1600 | ||
1032 | Warehouse | implementation | Statement | B | Codeforces Beta Round 35 (Div. 2) {35} | PROGRAMMING | 1700 | ||
3415 | Animals | dp greedy | Statement | D | Codeforces Beta Round 35 (Div. 2) {35} | PROGRAMMING | 1700 | ||
759 | Parade | data structures sortings | Statement | E | Codeforces Beta Round 35 (Div. 2) {35} | PROGRAMMING | 2300 | ||
3057 | Extra-terrestrial Intelligence | implementation | Statement | A | Codeforces Beta Round 36 {36} | PROGRAMMING | Codeforces Beta Round #36 | 1400 | |
1534 | Fractal | implementation | Statement | B | Codeforces Beta Round 36 {36} | PROGRAMMING | Codeforces Beta Round #36 | 1600 | |
715 | New Game with a Chess Piece | games | Statement | D | Codeforces Beta Round 36 {36} | PROGRAMMING | Codeforces Beta Round #36 | 2200 | |
340 | Bowls | geometry implementation | Statement | C | Codeforces Beta Round 36 {36} | PROGRAMMING | Codeforces Beta Round #36 | 2200 | |
542 | Two Paths | constructive algorithms ds graphs implementation | Statement | E | Codeforces Beta Round 36 {36} | PROGRAMMING | 2500 | ||
24900 | Towers | sortings | Statement | A | Codeforces Beta Round 37 {37} | PROGRAMMING | Codeforces Beta Round #37 (Tutorial) | 1100 | |
971 | Computer Game | greedy implementation | Statement | B | Codeforces Beta Round 37 {37} | PROGRAMMING | 1800 | ||
1751 | Old Berland Language | data structures greedy trees | Statement | C | Codeforces Beta Round 37 {37} | PROGRAMMING | Codeforces Beta Round #37 (Tutorial) | 1900 | |
423 | Lesson Timetable | combinatorics dp math | Statement | D | Codeforces Beta Round 37 {37} | PROGRAMMING | 2300 | ||
631 | Trial for Chief | graphs greedy shortest paths | Statement | E | Codeforces Beta Round 37 {37} | PROGRAMMING | Codeforces Beta Round #37 (Tutorial) | 2600 | |
3586 | Chess | brute force implementation math | Statement | B | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | Школьная индивидуальная олимпиада #1 - Codeforces Beta Round #38. (Разбор задачи D) | 1200 | |
2268 | Blinds | brute force | Statement | C | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | 1400 | ||
2627 | Let's Go Rolling! | dp sortings | Statement | E | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | Школьная индивидуальная олимпиада #1 - Codeforces Beta Round #38. (Разбор задачи D) | 1800 | |
542 | Vasya the Architect | implementation | Statement | D | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | 2000 | ||
395 | Smart Boy | dp games strings | Statement | F | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | Школьная индивидуальная олимпиада #1 - Codeforces Beta Round #38. (Разбор задачи D) | 2200 | |
712 | Queue | data structures | Statement | G | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | 2300 | ||
314 | The Great Marathon | dp | Statement | H | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | 2500 | ||
21885 | Army | implementation | Statement | A | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | Школьная индивидуальная олимпиада #1 - Codeforces Beta Round #38. (Разбор задачи D) | 900 | |
4070 | Cubical Planet | math | Statement | D | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Problem K Tutorial | 1100 | |
2716 | Company Income Growth | greedy | Statement | B | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | 1200 | ||
1602 | Pacifist frogs | implementation | Statement | F | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | 1300 | ||
2802 | Multiplication Table | implementation | Statement | H | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Problem K Tutorial | 1300 | |
3044 | Spelling Check | hashing implementation strings | Statement | J | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Problem K Tutorial | 1600 | |
890 | What Has Dirichlet Got to Do with That? | dp games | Statement | E | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Problem K Tutorial | 2100 | |
717 | C*++ Calculations | expression parsing greedy | Statement | A | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | 2100 | ||
613 | Moon Craters | dp sortings | Statement | C | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | 2300 | ||
130 | Inverse Function | implementation | Statement | G | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Problem K Tutorial | 2500 | |
144 | Tram | Statement | I | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | 2700 | |||
86 | Testing | Statement | K | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Problem K Tutorial | 2700 | ||
4097 | Find Color | constructive algorithms geometry implementation math | Statement | A | Codeforces Beta Round 39 {40} | PROGRAMMING | codeforces #39 | 1300 | |
1189 | Repaintings | math | Statement | B | Codeforces Beta Round 39 {40} | PROGRAMMING | codeforces #39 | 1600 | |
256 | Berland Square | implementation math | Statement | C | Codeforces Beta Round 39 {40} | PROGRAMMING | codeforces #39 | 2200 | |
688 | Number Table | combinatorics | Statement | E | Codeforces Beta Round 39 {40} | PROGRAMMING | 2500 | ||
143 | Interesting Sequence | math | Statement | D | Codeforces Beta Round 39 {40} | PROGRAMMING | 2600 |