zoj 2744 - Palindromes

#include <iostream>
#include <cstdlib>
#include <cstring>

using namespace std;

char data[ 5005 ];
bool F[ 5005 ][ 5005 ];

int main()
{
while ( cin >> data ) {
int Len = strlen( data );
memset( F, false, sizeof( F ) );
for ( int i = 0 ; i < Len ; ++ i )
F[ i ][ i ] = true;
for ( int i = Len-1 ; i >= 0 ; -- i )
for ( int j = i+1 ; j < Len ; ++ j )
if ( data[ i ] == data[ j ] && ( i+1 >= j-1 || F[ i+1 ][ j-1 ] ) )
F[ i ][ j ] = true;

int count = 0;
for ( int i = 0 ; i < Len ; ++ i )
for ( int j = i ; j < Len ; ++ j )
if ( F[ i ][ j ] ) ++ count;

cout << count << endl;
}
return 0;
}