Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
		"reflect"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	// 上面の色を固定してから、左右方向に回転して一致するものがあるかを調べる
	round := [][]int{
		{1,2,3,4,5,6}, {1,3,5,2,4,6}, {1,4,2,5,3,6}, {1,5,4,3,2,6}, // c1を上面に固定して回転
		{2,6,3,4,1,5}, {2,3,1,6,4,5}, {2,1,4,3,6,5}, {2,4,6,1,3,5}, // c2を上面に固定して回転
		{3,1,2,5,6,4}, {3,2,6,1,5,4}, {3,5,1,6,2,4}, {3,6,5,2,1,4}, // c3を上面に固定して回転
		{4,1,5,2,6,3}, {4,2,1,6,5,3}, {4,5,6,1,2,3}, {4,6,2,5,1,3}, // c4を上面に固定して回転
		{5,1,3,4,6,2}, {5,3,6,1,4,2}, {5,4,1,6,3,2}, {5,6,4,3,1,2}, // c5を上面に固定して回転
		{6,2,4,3,5,1}, {6,3,2,5,4,1}, {6,5,3,4,2,1}, {6,4,5,2,3,1}, // c6を上面に固定して回転

	}
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		cubes := make([][]string, n)
		for i := 0; i < n; i++ {
			scanner.Scan()
			cubes[i] = strings.Split(scanner.Text(), " ")
		}
		check := func(a, b int) bool {
			tmp := make([]string, 6)
			for i := 0; i < 24; i++ {
				for j := 0; j < 6; j++ {
					tmp[j] = cubes[b][round[i][j]-1]
				}
				if reflect.DeepEqual(tmp, cubes[a]) {
					return true
				}
			}
			return false
		}
		tbl := make([]int, n)
		// 全ての組み合わせを調べる
		for i := 0; i < n; i++ {
			if tbl[i] == 1 {
				continue
			}
			for j := i+1; j < n; j++ {
				if check(i, j) {
					tbl[j] = 1
				}
			}
		}
		fmt.Println(sum(tbl))
	}
}

func sum(a []int) int {
	ret := 0
	for _, v := range a {
		ret += v
	}
	return ret
}

C++: #include<iostream>
using namespace std;
struct A{
	string s[6];
	void input(){
		for(int i=0;i<6;i++)cin>>s[i];
	}
	bool operator==(const A&a){
		for(int _=0;_<8;_++)
		{
			for(int __=0;__<4;__++)
			{
				bool flag=true;
				for(int i=0;i<6;i++)flag&=s[i]==a.s[i];
				if(flag)return true;
				string tmp=s[1];
				s[1]=s[2];
				s[2]=s[4];
				s[4]=s[3];
				s[3]=tmp;
			}
			if(_<4)
			{
				string tmp=s[0];
				s[0]=s[1];
				s[1]=s[5];
				s[5]=s[4];
				s[4]=tmp;
			}
			else
			{
				string tmp=s[0];
				s[0]=s[2];
				s[2]=s[5];
				s[5]=s[3];
				s[3]=tmp;
			}
		}
		return false;
	}
};
int N;
A a[30];
bool used[30];
main()
{
	while(cin>>N,N)
	{
		int ans=0;
		for(int i=0;i<N;i++)
		{
			a[i].input();
			used[i]=true;
			for(int j=0;j<i;j++)
			{
				if(used[j]&&a[j]==a[i])
				{
					used[i]=false;
					ans++;
					break;
				}
			}
		}
		cout<<ans<<endl;
	}
}

C++: // Tazoe

#include <iostream>
#include <string>
using namespace std;

void roll01(int c[6])
{
	int tmp = c[0];
	c[0] = c[1];
	c[1] = c[5];
	c[5] = c[4];
	c[4] = tmp;
}

void roll02(int c[6])
{
	int tmp = c[0];
	c[0] = c[2];
	c[2] = c[5];
	c[5] = c[3];
	c[3] = tmp;
}

void roll12(int c[6])
{
	int tmp = c[1];
	c[1] = c[2];
	c[2] = c[4];
	c[4] = c[3];
	c[3] = tmp;
}

void rotate(int c[6])
{
	if(c[0]==1){
		;
	}
	else if(c[1]==1){
		roll01(c);
	}
	else if(c[2]==1){
		roll02(c);
	}
	else if(c[3]==1){
		roll02(c);
		roll02(c);
		roll02(c);
	}
	else if(c[4]==1){
		roll01(c);
		roll01(c);
		roll01(c);
	}
	else if(c[5]==1){
		roll02(c);
		roll02(c);
	}

	if(c[1]==2){
		;
	}
	else if(c[2]==2){
		roll12(c);
	}
	else if(c[4]==2){
		roll12(c);
		roll12(c);
	}
	else if(c[3]==2){
		roll12(c);
		roll12(c);
		roll12(c);
	}
	else if(c[1]==3){
		;
	}
	else if(c[2]==3){
		roll12(c);
	}
	else if(c[4]==3){
		roll12(c);
		roll12(c);
	}
	else if(c[3]==3){
		roll12(c);
		roll12(c);
		roll12(c);
	}
}

int main()
{
	while(true){
		int n;
		cin >> n;

		if(n==0)
			break;

		int C[30][6];
		for(int i=0; i<n; i++){
			for(int j=0; j<6; j++){
				string str;
				cin >> str;

				if(str=="Red")
					C[i][j] = 1;
				else if(str=="Yellow")
					C[i][j] = 2;
				else if(str=="Blue")
					C[i][j] = 3;
				else if(str=="Magenta")
					C[i][j] = 4;
				else if(str=="Green")
					C[i][j] = 5;
				else if(str=="Cyan")
					C[i][j] = 6;
			}
		}

		for(int i=0; i<n; i++){
			rotate(C[i]);
		}

		for(int i=0; i<n-1; i++){
			for(int j=i+1; j<n; j++){
				if(C[i][1]>C[j][1]
				 ||(C[i][1]==C[j][1]&&C[i][2]>C[j][2])
				 ||(C[i][1]==C[j][1]&&C[i][2]==C[j][2]&&C[i][3]>C[j][3])
				 ||(C[i][1]==C[j][1]&&C[i][2]==C[j][2]&&C[i][3]==C[j][3]&&C[i][4]>C[j][4])
				 ||(C[i][1]==C[j][1]&&C[i][2]==C[j][2]&&C[i][3]==C[j][3]&&C[i][4]==C[j][4]&&C[i][5]>C[j][5])){
					for(int k=0; k<6; k++){
						int tmp = C[i][k];
						C[i][k] = C[j][k];
						C[j][k] = tmp;
					}
				}
			}
		}

		int m = n;
		for(int i=1; i<n; i++){
			bool flg = true;
			for(int j=0; j<6; j++){
				if(C[i][j]!=C[i-1][j]){
					flg = false;
					break;
				}
			}

			if(flg){
				m--;
			}
		}

		cout << n-m << '\n';
	}

	return 0;
}

C++: #include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main(){
  char c1[30][10],c2[30][10],c3[30][10],c4[30][10],c5[30][10],c6[30][10];
  int n;
  while(1){
    int flag=0;
    int count=0;
    int ans=0;
    cin>>n;
    if(n==0) break;
    
    for(int i=0;i<n;i++){
      scanf("%s %s %s %s %s %s",c1[i],c2[i],c3[i],c4[i],c5[i],c6[i]);
    }
    for(int i=0;i<n-1;i++){
      for(int j=i+1;j<n;j++){
	if(strcmp(c6[i],c6[j])==0 && strcmp(c1[i],c1[j])==0){
	  count++;
	}
      }
    }
    printf("%d\n",count);
  }
}

C++: 
// Trouble in Shinagawa's Artifacts
//  URL: http://rose.u-aizu.ac.jp/onlinejudge/ProblemSet/description.jsp?id=0198&lang=jp

#include <cstdio>
#include <cstring>
#include <vector>
#include <set>

// Ö
std::vector <int> rotate( std::vector <int> box, int a, int b, int c, int d );
std::vector <int> rotate_x( std::vector <int> box );
std::vector <int> rotate_y( std::vector <int> box );
std::vector <int> rotate_z( std::vector <int> box );

// ñ]
std::vector <int> rotate( std::vector <int> box, int a, int b, int c, int d )
{
	int tmp = box[a];
	box[a] = box[b];
	box[b] = box[c];
	box[c] = box[d];
	box[d] = tmp;

	return box;
}

// xÉñ]³¹éÖ
std::vector <int> rotate_x( std::vector <int> box )
{
	// xñ]
	// c1, c2, c3, c4, c5, c6 : default
	// c5, c1, c3, c4, c6, c2

	return rotate( box, 0, 4, 5, 1 );

}


// yÉñ]³¹éÖ
std::vector <int> rotate_y( std::vector <int> box )
{
	// yñ]
	// c1, c2, c3, c4, c5, c6 : default
	// c1, c4, c2, c5, c3, c6

	return rotate( box, 1, 3, 4, 2 );

}

// zÉñ]³¹éÖ
std::vector <int> rotate_z( std::vector <int> box )
{
	// zñ]
	// c1, c2, c3, c4, c5, c6 : default
	// c3, c2, c6, c1, c5, c4

	return rotate( box, 0, 2 ,5 ,3 );

}

// Gg[|Cg
int main()
{

	// Ï
	int n;
	int answer;
	char color[32];
	std::vector <int> box( 6, 0 );
	std::set < std::vector <int> > table;

	while( 1 )
	{
		// ú»
		answer = 0;
		table.clear();
		for( int i = 0; i < 6; ++i )
		{
			box[i] = 0;
		}

		// üÍ
		std::fflush( stdin );
		std::scanf( "%d", &n );

		// üÍÌIíèF[ÐÆÂ
		if( n == 0 ) break;

		// nÌ¾¯ÇÝÞ
		for( int i = 0; i < n; ++i )
		{
			std::fflush( stdin );

			// FîñðüÍ
			for( int j = 0; j < 6; ++j )
			{
				std::scanf( "%s", color );

				// µ¢â·¢æ¤É¶ñ¨®ÉÏ·
				// F: Red, Yellow, Blue, Magenta, Green, Cyan
				if( std::strcmp( "Red", color ) == 0 )
					box[j] = 1;
				else if( std::strcmp( "Yellow", color ) == 0 )
					box[j] = 2;
				else if( std::strcmp( "Blue", color ) == 0 )
					box[j] = 3;
				else if( std::strcmp( "Magenta", color ) == 0 )
					box[j] = 4;
				else if( std::strcmp( "Grdeen", color ) == 0 )
					box[j] = 5;
				else if( std::strcmp( "Cyan", color ) == 0 )
					box[j] = 6;
			}

			// insertÌOÉ¯¶àÌªÈ¢©T·
			// ¯¶àÌª Á½çJEg
			if( table.find( box ) != table.end() )
			{
				++answer;
				continue;
			}

			// insertµÄ¨­
			// ¡¨cx3ð4ñ

			for( int k = 0; k < 6; ++k )
			{
				// x
				for( int j = 0; j < 4; ++j )
				{
					box = rotate_x( box );
					table.insert( box );
				}

				if( k % 2 == 0 )
				{
					box = rotate_y( box );
					table.insert( box );
				}
				else
				{
					box = rotate_z( box );
					table.insert( box );
				}

			}

		}

		// oÍ
		std::printf( "%d\n", answer );

	}

} // main()