text: Function to return the smallest integer > n with digit m occurring exactly k times
code: int findInt ( int n , int m , int k ) { int i = n + 1 ; while ( true ) { if ( digitWell ( i , m , k ) ) return i ; i ++ ; } }