Blaðra

Question

Solution

Idea

The idea for this problem is rather easy and it utilises linear search. We just need to build a frequency table to store the times each problem has been solved. And then find the minimum number of times.

Note that a small point to accelerate is that if you find a 0 in your frequency table, you can safely state that the minimum is 0 and don't need to search the remaining.

Code

https://github.com/mendax1234/Coding-Problems/blob/main/kattis/bladra/bladra.c

Last updated