UVA_11221_Magic_Square_Palindrome

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;
char cad[10001];
bool ispalindrome(string s){
    string str=s;
    reverse(str.begin(),str.end());
    if(str==s) return true;
    else return false;
}
bool issquare(int n){
 double d_sqrt = sqrt(double(n));
  int i_sqrt = d_sqrt;
  if ( d_sqrt == i_sqrt ) return true;
  else return false;

}
int main() {
    int cont=1;int aux;
    int t;
    scanf("%d",&t);getchar();
    while(t--){
        gets(cad);string s="";
        int n=strlen(cad);
        printf("Case #%d:\n",cont);
        for(int i=0;i<n;i++){
            if(isalpha(cad[i])){
                s+=cad[i];
            }
        }
        bool espali=ispalindrome(s);
        if(espali && issquare(s.size())){
             aux= sqrt(double(s.size()));
            printf("%d\n",aux);
        }else{
            printf("No magic :(\n");
        }
        cont++;
    }
    return 0;
}