human
Ways to represent a number as a sum of 1 ' s ▁ and ▁ 2' s | Function to multiply matrix ..
Power function in log n.
function that returns ( n + 1 ) th Fibonacci number Or number of ways to represent n as sum of 1 ' s ▁ 2' s.
Driver Code"
How can the above be solved in Python?
 Can you provide a code to ways to represent a number as a sum of 1 ' s ▁ and ▁ 2' s and the other steps required?
assistant
#Here is code to ways to represent a number as a sum of 1 ' s ▁ and ▁ 2' s and the other steps required.
 def multiply ( F , M ) :
	x = F [ 0 ] [ 0 ] * M [ 0 ] [ 0 ] + F [ 0 ] [ 1 ] * M [ 1 ] [ 0 ]
	y = F [ 0 ] [ 0 ] * M [ 0 ] [ 1 ] + F [ 0 ] [ 1 ] * M [ 1 ] [ 1 ]
	z = F [ 1 ] [ 0 ] * M [ 0 ] [ 0 ] + F [ 1 ] [ 1 ] * M [ 1 ] [ 0 ]
	w = F [ 1 ] [ 0 ] * M [ 0 ] [ 1 ] + F [ 1 ] [ 1 ] * M [ 1 ] [ 1 ]
	F [ 0 ] [ 0 ] = x
	F [ 0 ] [ 1 ] = y
	F [ 1 ] [ 0 ] = z
	F [ 1 ] [ 1 ] = w
def power ( F , n ) :
	if ( n == 0 or n == 1 ) :
		return
	M = [ [ 1 , 1 ] , [ 1 , 0 ] ]
	power ( F , n // 2 )
	multiply ( F , F )
	if ( n % 2 != 0 ) :
		multiply ( F , M )
def countWays ( n ) :
	F = [ [ 1 , 1 ] , [ 1 , 0 ] ]
	if ( n == 0 ) :
		return 0
	power ( F , n )
	return F [ 0 ] [ 0 ]
n = 5
print ( countWays ( n ) )