61.187.179.132:8080\/JudgeOnline\/showproblem<\/a>
\u8981Dp\u3002\u3002\u975e\u5e38\u7684\u590d\u6742\uff0c\u770bCode\u5427\u3002\u3002\u7d2f\u6b7b\u4e86\u3002\u3002
Code\uff1a<\/p>\n#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<cstdlib>#include<cstring>#include<string>#include<vector>#include<set>#include<queue>#include<map>#define rep(i,n) for(int i=0;i<n;i++)#define For(i,a,b) for(int i=a;i<=b;i++)#define tr(i,x) for(typeof(x.begin()) i=x.begin();i!=x.end();i++)#define all(x) x.begin(),x.end()#define pb push_backusing namespace std;const int inf=~0U>>1;typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> ii;const int maxn=100+10,mod=9999973;int Dp[2][maxn][maxn],n,m;int C[maxn][maxn]={0};int plus_mod(int&a,int b){ a+=b;return a%=mod;}int multi_mod(int&a,int b){ return a=((long long)a*b)%mod;}void GetC(){ C[0][0]=1; for(int i=1;i<=m;i++) { C[i][0]=C[i][i]=1; for(int j=1;j<i;j++) { C[i][j]=C[i-1][j-1]+C[i-1][j]; C[i][j]%=mod; } }}#define MM(x) memset(x,0,sizeof(x))int main(){ cin>>n>>m;int now=0,next=1; MM(Dp);GetC(); Dp[next][m][0]=1; for(int i=0;i<n;i++) { swap(now,next); MM(Dp[next]); for(int a0=0;a0<=m;a0++) for(int a1=0;a1+a0<=m;a1++) if(Dp[now][a0][a1]) { int x=Dp[now][a0][a1],c; \/\/Dont used Row i plus_mod(Dp[next][a0][a1],x); \/\/Put one if(a0) { c=x; multi_mod(c,C[a0][1]); plus_mod(Dp[next][a0-1][a1+1],c); } if(a1) { c=x; multi_mod(c,C[a1][1]); plus_mod(Dp[next][a0][a1-1],c); } \/\/Put two if(a0>=2) { c=x; multi_mod(c,C[a0][2]); plus_mod(Dp[next][a0-2][a1+2],c); } if(a1>=2) { c=x; multi_mod(c,C[a1][2]); plus_mod(Dp[next][a0][a1-2],c); } if(a0&&a1) { c=x; multi_mod(c,C[a0][1]); multi_mod(c,C[a1][1]); plus_mod(Dp[next][a0-1][a1],c); } } } int ans=0; rep(i,m+1)rep(j,m+1)plus_mod(ans,Dp[next][i][j]); cout<<ans<<endl;}71 3 <\/p>\n","protected":false},"excerpt":{"rendered":"
[Ahoi2009]chess \u4e2d\u56fd\u8c61\u68cb Time Limit:10000MS Memory Limit:65536KTotal Submit:21 Accepted:11 Case Time Limit:1000MS Description \u5728N\u884cM\u5217\u7684\u68cb\u76d8\u4e0a\uff0c\u653e\u82e5\u5e72\u4e2a\u70ae\u53ef\u4ee5\u662f0\u4e2a\uff0c\u4f7f\u5f97\u6ca1\u6709\u4efb\u4f55\u4e00\u4e2a\u70ae\u53ef\u4ee5\u653b\u51fb\u53e6\u4e00\u4e2a\u70ae\u3002 \u8bf7\u95ee\u6709\u591a\u5c11\u79cd\u653e\u7f6e\u65b9\u6cd5\uff0c\u4e2d\u56fd\u50cf\u68cb\u4e2d\u70ae\u7684\u884c\u8d70\u65b9\u5f0f\u5927\u5bb6\u5e94\u8be5\u5f88\u6e05\u695a\u5427. Input \u4e00\u884c\u5305\u542b\u4e24\u4e2a\u6574\u6570N\uff0cM\uff0c\u4e2d\u95f4\u7528\u7a7a\u683c\u5206\u5f00. Output \u8f93\u51fa\u6240\u6709\u7684\u65b9\u6848\u6570\uff0c\u7531\u4e8e\u503c\u6bd4\u8f83\u5927\uff0c\u8f93\u51fa\u5176mod 9999973 Sample Input Sample Output Hint \u9664\u4e86\u57283\u4e2a\u683c\u5b50\u4e2d\u90fd\u653e\u6ee1\u70ae\u7684\u7684\u60c5\u51b5\u5916\uff0c\u5176\u5b83\u7684\u90fd\u53ef\u4ee5. 100%\u7684\u6570\u636e\u4e2dN,M\u4e0d\u8d85\u8fc7100 50%\u7684\u6570\u636e\u4e2d\uff0cN,M\u81f3\u5c11\u6709\u4e00\u4e2a\u6570\u4e0d\u8d85\u8fc78 30%\u7684\u6570\u636e\u4e2d\uff0cN,M\u5747\u4e0d\u8d85\u8fc76 Source Day261.187.179.132:8080\/JudgeOnline\/showproblem\u8981Dp\u3002\u3002\u975e\u5e38\u7684\u590d\u6742\uff0c\u770bCode\u5427\u3002\u3002\u7d2f\u6b7b\u4e86\u3002\u3002Code\uff1a #include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<cstdlib>#include<cstring>#include<string>#include<vector>#include<set>#include<queue>#include<map>#define rep(i,n) for(int i=0;i<n;i++)#define For(i,a,b) for(int i=a;i<=b;i++)#define tr(i,x) for(typeof(x.begin()) i=x.begin();i!=x.end();i++)#define all(x) x.begin(),x.end()#define pb push_backusing namespace std;const int inf=~0U>>1;typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> ii;const int […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/182"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=182"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/182\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=182"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=182"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=182"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}