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 ... 59 60 61 62 63 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1882 | Quantifier Question | dfs and similar dp graphs math | Statement | C | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1500.0 | Codeforces Round #639 Editorial | 2600 |
| 1193 | Résumé Review | binary search greedy math | Statement | D | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1750.0 | Codeforces Round #639 Editorial | 2700 |
| 469 | Train Tracks | data structures trees | Statement | E | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 2500.0 | Codeforces Round #639 Editorial | 3100 |
| 457 | Piet's Palette | matrices | Statement | F | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 2500.0 | Codeforces Round #639 Editorial | 3200 |
| 26901 | Card Constructions | binary search brute force dp math | Statement | B | Codeforces Round 639 (Div. 2) {1345} | PROGRAMMING | 1000.0 | Codeforces Round #639 Editorial | 1100 |
| 24350 | Puzzle Pieces | math | Statement | A | Codeforces Round 639 (Div. 2) {1345} | PROGRAMMING | 500.0 | Codeforces Round #639 Editorial | 800 |
| 2066 | Color Revolution | *special math | Statement | A | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1000 | |
| 1218 | Boot Camp | *special greedy | Statement | B | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1400 | |
| 613 | Spring Cleaning | *special greedy sortings | Statement | C | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1600 | |
| 516 | Constructing the Dungeon | *special graphs greedy | Statement | D | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1600 | |
| 383 | Magic Tricks | *special dp graphs | Statement | E | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1700 | |
| 232 | Dune II: Battle For Arrakis | *special data structures greedy math | Statement | F | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2000 | |
| 137 | Two IP Cameras | *special math number theory | Statement | G | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2300 | |
| 51 | Game with Segments | *special data structures games | Statement | H | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2700 | |
| 50 | Pac-Man 2.0 | *special dp | Statement | I | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2900 | |
| 25760 | Phoenix and Beauty | constructive algorithms data structures greedy | Statement | B | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 1000.0 | Codeforces Round #638 (Div. 2) Editorial | 1400 |
| 14769 | Phoenix and Distribution | constructive algorithms greedy strings | Statement | C | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 1500.0 | Codeforces Round #638 (Div. 2) Editorial | 1600 |
| 8964 | Phoenix and Science | binary search bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 2000.0 | Codeforces Round #638 (Div. 2) Editorial | 1900 |
| 2265 | Phoenix and Berries | dp greedy | Statement | E | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 2500.0 | Codeforces Round #638 (Div. 2) Editorial | 2400 |
| 829 | Phoenix and Memory | data structures dfs and similar graphs greedy | Statement | F | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 3000.0 | Codeforces Round #638 (Div. 2) Editorial | 2600 |
| 40067 | Phoenix and Balance | greedy math | Statement | A | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 500.0 | Codeforces Round #638 (Div. 2) Editorial | 800 |
| 17730 | Orac and LCM | data structures math number theory | Statement | A | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 500.0 | Codeforces Round #641 Editorial | 1600 |
| 8277 | Orac and Medians | constructive algorithms greedy math | Statement | B | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1250.0 | Codeforces Round #641 Editorial | 2000 |
| 4577 | Orac and Game of Life | dfs and similar graphs implementation shortest paths | Statement | C | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1250.0 | Codeforces Round #641 Editorial | 2000 |
| 455 | Slime and Sequences (Easy Version) | dp fft math | Statement | F1 | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1750.0 | Codeforces Round #641 Editorial | 3100 |
| 931 | Slime and Biscuits | math probabilities | Statement | D | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 2000.0 | Codeforces Round #641 Editorial | 3200 |
| 115 | Slime and Sequences (Hard Version) | dp fft math | Statement | F2 | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1750.0 | Codeforces Round #641 Editorial | 3500 |
| 93 | Slime and Hats | constructive algorithms dp greedy | Statement | E | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 2500.0 | Codeforces Round #641 Editorial | 3500 |
| 23281 | Orac and Models | dp math number theory | Statement | B | Codeforces Round 641 (Div. 2) {1350} | PROGRAMMING | 1000.0 | Codeforces Round #641 Editorial | 1400 |
| 26279 | Orac and Factors | math | Statement | A | Codeforces Round 641 (Div. 2) {1350} | PROGRAMMING | 500.0 | Codeforces Round #641 Editorial | 900 |
| 8714 | Skier | data structures implementation | Statement | C | Testing Round 16 (Unrated) {1351} | PROGRAMMING | 1500.0 | 1400 | |
| 24482 | A+B (Trial Problem) | implementation | Statement | A | Testing Round 16 (Unrated) {1351} | PROGRAMMING | 500.0 | 800 | |
| 17248 | Square? | brute force implementation math | Statement | B | Testing Round 16 (Unrated) {1351} | PROGRAMMING | 1000.0 | 900 | |
| 38788 | Same Parity Summands | constructive algorithms math | Statement | B | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1200 | |
| 57454 | K-th Not Divisible by n | binary search math | Statement | C | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1200 | |
| 26895 | Alice, Bob and Candies | implementation | Statement | D | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1300 | |
| 21155 | Special Elements | brute force implementation two pointers | Statement | E | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1500 | |
| 17651 | Binary String Reconstruction | constructive algorithms dfs and similar math | Statement | F | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1500 | |
| 21952 | Special Permutation | constructive algorithms | Statement | G | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1600 | |
| 83905 | Sum of Round Numbers | implementation math | Statement | A | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 800 | |
| 36030 | Board Moves | math | Statement | C | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1000 | |
| 18445 | Constructing the Array | constructive algorithms data structures sortings | Statement | D | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1600 | |
| 7284 | K-periodic Garland | brute force dp greedy | Statement | E | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1900 | |
| 3388 | Decreasing Heights | brute force dp | Statement | F | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 2200 | |
| 50974 | Two Arrays And Swaps | greedy sortings | Statement | B | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 800 | |
| 41602 | Most Unstable Array | constructive algorithms greedy math | Statement | A | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 800 | |
| 31670 | Ternary String | binary search dp implementation two pointers | Statement | B | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1200 | |
| 15886 | Simple Polygon Embedding | binary search geometry math ternary search | Statement | C1 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1400 | |
| 9026 | Multiset | binary search data structures | Statement | D | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1900 | |
| 6134 | Not So Simple Polygon Embedding | binary search brute force geometry math | Statement | C2 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2000 | |
| 3424 | Graph Coloring | dfs and similar dp graphs | Statement | E | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2100 | |
| 1246 | Summoning Minions | constructive algorithms dp flows graph matchings greedy sortings | Statement | F | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2500 | |
| 808 | Find a Gift | binary search interactive probabilities | Statement | G | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2600 | |
| 24030 | Alarm Clock | math | Statement | A | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 900 | |
| 26036 | Young Explorers | dp greedy sortings | Statement | B | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 750.0 | Codeforces Round #643 (Div. 2) Editorial | 1200 |
| 27007 | Sequence with Digits | brute force implementation math | Statement | A | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 750.0 | Codeforces Round #643 (Div. 2) Editorial | 1200 |
| 18232 | Game With Array | constructive algorithms math | Statement | D | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 1500.0 | Codeforces Round #643 (Div. 2) Editorial | 1400 |
| 10829 | Count Triangles | binary search implementation math two pointers | Statement | C | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 1250.0 | Codeforces Round #643 (Div. 2) Editorial | 1800 |
| 5261 | Restorer Distance | binary search greedy math sortings ternary search | Statement | E | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 2000.0 | Codeforces Round #643 (Div. 2) Editorial | 2100 |
| 881 | Guess Divisors Count | constructive algorithms interactive number theory | Statement | F | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 3000.0 | Codeforces Round #643 (Div. 2) Editorial | 2600 |
| 128 | Quantum Classification - 2 | *special | Statement | D2 | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 137 | Quantum Classification - 1 | *special | Statement | D1 | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 303 | Prepare state |01⟩ + |10⟩ + |11⟩ | *special | Statement | C | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 283 | Increment | *special | Statement | B1 | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 331 | Distinguish Z from -Z | *special | Statement | A5 | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 461 | Distinguish Z from S | *special | Statement | A3 | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 459 | Distinguish I ⊗ X from CNOT | *special | Statement | A4 | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 488 | Distinguish I from Z | *special | Statement | A2 | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 603 | Distinguish I from X | *special | Statement | A1 | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 283 | Decrement | *special | Statement | B2 | Microsoft Q# Coding Contest - Summer 2020 - Warmup {1356} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020 — Warmup: editorial | ||
| 51 | Root of quantum Fourier transform | Statement | E2 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 82 | Quantum Classification - Dataset 7 | Statement | D5 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 85 | Quantum Classification - Dataset 6 | Statement | D4 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 105 | Quantum Classification - Dataset 5 | Statement | D3 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 112 | Quantum Classification - Dataset 4 | Statement | D2 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 125 | Quantum Classification - Dataset 3 | Statement | D1 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 304 | Prepare superposition of basis states with the same parity | Statement | C2 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 348 | Prepare superposition of basis states with 0s | Statement | C1 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 193 | Power of quantum Fourier transform | Statement | E1 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 214 | "Is the number divisible by 3?" oracle | Statement | B2 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 214 | "Is the bit string balanced?" oracle | Statement | B1 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 632 | Figure out direction of CNOT | Statement | A1 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 183 | Distinguish Y, XZ, -Y and -XZ | Statement | A7 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 241 | Distinguish Rz(θ) from Ry(θ) | Statement | A5 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 352 | Distinguish Rz from R1 | Statement | A4 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 511 | Distinguish I, CNOTs and SWAP | Statement | A2 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 479 | Distinguish H from X | Statement | A3 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 168 | Distinguish four Pauli gates | Statement | A6 | Microsoft Q# Coding Contest - Summer 2020 {1357} | PROGRAMMING | Microsoft Q# Coding Contest – Summer 2020: editorial | |||
| 25104 | Maria Breaks the Self-isolation | greedy sortings | Statement | B | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 750.0 | Codeforces Round #645 (Div. 2) Editorial | 1000 |
| 17588 | Celex Update | math | Statement | C | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 1500.0 | Codeforces Round #645 (Div. 2) Editorial | 1600 |
| 8294 | The Best Vacation | binary search brute force greedy implementation two pointers | Statement | D | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 1500.0 | Codeforces Round #645 (Div. 2) Editorial | 1900 |
| 2352 | Are You Fired? | constructive algorithms data structures dp greedy implementation | Statement | E | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 2000.0 | Codeforces Round #645 (Div. 2) Editorial | 2400 |
| 466 | Tasty Cookie | binary search constructive algorithms greedy implementation | Statement | F | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 2500.0 | Codeforces Round #645 (Div. 2) Editorial | 2700 |
| 40166 | Park Lighting | math | Statement | A | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 500.0 | Codeforces Round #645 (Div. 2) Editorial | 800 |
| 28094 | New Theatre Square | brute force dp greedy implementation two pointers | Statement | B | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1000 | |
| 30018 | Berland Poker | brute force greedy math | Statement | A | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1000 | |
| 14068 | Mixing Water | binary search math | Statement | C | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1700 | |
| 9683 | Yet Another Yet Another Task | data structures dp implementation two pointers | Statement | D | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2000 | |
| 6204 | Modular Stability | combinatorics math number theory | Statement | E | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2000 | |
| 546 | RC Kaboom Show | binary search brute force data structures geometry math | Statement | F | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2900 |