一题顶三题,上楼不费劲
定义状态dp[i][j][k],ijk分别代表abc的字母的个数
那么dp[i][j][k]合法当且仅当i>=j>=k,同时我们只需要输出dp[n][n][n]作为结果
不合法的位置置为0即可
dp[i][j][k]=dp[i−1][j][k]+dp[i][j−1][k]+dp[i][j][k−1]
输了几个数发现有点长,那就高精度吧……
高精度完了,数组是不是有点大啊……
那就打表吧……
打表代码:
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<sstream>
#include<stack>
#include<queue>
#include<fstream>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<cmath>
#define CLR(x) memset(x,0,sizeof(x))
#define ll long long
#define eps 1e-6
#define pow2(x) ((x)*(x))
#define forto(i,n) for(int i=0;i<n;i++)
#define for1to(i,n) for(int i=1;i<=n;i++)
#define VI vector<int>
using namespace std;
const double PI=acos(-1.0);
#define INF 0x3fffffff ///INT_MAX一半防止上溢
#define NINF 0xbfffffff
int dp[61][61][61][100];
int add(int A[],int B[]) ///Add B to A
{
for (int i=0;i<100;i++)
{
A[i]+=B[i];
A[i+1]+=A[i]/10000;
A[i]%=10000;
}
}
};
int main()
{
cin.sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("test.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
dp[0][0][0][0]=1;
for (int i=1;i<=60;i++)
for (int j=0;j<=i;j++)
for (int k=0;k<=j;k++)
{
add(dp[i][j][k],dp[i-1][j][k]);
add(dp[i][j][k],dp[i][j-1][k]);
add(dp[i][j][k],dp[i][j][k-1]);
}
int n;
while (cin>>n)
{
cout<<"\"";
int k(99);
while (!dp[n][n][n][k])
k--;
for (int i=k;i>=0;i--)
{
if (i!=k)
cout<<setw(4)<<setfill('0');
cout<<dp[n][n][n][i];
}
cout<<"\"";
cout<<","<<endl;
}
return 0;
}
打出来的表:
char ans[100][100]=
{
"1",
"1",
"5",
"42",
"462",
"6006",
"87516",
"1385670",
"23371634",
"414315330",
"7646001090",
"145862174640",
"2861142656400",
"57468093927120",
"1178095925505960",
"24584089974896430",
"521086299271824330",
"11198784501894470250",
"243661974372798631650",
"5360563436201569896300",
"119115896614816702500900",
"2670926804331443293626900",
"60386171228363065768956000",
"1375596980582110638216817680",
"31554078431506568639711925552",
"728440733705121725605657358256",
"16916012593818937850175820875056",
"394984727560107218767652172156480",
"9269882950945137003216002357575872",
"218589820552932101591964442689934272",
"5177405669064206309480641678873685136",
"123139887106265725065261170839575261246",
"2940211742938376804365727956142799686970",
"70461309651358512358741033490151564263034",
"1694426732092192797198296281548882854896770",
"40879953049935966764838175153044218787509460",
"989318124094680800242093703952690318964293660",
"24011992526103689868224096174884123328708261100",
"584414956558400574946623386902564355477176447080",
"14261150342358043298392602404780869211095488665940",
"348876433985002864104580005170614922408018905657020",
"8555006509113973886896694412506009110609925390878620",
"210257823823361408953856390159370731312558948560177500",
"5178713915261459187808923452167773648813573133021584000",
"127816663734641521693312994768720558317819058630953008000",
"3160890723051037742300958639363743464856851891194511344000",
"78316111638147520232116305011469771592038383559489541704000",
"1943917771018304520047172570820410402016667020494472553010000",
"48334523581589010102952513742546024844918906756931542442556400",
"1203813957908516875152358489329058054078745007110871474716375280",
"30029983483935083858438698423851117882968874317657169412268673840",
"750270153399794678576435057573545926324276055884108148422050727840",
"18772482769028405636917719941593858764528793976890630506115671775200",
"470373947038907707302405010980987131831213397364392909428995307126880",
"11802109943885320655951253002795677125946808879324767545672973160638080",
"296516920131524804299707608337156053506400465189952712435084509896783040",
"7459203321130790040650176332416188852363369960068846727881499803410725440",
"187875141510304732204453155491218970539216498205240765481036372897711988800",
"4737637890492057297860769571861620074038072983555206964113320603342642320960",
"119605940186192921945993199027326146131452990076639651225155962772912609414400",
"3022912056752362939484322031260179006906680462576858197252183463144268821651200",
};