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