练习的时候想过用哈希,想写觉得太麻烦了,最后想了好久想了种简单的思路,因为有翻转和旋转,
所以每次得到的样式要旋转12次,翻转后再旋转12次,在这过程中得到最小的数,然后跟已有的数进行检查,如果没有的话就是新的样式了。
#include <iostream>
#include <algorithm>
using namespace std;
long long arr[10000];
const int k = 12;
int num;
bool p(int *A) {
long long sum = 0,tmp = 0,sum2 = 0;
for(int m = 0;m < k;++m)
sum = sum *10 + A[m];
for(int m = k-1;m >= 0;--m)
sum2 = sum2 *10 + A[m];
tmp = sum;
for(int m = 0;m < k;++m) {
if(tmp%10 * 100000000000 + tmp/10 < sum)
sum = tmp%10 * 100000000000 + tmp/10;
tmp = tmp%10 * 100000000000 + tmp/10;
}
tmp = sum2;
for(int m = 0;m < k;++m) {
if(tmp%10 * 100000000000 + tmp/10 < sum2)
sum2 = tmp%10 * 100000000000 + tmp/10;
tmp = tmp%10 * 100000000000 + tmp/10;
}
sum = sum < sum2 ? sum : sum2;
for(int m = 0;m < num;++m) if(sum == arr[m]) return false;
arr[num++] = sum;
return true;
}
int main()
{
int A[12] = {1,1,1,2,2,2,2,3,3,3,3,3};
num = 0;
do {
p(A);
}while(next_permutation(A,A+12));
cout << num << endl;
return 0;
}