王晓东 乘法表问题

#include "stdio.h"
#include "string.h"

#define M 10

int count[M][M][3];

char str[100];
int len;

void main(){
	int i, z, k;
	freopen("in.txt", "r", stdin);

	while(scanf("%s", str)!=EOF){
		len = strlen(str);
		memset(count, 0, sizeof(count));

		for(i=0; i<len; i++){
			count[i][i][str[i]-'a'] = 1;
		}

		for(k=2; k<=len; k++){
			for(i=0; i<=len-k; i++){
				for(z=i+1; z<=i+k-1; z++){
					count[i][i+k-1][0] += count[i][z-1][0]*count[z][i+k-1][2] + count[i][z-1][1]*count[z][i+k-1][2] + count[i][z-1][2]*count[z][i+k-1][0]; //ac bc ca
					count[i][i+k-1][1] += count[i][z-1][0]*count[z][i+k-1][0] + count[i][z-1][0]*count[z][i+k-1][1] + count[i][z-1][1]*count[z][i+k-1][1]; //aa ab bb
					count[i][i+k-1][2] += count[i][z-1][1]*count[z][i+k-1][0] + count[i][z-1][2]*count[z][i+k-1][1] + count[i][z-1][2]*count[z][i+k-1][2]; //ba cb cc
				}
			}
		}

		printf("a:%d b:%d c:%d\n", count[0][len-1][0], count[0][len-1][1], count[0][len-1][2]);
	}
}

动态规划