#include <iostream> 
#include <sstream> 
#include <string> 
#include <vector> 
#include <set> 
#include <map> 
#include <algorithm> 
#include <cstdio> 
#include <cstdlib> 
#include <cmath>
#include <math.h>
#include <string.h>
#include <stdlib.h>
using namespace std; 

#define REP(i, n) for(int i = 0; i<(n); i++) 
#define abs(a) ((a) >= 0 ? (a) : -(a)) 
#define inf 999999999 
typedef vector<int> VI; 
typedef vector<string> VS; 
typedef long long i64; 
typedef unsigned long long u64;

char buf[75];

void go()
{
	int n = strlen(buf);
	VS v;
	for (int i = 1; i < n; i++)
	{	
		int k = n - i;
		string a, a1, b, b1;
		for (int j = 0; j < i; j++)
		{
			a.push_back(buf[j]);
			a1.push_back(buf[i-1-j]);
		}
		for (int j = i; j < n; j++)
		{
			b.push_back(buf[j]);
			b1.push_back(buf[n-1-(j-i)]);	
		}
		v.push_back(a+b);
		v.push_back(b+a);
		v.push_back(b+a1);
		v.push_back(a1+b);
		v.push_back(a1+b1);
		v.push_back(a+b1);
		v.push_back(b1+a1);
		v.push_back(b1+a);
	}
	int res = 0;
	string tt;
	sort(v.begin(), v.end());
	for (int i = 1; i < v.size(); i++)
		if (v[i] != tt) { res++; tt = v[i]; }	
	printf("%d\n", res);
	
}

int main()
{
	int T;
	cin>>T;
	for (int i = 0; i < T; i++)
	{
		scanf("%s", &buf);
		go();
	};
	return 0; 	
}

• Re:why WA (41) Morpheus 2006-10-30 15:07:38