Recently, while upsolving Problem 4 from the Div 2 Contest 959, I encountered an intriguing concept called the Pigeonhole Principle. Although initially unfamiliar with this principle, I found it fascinating and wanted to share my newfound knowledge with the community.↵
↵
Pigeonhole Principle states that,↵
If we have n pigeons and m holes, and ifm>nn>m, then there will be at least one hole where more than one pigeons will be present.↵
↵
While this statement might appear straightforward, its can be used in many of the complex problems.↵
↵
Here are some problems which uses Pigeonhole Principle:-↵
↵
1) https://www.codechef.com/problems/GRAYSC↵
↵
2) https://www.geeksforgeeks.org/discrete-mathematics-the-pigeonhole-principle/↵
↵
You must try this!↵
↵
Happy coding!↵
↵
[cut]↵
↵
↵
↵
↵
Pigeonhole Principle states that,↵
If we have n pigeons and m holes, and if
↵
While this statement might appear straightforward, its can be used in many of the complex problems.↵
↵
Here are some problems which uses Pigeonhole Principle:-↵
↵
1) https://www.codechef.com/problems/GRAYSC↵
↵
2) https://www.geeksforgeeks.org/discrete-mathematics-the-pigeonhole-principle/↵
↵
You must try this!↵
↵
Happy coding!↵
↵
[cut]↵
↵
↵
↵
