西北大学<数字问题>

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include<math.h>
using namespace std;
bool walked[700500];
char a[7];
int main(){
   // freopen("in.txt","r",stdin);
    int i,j,k,l,f1,f2,f3,t1,t2,t3;
    int n,m;
    char r;
    int sum1;
    while(scanf("%d",&n)==1){
    //scanf("%d",&n);
    t2=0;
   // cout << "n=" << n <<endl;
    memset(walked,0,sizeof(walked));
    for(i=1;i<=n;i++){
            f1=0;
        scanf("%s",a);
        for(t1=0;t1<6;t1++){
                m=0;
            m+=(a[(t1+0)%6]-'0')*100000;
            m+=(a[(t1+1)%6]-'0')*10000;
            m+=(a[(t1+2)%6]-'0')*1000;
            m+=(a[(t1+3)%6]-'0')*100;
            m+=(a[(t1+4)%6]-'0')*10;
            m+=(a[(t1+5)%6]-'0');
      //  cout << m << endl;
        if(walked[m]==1){
                f1=1;break;}
    }
    if(f1==0){
        walked[m]=1;
        t2++;
        //cout << m << endl;
    }
    }
    printf("%d\n",t2);
    }
    return 0;}