UVA 353 - Pesky Palindromes

/*************************************
******** Team : BUBT_HIDDEN **********
**************************************
*********** Shipu Ahamed *************
*************************************/

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include

#define sc scanf
#define pf printf
#define ll long long
#define pi 2*acos(0.0)

#define ff first
#define se second
#define inf (1<<30)                                              //infinity value
#define pb push_back
#define S(s) s.size()
#define mod  1000000007
#define ST(v) sort(v.begin(),v.end())
#define cover(a,d) memset(a,d,sizeof(a))
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)
#define maxall(v) *max_element(v.begin(),v.end())
#define minall(v) *min_element(v.begin(),v.end())
#define un(v) ST(v), v.erase(unique(v.begin(),v.end()),v.end())

using namespace std;
string pal,a;
int c=0;
int pl(string s,int len)
{
     for(int i=0,j=len-1;i>s)
    {
        int len=s.size();
        int l;
        int r=0,c=0;
        mapmp;
        for(int i=0;i=1)
                continue;
                mp[pal]++;

                l=pal.size();
                if(pl(pal,l))
                c++;
            }
        }
        cout<<"The string '"<