zoj 3605 Find the Marble

#include<cstdio>#include<cstring>#define MAXN 55using namespace std;long long dp[MAXN][MAXN][MAXN];int main(){    int T,n,m,s,k,i,j,t,a[MAXN],b[MAXN];    scanf("%d",&T);    while(T--)    {        scanf("%d%d%d%d",&n,&m,&k,&s);        for(i=1;i<=m;i++) scanf("%d%d",a+i,b+i);        memset(dp,0,sizeof(dp));        dp[0][0][s]=1;        for(i=1;i<=m;i++)        { dp[i][0][s]=1; for(j=1;j<=i&&j<=k;j++) {     dp[i][j][b[i]]=dp[i-1][j-1][a[i]];     dp[i][j][a[i]]=dp[i-1][j-1][b[i]];     for(t=1;t<=n;t++)     {         dp[i][j][t]+=dp[i-1][j][t];         if(t!=a[i]&&t!=b[i])  dp[i][j][t]+=dp[i-1][j-1][t];     } }        }        for(s=1,t=2;t<=n;t++) if(dp[m][k][t]>dp[m][k][s])     s=t;        printf("%dn",s);    }    return 0;}