COUNT NUMBER OF BINARY STRINGS, Weak test cases?

#1

Hackerblocks: https://hack.codingblocks.com/contests/c/254/1272
My code: https://ide.codingblocks.com/s/70026

The constrains are given as:
1<=t<=100
1<=n<=100

But when i type n>30 it takes a lot of time only with 1 test case… but still got accepted on HB.
How do i optimize my algorithm?

#2

Found the solution: https://www.geeksforgeeks.org/count-number-binary-strings-without-consecutive-1s/

The test cases are really weak. please fix that.

EDIT: its fixed