CSES Problem Set
Η συλλογή του cses.fi: 400 προβλήματα, από τα εισαγωγικά μέχρι τα προχωρημένα. Η σειρά μέσα σε κάθε κατηγορία είναι αυτή του CSES.
Σημείωσε εδώ τι έλυσες· η κατάσταση μένει μόνο σε αυτόν τον browser. Το κουμπί αλλάζει: κενό → προσπάθησα → λύθηκε. Οι υποβολές γίνονται στο cses.fi.
Introductory Problems
- Weird Algorithm
- Missing Number
- Repetitions
- Increasing Array
- Permutations
- Number Spiral
- Two Knights
- Two Sets
- Bit Strings
- Trailing Zeros
- Coin Piles
- Palindrome Reorder
- Gray Code
- Tower of Hanoi
- Creating Strings
- Apple Division
- Chessboard and Queens
- Raab Game I
- Mex Grid Construction
- Knight Moves Grid
- Grid Coloring I
- Digit Queries
- String Reorder
- Grid Path Description
Sorting and Searching
- Distinct Numbers
- Apartments
- Ferris Wheel
- Concert Tickets
- Restaurant Customers
- Movie Festival
- Sum of Two Values
- Maximum Subarray Sum
- Stick Lengths
- Missing Coin Sum
- Collecting Numbers
- Collecting Numbers II
- Playlist
- Towers
- Traffic Lights
- Distinct Values Subarrays
- Distinct Values Subsequences
- Josephus Problem I
- Josephus Problem II
- Nested Ranges Check
- Nested Ranges Count
- Room Allocation
- Factory Machines Δυαδική αναζήτηση στην απάντηση
- Tasks and Deadlines
- Reading Books
- Sum of Three Values
- Sum of Four Values
- Nearest Smaller Values
- Subarray Sums I
- Subarray Sums II Αθροίσματα προθεμάτων
- Subarray Divisibility Αθροίσματα προθεμάτων
- Distinct Values Subarrays II
- Array Division Δυαδική αναζήτηση στην απάντηση
- Movie Festival II
- Maximum Subarray Sum II
Dynamic Programming
- Dice Combinations
- Minimizing Coins
- Coin Combinations I
- Coin Combinations II
- Removing Digits
- Grid Paths I
- Book Shop
- Array Description
- Counting Towers
- Edit Distance
- Longest Common Subsequence
- Rectangle Cutting
- Minimal Grid Path
- Money Sums
- Removal Game
- Two Sets II
- Mountain Range
- Increasing Subsequence Μέγιστη αύξουσα υπακολουθία
- Projects
- Elevator Rides
- Counting Tilings
- Counting Numbers
- Increasing Subsequence II
Graph Algorithms
- Counting Rooms BFS και 0-1 BFS
- Labyrinth BFS και 0-1 BFS
- Building Roads Ένωση ξένων συνόλων (DSU)
- Message Route BFS και 0-1 BFS
- Building Teams BFS και 0-1 BFS
- Round Trip
- Monsters
- Shortest Routes I Dijkstra
- Shortest Routes II
- High Score
- Flight Discount Dijkstra
- Cycle Finding
- Flight Routes
- Round Trip II
- Course Schedule Τοπολογική ταξινόμηση
- Longest Flight Route Τοπολογική ταξινόμηση
- Game Routes Τοπολογική ταξινόμηση
- Investigation Dijkstra
- Planets Queries I
- Planets Queries II
- Planets Cycles
- Road Reparation Ελάχιστο συνδετικό δέντρο (Kruskal)
- Road Construction Ένωση ξένων συνόλων (DSU)
- Flight Routes Check Ισχυρά συνεκτικές συνιστώσες
- Planets and Kingdoms Ισχυρά συνεκτικές συνιστώσες
- Giant Pizza Ισχυρά συνεκτικές συνιστώσες
- Coin Collector
- Mail Delivery
- De Bruijn Sequence
- Teleporters Path
- Hamiltonian Flights
- Knight's Tour
- Download Speed Μέγιστη ροή (Dinic)
- Police Chase Μέγιστη ροή (Dinic)
- School Dance Μέγιστη ροή (Dinic)
- Distinct Routes Μέγιστη ροή (Dinic)
Range Queries
- Static Range Sum Queries Αθροίσματα προθεμάτων
- Static Range Minimum Queries Sparse table
- Dynamic Range Sum Queries Δέντρο Fenwick
- Dynamic Range Minimum Queries Δέντρο διαστημάτων (segment tree)
- Range Xor Queries
- Range Update Queries Δέντρο Fenwick
- Forest Queries Αθροίσματα προθεμάτων
- Hotel Queries Δέντρο διαστημάτων (segment tree)
- List Removals
- Salary Queries Δέντρο Fenwick
- Prefix Sum Queries
- Pizzeria Queries
- Visible Buildings Queries
- Range Interval Queries
- Subarray Sum Queries Δέντρο διαστημάτων (segment tree)
- Subarray Sum Queries II
- Distinct Values Queries
- Distinct Values Queries II
- Increasing Array Queries
- Movie Festival Queries
- Forest Queries II
- Range Updates and Sums Δέντρο διαστημάτων (segment tree)
- Polynomial Queries
- Range Queries and Copies
- Missing Coin Sum Queries
Tree Algorithms
- Subordinates
- Tree Matching
- Tree Diameter
- Tree Distances I
- Tree Distances II
- Company Queries I Ελάχιστος κοινός πρόγονος (binary lifting)
- Company Queries II Ελάχιστος κοινός πρόγονος (binary lifting)
- Distance Queries Ελάχιστος κοινός πρόγονος (binary lifting)
- Counting Paths
- Subtree Queries
- Path Queries
- Path Queries II
- Distinct Colors
- Finding a Centroid
- Fixed-Length Paths I
- Fixed-Length Paths II
Mathematics
- Josephus Queries
- Exponentiation Αριθμητική modulo και συνδυαστική
- Exponentiation II Αριθμητική modulo και συνδυαστική
- Counting Divisors Γραμμικό κόσκινο
- Common Divisors Γραμμικό κόσκινο
- Sum of Divisors
- Divisor Analysis
- Prime Multiples
- Counting Coprime Pairs
- Next Prime
- Binomial Coefficients Αριθμητική modulo και συνδυαστική
- Creating Strings II Αριθμητική modulo και συνδυαστική
- Distributing Apples Αριθμητική modulo και συνδυαστική
- Christmas Party
- Permutation Order
- Permutation Rounds
- Bracket Sequences I
- Bracket Sequences II
- Counting Necklaces
- Counting Grids
- Fibonacci Numbers
- Throwing Dice
- Graph Paths I
- Graph Paths II
- System of Linear Equations
- Sum of Four Squares
- Triangle Number Sums
- Dice Probability
- Moving Robots
- Candy Lottery
- Inversion Probability
- Stick Game
- Nim Game I
- Nim Game II
- Stair Game
- Grundy's Game
- Another Game
String Algorithms
- Word Combinations
- String Matching Συνάρτηση προθέματος (KMP) Z-function Hashing συμβολοσειρών
- Finding Borders Συνάρτηση προθέματος (KMP)
- Finding Periods
- Minimal Rotation
- Longest Palindrome Hashing συμβολοσειρών
- All Palindromes
- Required Substring
- Palindrome Queries
- Finding Patterns
- Counting Patterns
- Pattern Positions
- Distinct Substrings
- Distinct Subsequences
- Repeating Substring
- String Functions Συνάρτηση προθέματος (KMP) Z-function
- Inverse Suffix Array
- String Transform
- Substring Order I
- Substring Order II
- Substring Distribution
Geometry
- Point Location Test
- Line Segment Intersection
- Polygon Area
- Point in Polygon
- Polygon Lattice Points
- Minimum Euclidean Distance
- Convex Hull
- Maximum Manhattan Distances
- All Manhattan Distances
- Intersection Points
- Line Segments Trace I
- Line Segments Trace II
- Lines and Queries I
- Lines and Queries II
- Area of Rectangles
- Robot Path
Advanced Techniques
- Meet in the Middle
- Hamming Distance
- Corner Subgrid Check
- Corner Subgrid Count
- Reachable Nodes
- Reachability Queries
- Cut and Paste
- Substring Reversals
- Reversals and Sums
- Necessary Roads
- Necessary Cities
- Eulerian Subgraphs
- Monster Game I
- Monster Game II
- Subarray Squares
- Houses and Schools
- Knuth Division
- Apples and Bananas
- One Bit Positions
- Signal Processing
- New Roads Queries
- Dynamic Connectivity
- Parcel Delivery
- Task Assignment
- Distinct Routes II
Sliding Window Problems
Interactive Problems
Bitwise Operations
Construction Problems
Advanced Graph Problems
- Nearest Shops
- Prüfer Code
- Tree Traversals
- Course Schedule II
- Acyclic Graph Edges
- Strongly Connected Edges
- Even Outdegree Edges
- Graph Girth
- Fixed Length Walk Queries
- Transfer Speeds Sum
- MST Edge Check
- MST Edge Set Check
- MST Edge Cost
- Network Breakdown
- Tree Coin Collecting I
- Tree Coin Collecting II
- Tree Isomorphism I
- Tree Isomorphism II
- Flight Route Requests
- Critical Cities
- Visiting Cities
- Graph Coloring
- Bus Companies
- Split into Two Paths
- Network Renovation
- Forbidden Cities
- Creating Offices
- New Flight Routes
Counting Problems
- Filled Subgrid Count I
- Filled Subgrid Count II
- All Letter Subgrid Count I
- All Letter Subgrid Count II
- Border Subgrid Count I
- Border Subgrid Count II
- Raab Game II
- Empty String
- Permutation Inversions
- Counting Bishops
- Counting Sequences
- Grid Paths II
- Counting Permutations
- Grid Completion
- Counting Reorders
- Tournament Graph Distribution
- Collecting Numbers Distribution
- Functional Graph Distribution
Additional Problems I
- Shortest Subsequence
- Distinct Values Sum
- Distinct Values Splits
- Swap Game
- Beautiful Permutation II
- Multiplication Table Δυαδική αναζήτηση στην απάντηση
- Bubble Sort Rounds I
- Bubble Sort Rounds II
- Nearest Campsites I
- Nearest Campsites II
- Advertisement
- Special Substrings
- Counting LCM Arrays
- Square Subsets
- Subarray Sum Constraints
- Water Containers Moves
- Water Containers Queries
- Stack Weights
- Maximum Average Subarrays
- Subsets with Fixed Average
- Two Array Average
- Pyramid Array
- Permutation Subsequence
- Bit Inversions
- Writing Numbers
- Letter Pair Move Game
- Maximum Building I
- Sorting Methods
- Cyclic Array
- List of Sums
Additional Problems II
- Bouncing Ball Steps
- Bouncing Ball Cycle
- Knight Moves Queries
- K Subset Sums I
- K Subset Sums II
- Increasing Array II
- Food Division
- Swap Round Sorting
- Binary Subsequences
- School Excursion
- Coin Grid
- Grid Coloring II
- Programmers and Artists
- Removing Digits II
- Coin Arrangement
- Replace with Difference
- Grid Puzzle I
- Grid Puzzle II
- Bit Substrings
- Reversal Sorting
- Book Shop II
- GCD Subsets
- Minimum Cost Pairs
- Same Sum Subsets
- Mex Grid Queries
- Maximum Building II
- Stick Divisions
- Stick Difference
- Coding Company
- Two Stacks Sorting
Κατάλογος από το cses.fi/problemset, όπως ήταν στις 2026-11-18.