1 solutions

  • 0
    @ 2025-11-5 16:37:47

    C++ :

    #include <iostream>
    #include <cstring>
    #define mod 100007
    using namespace std;
    int main()
    {
    	int dp[55][55];
    	memset(dp,0,sizeof(dp));
    	int i,j,n;
    	dp[1][1]=1;
    	for(i=2;i<=52;i++)
    	{
    		for(j=1;j<=i;j++)
    		{
    			dp[i][j]=(dp[i][j-1]+dp[i-1][j])%mod;
    		}
    	}
    	while(cin>>n,n)
    	{
    		if(n%2)
    		{
    			cout<<0<<endl;
    			continue;
    		}
    		cout<<dp[n/2+1][n/2+1]<<endl;
    	}
    	return 0;
    }
    
    • 1

    Information

    ID
    17886
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By