not able to know where is falt
wrong answer
#include<bits/stdc++.h>
using namespace std;
long long dp[101][5];
long long f(int n)
{
for(int i=0;i<2;i++)
dp[i][0]=0;
for(int i=0;i<2;i++)
{dp[i][1]=1;
dp[i][0]=1;
}
for(int i=2;i<=n;i++)
{
dp[i][0]=dp[i-1][0]+dp[i-1][1];
dp[i][1]=dp[i-1][0];
}
return (dp[n][0]+dp[n][1]);
}
int main()
{
int t;
cin>>t;
while(t–)
{
memset(dp,-1,sizeof(dp));
int n;
cin>>n;
cout<<"#"<<n<<" : "<<f(n)<<endl;
}
}