human
Count of m digit integers that are divisible by an integer n | Returns count of m digit numbers having n as divisor.
Generating largest number of m digit.
Generating largest number of m - 1 digit.
returning number of dividend.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to count of m digit integers that are divisible by an integer n and the other steps required.
 def findCount ( m , n ) :
	num1 = 0
	for i in range ( 0 , m ) :
		num1 = ( num1 * 10 ) + 9
	num2 = 0
	for i in range ( 0 , ( m - 1 ) ) :
		num2 = ( num2 * 10 ) + 9
	return int ( ( num1 / n ) - ( num2 / n ) )
m = 2 ; n = 6
print ( findCount ( m , n ) )