Problems
Number of paths#3643
Very easy · Graphs
Rectangular Field#3644
Easy · Graph network flows · Graphs
Tiling#3645
Very easy · Brute force · Implementation · Graphs
Cost of removal#3646
Easy · Graphs
Sea Voyage#3647
Easy · Graphs
Sequence#3648
Easy · Number theory
Disorder#3649
Very easy · Dynamic programming · Combinatorics
How many different?#3650
Very easy · Bitmasks · Brute force
Digit-wise modulo 3#3651
Very easy · Strings · Bitwise Operations
How many prefixes?#3652
Very easy · Dynamic programming · Combinatorics
Ambiguity by Fibonacci#3653
Very easy · Dynamic programming
Without reciprocity#3654
Very easy · Strings · Brute force
Pairs#3655
Very easy · Math
Effectiveness of Permutations#3656
Easy · Combinatorics
Elbow feeling#3657
Very easy · Implementation
Multiplication of Polynomials#3658
Very easy · Implementation
Maximum number#3659
Easy · Greedy algorithms
Railway Tickets#3661
Very easy · Dynamic programming
Divisors of the number N! modulo#3662
Easy · Math
Help system#3663
Very easy · Implementation
Optimal Partition#3664
Easy · Probabilities
K-angulation#3665
Very hard · Dynamic programming
Balancing the Matrix#3666
Very hard · Dynamic programming
Lottery#3667
Very hard · Probabilities
Domino#3668
Easy · Brute force · Implementation