UVA 11584

#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
#define MAXN 1005
#define INF 1000000000
int d[MAXN];
char str[MAXN];

int is_palindromes(int b, int e)
{
	if (b >= e)
		return 1;
	if (str[b] != str[e])
		return 0;
	if (is_palindromes(b + 1, e - 1))
		return 1;
	return 0;
}
int main() 
{
	int n;
	cin >> n;
	while (n--)
	{
		cin >> str + 1;
		str[0] = '0';
		int size = strlen(str) - 1;
		d[0] = 0;
		for (int i = 1;i <= size;++i)
		{
			d[i] = i + 1;
			for (int j = 0;j < i;++j)
			{
				if (is_palindromes(j + 1, i))
				{
					d[i] = min(d[i], d[j] + 1);
				}
			}
		}
		printf("%d\n", d[size]);
	}
	return 0;
}

// d[i]表示字符串0~i子串的最小分割回文数
// d[i]=min(d[i],d[j]+1） <j+1~i 是回文串>
// 0123....j j+1 ...i