70分，求hack，悬关

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll N=150;
ll n,f[N][N];
char a[N];

int main(){
	cin>>a+1;
	n=strlen(a+1);
	
	memset(f,0x3f,sizeof(f));
	for(ll i=1;i<=n;i++)f[i][i]=1;
	for(ll le=2;le<=n;le++){
		for(ll i=1;i+le-1<=n;i++){
			ll l1=i,j=i+le-1,r1=i+le-1;
			while(a[l1]==a[l1+1]&&l1<r1-1)l1++;
			while(a[r1]==a[r1-1]&&l1<r1-1)r1--;
			if(l1+1==r1){
				f[i][j]=(a[l1]!=a[r1])+1;
//				cout<<i<<" "<<j<<" "<<l1<<" "<<r1<<" "<<f[i][j]<<endl;
				continue;
			}
			for(ll k=l1;k<r1;k++)f[i][j]=min(f[i][j],f[l1][k]+f[k+1][r1]);
			if(a[l1]==a[r1])f[i][j]=min(f[i][j],f[l1+1][r1-1]+1);
//			cout<<i<<" "<<j<<" "<<l1<<" "<<r1<<" "<<f[i][j]<<endl;
		}
	}
	cout<<f[1][n];
	
	return 0;
}