ICLFIN02 - Editorial

editorial
, ,
1

PROBLEM LINK:

Contest link: ICLFIN02

Author

Sourabh Bansal

Tester

Shubham Gupta

DIFFICULTY:

Cakewalk

PREREQUISITES:

None

PROBLEM:

You need to find the maximum occuring number and its occurance value.
If 2 or more such denominations are possible then print the denomination having the smallest denomination.

PROBLEM SETTER’s SOLUTION:

http://ideone.com/3ZrVDQ