Wrong ans to pairing friends problem

#1

i did a 2d dp approach without watching the hint. dp[i][j] stores the ans for i number of friends when j pairs are to be formed…ultimately i took the sum of the row for i=n .
not sure whats wrong… ans seems to excede the range for large numbers…i have seen the 1 dp fibonachi approach…but i feel this is correct too…

#2

Can you share your code

#3

IT WORKS NOW…thanks for looking into it anyway!!

#include
using namespace std;

int main() {

int t;
cin>>t;




long dp[30][15];

	for(int i=0;i<30;i++)
	{
		for(int j=0;j<=14;j++)
		{
			if(j==0)dp[i][j]=1;
			else
			dp[i][j]=0;
		}
	}

	for(int i=1;i<=29;i++)
	{
		for(int j=1;j<=i/2;j++)
		{
                            ##tthe next line was giving the error just had to change ans1 and ans2 to 
                                  long instead of int
			int ans1=0,ans2=0;
			if(j==i/2&&i%2==0)
			dp[i][j]=(i-1)*dp[i-2][j-1];
			else{
				ans1=dp[i-1][j];
				ans2=(i-1)*dp[i-2][j-1];
				dp[i][j]=ans1+ans2;
			}
            
		}
	}
        

while(t--)
{
	int n;
	cin>>n;

	
		long sum=0;
		for(int j=0;j<=14;j++)
		sum+=dp[n][j];

		cout<<sum<<endl;
        /*
		for(int i=0;i<=n;i++)
		{
			for(int j=0;j<=15;j++)
			{
				cout<<dp[i][j]<<" ";
			}
			cout<<endl;
		}*/


}
return 0;

}

#4

Cool … then just mark it as resolved