Plzz explain the question with more details . ism unsble to understand the question
Class Assignment
hello @Pramod123,
here in this problem u need to tell the number of ways to form n digit number using 2 digits a and b such that no two b comes together/consecutive.
example ->
if n=1 then ways will be 2 i,e {a , b}
if n=2 then ways will be 3 i,e {aa , ab , ba} (see bb is not their in the answer because it voilates the constraints)
all test cases getting failed
a)
![]()
here it should be the number of testcase .
b) answer can exceed range of int so use long long for count variable.