Smallest Possible Whole Number CodeChef Solution

Smallest Possible Whole Number CodeChef Solution in C++

Problem You are given two integers   N N  and  K K . You may perform the following operation any number of times (including zero): change  N N  to  N-K N − K , i.e. subtract  K K  from  N N . Find the smallest non-negative intege…

Load More
That is All