Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
1750-D Count GCD
combinatorics math number theory
1800
1750-C Complementary XOR
constructive algorithms implementation
1400
1750-B Maximum Substring
brute force greedy implementation
800
1750-A Indirect Sort
constructive algorithms implementation math
800
1749-F Distance to the Path
data structures dfs and similar trees
2800
1749-E Cactus Wall
constructive algorithms dfs and similar graphs +1
2400
1749-D Counting Arrays
combinatorics dp math +1
1900
1749-C Number Game
binary search data structures games +2
1400
1749-B Death's Blessing
greedy
900
1749-A Cowardly Rooks
greedy implementation
800
1748-F Circular Xor Reversal
bitmasks constructive algorithms
3000
1748-E Yet Another Array Counting Problem
binary search data structures divide and conquer +4
2300
1748-D ConstructOR
bitmasks chinese remainder theorem combinatorics +3
2100
1748-C Zero-Sum Prefixes
brute force data structures dp +2
1600
1748-B Diverse Substrings
brute force implementation strings
1400
1748-A The Ultimate Square
math
800
1747-E List Generation
combinatorics dp math
2900
1747-D Yet Another Problem
binary search bitmasks constructive algorithms +1
1900
1747-C Swap Game
games
1200
1747-B BAN BAN
constructive algorithms
900
1747-A Two Groups
constructive algorithms greedy
800
1746-G Olympiad Training
binary search data structures dp +4
3500
1746-F Kazaee
data structures hashing probabilities
2800
1746-E2 Joking (Hard Version)
dp interactive
3200
1746-E1 Joking (Easy Version)
binary search constructive algorithms interactive +1
2500
1746-D Paths on the Tree
dfs and similar dp greedy +2
1900
1746-C Permutation Operations
constructive algorithms greedy implementation +1
1300
1746-B Rebellion
constructive algorithms greedy two pointers
800
1746-A Maxmina
constructive algorithms greedy
800
1744-F MEX vs MED
math two pointers
2000
1744-E2 Divisible Numbers (hard version)
brute force math number theory
1900
1744-E1 Divisible Numbers (easy version)
brute force math number theory
1500
1744-D Divisibility by 2^n
greedy math sortings
1200
1744-C Traffic Light
binary search implementation two pointers
1000
1744-B Even-Odd Increments
implementation math
800
1744-A Number Replacement
greedy implementation
800
1743-G Antifibonacci Cut
bitmasks combinatorics constructive algorithms +4
3000
1743-F Intersection and Union
data structures dp matrices +1
2300
1743-E FTL
binary search dp
2400
1743-D Problem with Random Tests
brute force dp greedy +1
1700
1743-C Save the Magazines
constructive algorithms dp greedy
1100
1743-B Permutation Value
constructive algorithms greedy
800
1743-A Password
brute force combinatorics implementation +1
800
1742-G Orray
bitmasks brute force greedy +2
1500
1742-F Smaller
constructive algorithms greedy strings
1500
1742-E Scuza
binary search greedy math
1200
1742-D Coprime
brute force greedy number theory
1100
1742-C Stripes
implementation
900
1742-B Increasing
greedy implementation sortings
800
1742-A Sum
implementation
800