Same bro, same

(I apologize for not knowing latex, so I hope the explanation is clear regardless)

The core idea is a double pigeonhole principle, so let’s split up the game into two steps

1. rows(a) -> Give each column a height(denoted as n), such that no matter how Harshith decides to color the n cells w/ the k colors, there must be a color that appears a times in the column. This helps us arrive at the result n = k(a-1)+1. Now let's denote the maximum occurring color in each column as c, and we can produce a "row list" for each column such that rows {r1, r2, …., ra} contains c.
2. columns(b) -> Now that we know the # of rows, let’s consider columns, however now we need to consider 2 pieces of information. First, what color holds the majority, and which of the a rows of column i were used. We know there are k choices of color, and n choose a choices for the row list, so there are k*(n choose a) distinct possibilities for the 2 pieces of information we need(majority, row list). So with the pigeonhole principle yet again, we arrive at the conclusion m = (b-1)*(k*(n choose a))+1

Feel free to ask if you have questions!

broo , i respect the new talend genration i asked her how you are able to solve them then she replied she has used chatgpt and yeeaah i guess problem where easily ai solvable and she has rank under 200. Now i can think the probable reason for seeing newbie in high ranks is that must have used chatgpt and also in India placement/intern season is coming thats why people are just focusing on increasing there rating to write in resume and they must have used chat gpt