Codeforces

• Contests
  • Codeforces Alpha Round 20 (Codeforces format)
    • C. Dijkstra?
      • Code : Dijkstra?
  • Codeforces Round 257 (Div. 1)
    • B. Jzzhu and Cities
      • Code : Jzzhu and Cities
  • Codeforces Round 321 (Div. 2)
    • C. Kefa and Park
      • C. Kefa and Park
  • Educational Codeforces Round 2
    • C. Make Palindrome
      • Testcases :Make Palindrome
      • Code : Make Palindrome
  • Educational Codeforces Round 23
    • D. Imbalanced Array
      • Code : Imbalanced Array
  • Educational Codeforces Round 25
    • E. Minimal Labels
      • Hints: Minimal Labels
      • Code : Minimal Labels
  • Codeforces Round 506 (Div. 3)
    • D. Concatenated Multiples
      • Code : Concatenated Multiples
  • Codeforces Round 531 (Div. 3)
    • E. Monotonic Renumeration
      • Hints: Monotonic Renumeration
      • Code : Monotonic Renumeration
  • Educational Codeforces Round 61 (Rated for Div. 2)
    • F. Clear the String
      • Testcases : Clear the String
      • Hints: Clear the String
      • Code : Clear the String
  • Educational Codeforces Round 66 (Rated for Div. 2)
    • D. Array Splitting
      • Hints: Array Splitting
      • Code : Array Splitting
  • Codeforces Round 570 (Div. 3)
    • H. Subsequences (hard version)
      • Code : Subsequences (hard version)
  • Codeforces Round 578 (Div. 2)
    • E. Compress Words
      • Code : Compress Words
  • Codeforces Round 615 (Div. 3)
    • F. Three Paths on a Tree
      • Hints : Three Paths on a Tree
      • Code : Three Paths on a Tree
      • ToDo : Three Paths on a Tree
      • Comments : Three Paths on a Tree
      • Blog : Three Paths on a Tree
  • Codeforces Round 702 (Div. 3)
    • D. Permutation Transformation
      • Code : Permutation Transformation
  • Codeforces Round 723 (Div. 2)
    • C2. Potions (Hard Version)
      • Code : Potions (Hard Version)
  • Codeforces Round 765 (Div. 2)
    • D. Binary Spiders
      • Code : Binary Spiders
  • Codeforces Round 826 (Div. 3)
    • E. Sending a Sequence Over the Network
      • Hints: Sending a Sequence Over the Network
      • Code : Sending a Sequence Over the Network
  • Codeforces Round 828 (Div. 3)
    • D. Divisibility by 2^n
      • Hints: Divisibility by 2^n
      • Code : Divisibility by 2^n
  • Codeforces Round 848 (Div. 2)
    • A. Flip Flop Sum
      • Code : Flip Flop Sum
    • D. Flexible String Revisit
      • Code : Flexible String Revisit
  • Codeforces Round 889 (Div. 1)
    • B. Earn or Unlock
      • Code : Earn or Unlock
  • Educational Codeforces Round 155 (Rated for Div. 2)
    • D. Sum of XOR Functions
      • Code : Sum of XOR Functions
  • Educational Codeforces Round 158 (Rated for Div. 2)
    • A. Line Trip
      • Hints : Line Trip
      • Code : Line Trip
    • B. Chip and Ribbon
      • Testcases : Chip and Ribbon
      • Hints : Chip and Ribbon
      • Code : Chip and Ribbon
    • C. Add, Divide and Floor
      • Testcases : Add, Divide and Floor
      • Hints : Add, Divide and Floor
      • Code : Add, Divide and Floor
    • D. Yet Another Monster Fight
      • Testcases : Yet Another Monster Fight
      • Hints : Yet Another Monster Fight
      • Code : Yet Another Monster Fight
  • Codeforces Round 912 (Div. 2)
    • A. Halloumi Boxes
      • Hints
      • Code
    • B. StORage room
      • Hints
      • Code
    • C. Theofanis' Nightmare
      • Hints
      • Editorial
      • Code
    • D1. Maximum And Queries (easy version)
      • Hints
      • Editorial
      • Code
  • Codeforces Round 915 (Div. 2)
    • B. Begginer's Zelda
      • Code
  • Educational Codeforces Round 160 (Rated for Div. 2)
    • D. Array Collapse
      • Video
      • Editorial
      • Code
  • Good Bye 2023
    • E. Happy Life in University
      • Hints : Happy Life in University
  • Codeforces Round 917 (Div. 2)
    • A. Least Product
      • Code : Least Product
    • B. Erase First or Second Letter
      • Hints : Erase First or Second Letter
      • Code : Erase First or Second Letter
  • Codeforces Round 922 (Div. 2)
    • D. Blocking Elements
      • Code : Blocking Elements
  • Hello 2024
    • E. Counting Prefixes
      • Hints : Counting Prefixes
  • Codeforces Round 919 (Div. 2)
    • E. Counting Binary Strings
      • Code : Counting Binary Strings
      • Editorial : Counting Binary Strings
  • Educational Codeforces Round 162 (Rated for Div. 2)
    • D. Slimes
      • Code : Slimes
    • E. Count Paths
      • Video : Count Paths
      • Code : Count Paths
      • Slides : Count Paths
  • Codeforces Round 928 (Div. 4)
    • G. Vlad and Trouble at MIT
      • Video : Vlad and Trouble at MIT
      • Code : Vlad and Trouble at MIT
      • Slides : Vlad and Trouble at MIT
  • Codeforces Round 924 (Div. 2)
    • E. Modular Sequence
      • Code : Modular Sequence
  • Codeforces Round 926 (Div. 2)
    • D. Sasha and a Walk in the City
      • Hints: Sasha and a Walk in the City
      • Code : Sasha and a Walk in the City
  • Codeforces Round 930 (Div. 2)
    • D. Pinball
      • Code : Pinball
  • Codeforces Round 933 (Div. 3)
    • G. Rudolf and Subway
      • Code : Rudolf and Subway
  • CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!)
    • A. Farmer John's Challenge
      • Code : Farmer John's Challenge
    • B. Bessie and MEX
      • Code : Bessie and MEX
    • D. Learning to Paint
      • Video : Learning to Paint
      • Hints: Learning to Paint
      • Code : Learning to Paint
      • Slides : Learning to Paint
  • Codeforces Round 934 (Div. 2)
    • A. Destroying Bridges
      • Code : Destroying Bridges
    • B. Equal XOR
      • Code : Equal XOR
    • C. MEX Game 1
      • Code : MEX Game 1
    • D. Non-Palindromic Substring
      • Video : Non-Palindromic Substring
      • Code : Non-Palindromic Substring
      • Slides : Non-Palindromic Substring
  • Codeforces Round 935 (Div. 3)
    • H. GCD is Greater
      • Hints: GCD is Greater
      • Code : GCD is Greater
  • Codeforces Round 936 (Div. 2)
    • A. Median of an Array
      • Code : Median of an Array
    • B. Maximum Sum
      • Code : Maximum Sum
    • C. Tree Cutting
      • Hints: Tree Cutting
      • Code : Tree Cutting
    • D. Birthday Gift
      • Video : Birthday Gift
      • Code : Birthday Gift
      • Slides : Birthday Gift
  • Educational Codeforces Round 163 (Rated for Div. 2)
    • F. Rare Coins
      • Code : Rare Coins
  • Codeforces Round 937 (Div. 4)
    • E. Nearly Shortest Repeating Substring
      • Code : Nearly Shortest Repeating Substring
    • G. Shuffling Songs
      • Code : Shuffling Songs
  • Educational Codeforces Round 164 (Rated for Div. 2)
    • D. Colored Balls
      • Editorial : Colored Balls
      • Code : Colored Balls
  • Codeforces Round 938 (Div. 3)
    • G. GCD on a grid
      • Code : GCD on a grid
    • H. The Most Reckless Defense
      • Video : The Most Reckless Defense
      • Code : The Most Reckless Defense
      • Slides : The Most Reckless Defense
  • Codeforces Round 940 (Div. 2) and CodeCraft-23
    • D. A BIT of an Inequality
      • Code : A BIT of an Inequality
  • Codeforces Round 944 (Div. 4)
    • G. XOUR
      • Code : XOUR
  • Codeforces Round 947 (Div. 1 + Div. 2)
    • A. Bazoka and Mocha's Array
      • Code : Bazoka and Mocha's Array
    • B. 378QAQ and Mocha's Array
      • Code : 378QAQ and Mocha's Array
    • C. Chamo and Mocha's Array
      • Hints: Chamo and Mocha's Array
      • Code : Chamo and Mocha's Array
  • Educational Codeforces Round 166 (Rated for Div. 2)
    • D. Invertible Bracket Sequences
      • Code : Invertible Bracket Sequences
  • Codeforces Round 958 (Div. 2)
    • D. The Omnipotent Monster Killer
      • Code : The Omnipotent Monster Killer
    • E. Range Minimum Sum
      • Code : Range Minimum Sum
  • Pinely Round 4 (Div. 1 + Div. 2)
    • C. Absolute Zero
      • Code : Absolute Zero
  • Codeforces Round 963 (Div. 2)
    • D. Med-imize
      • Code : Med-imize
  • Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2)
    • C. Hungry Games
      • Code : Hungry Games
  • Codeforces Round 961 (Div. 2)
    • D. Cases
      • Code : Cases
  • Codeforces Round 962 (Div. 3)
    • G. Penacony
      • Code : Penacony
  • Educational Codeforces Round 168 (Rated for Div. 2)
    • D. Maximize the Root
      • Code : Maximize the Root
  • Codeforces Round 966 (Div. 3)
    • H. Ksyusha and the Loaded Set
      • Editorial : Ksyusha and the Loaded Set
      • Code : Ksyusha and the Loaded Set
  • Codeforces Round 967 (Div. 2)
    • D. Longest Max Min Subsequence
      • Code : D. Longest Max Min Subsequence
    • E1. Deterministic Heap (Easy Version)
      • Editorial : Deterministic Heap (Easy Version)
      • Code : Deterministic Heap (Easy Version)
  • EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2)
    • E. Cosmic Rays
      • Code : Cosmic Rays
  • Codeforces Round 968 (Div. 2)
    • D1. Turtle and a MEX Problem (Easy Version)
      • Code : Turtle and a MEX Problem (Easy Version)
    • D1. Turtle and a MEX Problem (Hard Version)
      • Code : Turtle and a MEX Problem (Hard Version)
  • Educational Codeforces Round 169 (Rated for Div. 2)
    • D. Colored Portals
      • Code : Colored Portals
  • Codeforces Round 969 (Div. 2)
    • D. Iris and Game on the Tree
      • Code : Iris and Game on the Tree
    • E. Iris and the Tree
      • Code : Iris and the Tree
  • Codeforces Round 970 (Div. 3)
    • H. Sakurako's Test
      • Hints: Sakurako's Test
      • Code : Sakurako's Test
  • Codeforces Round 975 (Div. 2)
    • D. Speedbreaker
      • Code : Speedbreaker
  • Codeforces Round 976 (Div. 2) and Divide By Zero 9.0
    • E. Expected Power
      • Code : Expected Power
• Edu
  • Segment Trees
    • E. Earthquakes
      • Code : Earthquakes