E - Partitioning by Palindromes

We say a sequence of charzacters is a palindrome if it is the same written forwards and backwards. For example, ‘racecar’ is a palindrome, but ‘fastcar’ is not.

A partition of a sequence of characters is a list of one or more disjoint non-empty groups of consecutive characters whose concatenation yields the initial sequence. For example, (‘race’, ‘car’) is a partition of ‘racecar’ into two groups.

Given a sequence of characters, we can always create a partition of these characters such that each group in the partition is a palindrome! Given this observation it is natural to ask: what is the minimum number of groups needed for a given string such that every group is a palindrome?

For example:

• ‘racecar’ is already a palindrome, therefore it can be partitioned into one group.

• ‘fastcar’ does not contain any non-trivial palindromes, so it must be partitioned as (‘f’, ‘a’, ‘s’, ‘t’, ‘c’, ‘a’, ‘r’).

• ‘aaadbccb’ can be partitioned as (‘aaa’, ‘d’, ‘bccb’).

Input

Input begins with the number n of test cases. Each test case consists of a single line of between 1 and 1000 lowercase letters, with no whitespace within.

Output

For each test case, output a line containing the minimum number of groups required to partition the input into groups of palindromes.

Sample Input

3

racecar

fastcar

aaadbccb

Sample Output

1

7

3

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
char a[1005];
int dp[1005];
int length;
int panduan(int b,int c)
{
	int flag=1;
	while(b<c)
	{
		if(a[b]!=a[c])
		{
			flag=0;
			break;
		}
		b++;
		c--;
	}
	return flag;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%s",a+1);
		length=strlen(a+1);
		for(int i=1;i<=length;i++)
		{
			dp[i]=0x7ffffff;
		}
		dp[0]=0;
		for(int i=1;i<=length;i++)
		{
			for(int j=1;j<=i;j++)
			{	
				if(panduan(j,i))
				{
					dp[i]=min(dp[i],dp[j-1]+1);
				}
			}
		} 
		printf("%d\n",dp[length]);
	}
	return 0;
}