Test case 0 failed

#1

what is wrong in this code (friend’s pairing problem)?

#2

code -> #include<bits/stdc++.h> using namespace std; int main(){ int n; int tc; cin>>tc; while(tc–){ cin>>n; if(n<0){ cout<<"-1"<<endl; continue; } int dp[n+1]={0}; dp[1]=1; dp[2]=2; for(int i=3 ; i<=n ; i++){ dp[i] = dp[i-1]+(i-1)*dp[i-2]; } cout<<dp[n]<<endl; } return 0; }

#3
#4

Hi,

Use long long datatype to prevent integer overflow.