Regular Words
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2423 Accepted Submission(s): 970
Problem Description
Consider words of length 3n over alphabet {A, B, C} . Denote the number of occurences of A in a word a as A(a) , analogously let the number of occurences of B be denoted as B(a), and the number of occurenced of C as C(a) .
Let us call the word w regular if the following conditions are satisfied:
A(w)=B(w)=C(w) ;
if c is a prefix of w , then A(c)>= B(c) >= C(c) .
For example, if n = 2 there are 5 regular words: AABBCC , AABCBC , ABABCC , ABACBC and ABCABC .
Regular words in some sense generalize regular brackets sequences (if we consider two-letter alphabet and put similar conditions on regular words, they represent regular brackets sequences).
Given n , find the number of regular words.
Let us call the word w regular if the following conditions are satisfied:
A(w)=B(w)=C(w) ;
if c is a prefix of w , then A(c)>= B(c) >= C(c) .
For example, if n = 2 there are 5 regular words: AABBCC , AABCBC , ABABCC , ABACBC and ABCABC .
Regular words in some sense generalize regular brackets sequences (if we consider two-letter alphabet and put similar conditions on regular words, they represent regular brackets sequences).
Given n , find the number of regular words.
Input
There are mutiple cases in the input file.
Each case contains n (0 <= n <= 60 ).
There is an empty line after each case.
Each case contains n (0 <= n <= 60 ).
There is an empty line after each case.
Output
Output the number of regular words of length 3n .
There should be am empty line after each case.
There should be am empty line after each case.
Sample Input
2
3
Sample Output
5
42
题意:n个A,n个B吗,n个C,满足组成的字符串if c is a prefix of w , then A(c)>= B(c) >= C(c) . 这样条件的字符串个数有多少个?
F[a][b][c]=F[a-1][b][c]+F[a][b-1][c]+F[a][b][c-1];
a>=b>=c;
a>=b>=c;
#include <bits/stdc++.h>
using namespace std;
#define LL long long
int ten[4] = {1,10,100,1000};
typedef struct BigNumber
{
int d[25];//内存超了改
BigNumber(string s)
{
int i, j, k, len;
len = s.size();
d[0] = (len-1)/4+1;
for(i=1;i<=24;i++) //内存超了这个也要改
d[i] = 0;
for(i=len-1;i>=0;i--)
{
j = (len-i-1)/4+1;
k = (len-i-1)%4;
d[j] += ten[k]*(s[i]-'0');
}
while(d[0]>1 && d[d[0]]==0)
--d[0];
}
BigNumber()
{
*this = BigNumber(string("0"));
}
string toString()
{
int i, j, temp;
string s("");
for(i=3;i>=1;i--)
{
if(d[d[0]]>=ten[i])
break;
}
temp = d[d[0]];
for(j=i;j>=0;j--)
{
s = s+(char)(temp/ten[j]+'0');
temp %= ten[j];
}
for(i=d[0]-1;i>0;i--)
{
temp = d[i];
for(j=3;j>=0;j--)
{
s = s+(char)(temp/ten[j]+'0');
temp %= ten[j];
}
}
return s;
}
}BigNumber;
BigNumber zero("0"), d, temp, mid[15],dp[61][61][61];
bool operator < (const BigNumber &a, const BigNumber &b)
{
int i;
if(a.d[0]!=b.d[0])
return a.d[0]<b.d[0];
for(i=a.d[0];i>0;i--)
{
if(a.d[i]!=b.d[i])
return a.d[i]<b.d[i];
}
return 0;
}
BigNumber operator + (const BigNumber &a, const BigNumber &b)
{
int i, x;
BigNumber c;
c.d[0] = max(a.d[0], b.d[0]);
x = 0;
for(i=1;i<=c.d[0];i++)
{
x = a.d[i]+b.d[i]+x;
c.d[i] = x%10000;
x /= 10000;
}
while(x!=0)
{
c.d[++c.d[0]] = x%10000;
x /= 10000;
}
return c;
}
BigNumber operator - (const BigNumber &a, const BigNumber &b)
{
int i, x;
BigNumber c;
c.d[0] = a.d[0];
x = 0;
for(i=1;i<=c.d[0];i++)
{
x = 10000+a.d[i]-b.d[i]+x;
c.d[i] = x%10000;
x = x/10000-1;
}
while((c.d[0]>1) && (c.d[c.d[0]]==0))
--c.d[0];
return c;
}
BigNumber operator * (const BigNumber &a, const BigNumber &b)
{
int i, j, x;
BigNumber c;
c.d[0] = a.d[0]+b.d[0];
for(i=1;i<=a.d[0];i++)
{
x = 0;
for(j=1;j<=b.d[0];j++)
{
x = a.d[i]*b.d[j]+x+c.d[i+j-1];
c.d[i+j-1] = x%10000;
x /= 10000;
}
c.d[i+b.d[0]] = x;
}
while((c.d[0]>1) && (c.d[c.d[0]]==0))
--c.d[0];
return c;
}
bool smaller(const BigNumber &a, const BigNumber &b, int delta)
{
int i;
if(a.d[0]+delta!=b.d[0])
return a.d[0]+delta<b.d[0];
for(i=a.d[0];i>0;i--)
{
if(a.d[i]!=b.d[i+delta])
return a.d[i]<b.d[i+delta];
}
return 1;
}
void Minus(BigNumber &a, const BigNumber &b, int delta)
{
int i, x;
x = 0;
for(i=1;i<=a.d[0]-delta;i++)
{
x = 10000+a.d[i+delta]-b.d[i]+x;
a.d[i+delta] = x%10000;
x = x/10000-1;
}
while((a.d[0]>1) && (a.d[a.d[0]]==0))
--a.d[0];
}
BigNumber operator * (const BigNumber &a, int k)
{
BigNumber c;
c.d[0] = a.d[0];
int i, x;
x = 0;
for(i=1;i<=a.d[0];i++)
{
x = a.d[i]*k+x;
c.d[i] = x%10000;
x /= 10000;
}
while(x>0)
{
c.d[++c.d[0]] = x%10000;
x /= 10000;
}
while((c.d[0]>1) && (c.d[c.d[0]]==0))
--c.d[0];
return c;
}
BigNumber operator / (const BigNumber &a, const BigNumber &b)
{
int i, j, temp;
BigNumber c;
d = a;
mid[0] = b;
for(i=1;i<=13;i++)
mid[i] = mid[i-1]*2;
for(i=a.d[0]-b.d[0];i>=0;i--)
{
temp = 8192;
for(j=13;j>=0;j--)
{
if(smaller(mid[j], d, i))
{
Minus(d, mid[j], i);
c.d[i+1] += temp;
}
temp /= 2;
}
}
c.d[0] = max(1, a.d[0]-b.d[0]+1);
while((c.d[0]>1) && (c.d[c.d[0]]==0))
--c.d[0];
return c;
}
int main(void)
{
int n, i, d;
BigNumber t("1");
dp[0][0][0] = t;
for(int i = 1; i <= 60; i++) {
for(int j = 0; j <= i; j++) {
for(int k = 0;k <= j; k++) {
if(i > j)
dp[i][j][k]=dp[i][j][k]+dp[i-1][j][k];
if(j > k)
dp[i][j][k]=dp[i][j][k]+dp[i][j-1][k];
if(k >= 1)
dp[i][j][k]=dp[i][j][k]+dp[i][j][k-1];
}
}
}
while(cin >> n) {
cout << dp[n][n][n].toString() << endl;
cout << endl;
}
return 0;
}