human
Can you provide a code to all possible numbers of N digits and base B without leading zeros and the other steps required given the following:
All possible numbers of N digits and base B without leading zeros | function to count all permutations.
count of all permutations.
count of permutations with leading zeros.
Return the permutations without leading zeros.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to all possible numbers of N digits and base B without leading zeros and the other steps required.
 def countPermutations ( N , B ) :
	x = B ** N
	y = B ** ( N - 1 )
	print ( x - y )
if __name__ == " _ _ main _ _ " :
	N , B = 6 , 4
	countPermutations ( N , B )