UVa 11221 - Magic Square Palindromes

	/**
	* Author : Md.Mehadi Hasan Menon.
	* Problem : 11221 - Magic Square Palindromes.
	* Status : Accepted.
	* Date : 10.10.2014.
	**/
	#include <stdio.h>
	#include <math.h>
	#include <ctype.h>
	#include <string.h>
	char s[10005]; char t[10005];
	int main()
	{
	int i, j, k, l, tc, valid, len;
	scanf("%d\n", &tc);
	for(l = 1; l <= tc; l++)
	{
	gets(s);
	j = 0; valid = 0;
	for(i = 0; s[i]; i++)
	{
	if( isalpha(s[i]) )
	{
	t[j++] = s[i];
	}
	}
	t[j] = '\0';
	k = sqrt(j);
	len = strlen(t);
	if(k * k == j)
	{
	j = 0;
	for(i = len - 1; i >= 0; i--)
	{
	s[j++] = t[i];
	}
	s[j] = '\0';
	}
	if(!strcmp(s, t)) valid = 1;
	printf("Case #%d:\n", l);
	if(valid)
	{
	printf("%d\n", k);
	}
	else
	{
	printf("No magic :(\n");
	}
	}
	return 0;
	}

view raw 11221.cpp hosted with ❤ by GitHub