社区讨论
打表,20分
P1057[NOIP 2008 普及组] 传球游戏参与者 4已保存回复 4
讨论操作
快速查看讨论及其快照的属性,并进行相关操作。
- 当前回复
- 4 条
- 当前快照
- 1 份
- 快照标识符
- @mhizhvr4
- 此快照首次捕获于
- 2025/11/03 18:15 4 个月前
- 此快照最后确认于
- 2025/11/03 18:15 4 个月前
CPP
//优美的数学
#include<bits/stdc++.h>
using namespace std;
int main(){
int a[30][35]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,10,5,8,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,1,0,9,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,36,17,30,20,22,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,1,0,34,0,13,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,136,64,114,69,85,70,72,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,1,0,128,0,64,0,17,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,528,247,438,245,332,252,271,252,254,252,252,252,252,252,252,252,252,252,252,252,252,252,252,252,252,252,252,252,252,1,0,491,0,286,0,100,0,21,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2080,963,1698,892,1301,923,1045,924,947,924,926,924,924,924,924,924,924,924,924,924,924,924,924,924,924,924,924,924,924,1,0,1912,0,1220,0,507,0,144,0,25,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,8256,3782,6630,3316,5110,3421,4082,3432,3601,3432,3459,3432,3434,3432,3432,3432,3432,3432,3432,3432,3432,3432,3432,3432,3432,3432,3432,3432,3432,1,0,7518,0,5071,0,2380,0,820,0,196,0,29,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,32896,14937,26034,12537,20115,12796,16057,12869,13886,12870,13095,12870,12901,12870,12872,12870,12870,12870,12870,12870,12870,12870,12870,12870,12870,12870,12870,12870,12870,1,0,29741,0,20753,0,10676,0,4216,0,1241,0,256,0,33,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,131328,59237,102678,48038,79344,48230,63411,48605,54076,48620,50117,48620,48909,48620,48655,48620,48622,48620,48620,48620,48620,48620,48620,48620,48620,48620,48620,48620,48620,1,0,118110,0,84118,0,46510,0,20349,0,6954,0,1786,0,324,0,37,0,2,0,0,0,0,0,0,0,0,0,0,0,1,524800,235596,406338,185995,313557,183010,251010,184624,212042,184755,193496,184756,186866,184756,185117,184756,184795,184756,184758,184756,184756,184756,184756,184756,184756,184756,184756,184756,184756,1,0,470220,0,338906,0,198608,0,94164,0,36043,0,10850,0,2471,0,400,0,41,0,2,0,0,0,0,0,0,0,0,0,1,2098176,938827,1612230,725918,1241178,698634,995147,704544,835472,705413,752324,705432,718753,705432,708303,705432,705873,705432,705475,705432,705434,705432,705432,705432,705432,705432,705432,705432,705432,1,0,1875087,0,1360309,0,836023,0,423016,0,177100,0,60214,0,16192,0,3312,0,484,0,45,0,2,0,0,0,0,0,0,0,1,8390656,3745975,6409554,2850391,4920143,2681616,3949677,2699121,3303031,2703950,2941449,2704155,2780562,2704156,2723660,2704156,2707952,2704156,2704685,2704156,2704203,2704156,2704158,2704156,2704156,2704156,2704156,2704156,2704156,1,0,7485204,0,5447504,0,3481880,0,1859548,0,837430,0,313720,0,95910,0,23300,0,4325,0,576,0,49,0,2,0,0,0,0,0,1,33558528,14959442,25520118,11243463,19528388,10344177,15689386,10375419,13089857,10398926,11551501,10400577,10810229,10400600,10519810,10400600,10428225,10400600,10405501,10400600,10401225,10400600,10400651,10400600,10400602,10400600,10400600,10400600,10400600,1,0,29901194,0,21785555,0,14384073,0,8041556,0,3848130,0,1560780,0,528840,0,146835,0,32526,0,5526,0,676,0,53,0,2,0,0,0,1,134225920,59773709,101726178,44501795,77593945,40081423,62367025,40003200,51964032,40105280,45523315,40116304,42206195,40116599,40792275,40116600,40295961,40116600,40154652,40116600,40122802,40116600,40117329,40116600,40116655,40116600,40116602,40116600,40116600,1,0,119501073,0,87059056,0,59048148,0,34336489,0,17298645,0,7498530,0,2765295,0,855036,0,217413,0,44254,0,6931,0,784,0,57,0,2,0};
int n,m;
cin>>n>>m;
cout<<a[n-1][m-1];
}
———看我400s代码———
CPP#include<bits/stdc++.h>
using namespace std;
int cnt=0;
void dfs(int n,int m,int times,int now){
if(times==n){
if(now==1){
cnt++;
}
return ;
}
dfs(n,m,times+1,(now+1)%m);
int p=now-1;
if(p==0){
p=m;
}
dfs(n,m,times+1,p);
}
int solve(int n,int m){
cnt=0;
dfs(n,m,1,1);
return cnt;
}
int main(){
for(int n=1;n<=30;n++){
for(int m=1;m<=30;m++){
cout<<solve(n,m)<<",";
}
}
return 0;
}
简单干净
但是为什么会错
我不明白(奉化音)
回复
共 4 条回复,欢迎继续交流。
正在加载回复...