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 <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
//#define int long long
using namespace std;

struct Dice
{
	int c[6];	//??????????????????

	Dice() {}

	//c0:???, c1:??????, c2:???, c3:?\\, c4:???, c5:???
	Dice(int c0, int c1, int c2, int c3, int c4, int c5)
	{
		c[0] = c0; c[1] = c1; c[2] = c2; c[3] = c3; c[4] = c4; c[5] = c5;
	}

	void temae()
	{
		int temp = c[0];
		c[0] = c[3]; c[3] = c[5]; c[5] = c[1];
		c[1] = temp;
	}

	void oku()
	{
		int temp = c[0];
		c[0] = c[1]; c[1] = c[5]; c[5] = c[3];
		c[3] = temp;
	}

	//y????????¢??????
	void y_migi()
	{
		int temp = c[1];
		c[1] = c[4]; c[4] = c[3]; c[3] = c[2];
		c[2] = temp;
	}

	//y????????¢??????
	void y_hidari()
	{
		int temp = c[1];
		c[1] = c[2]; c[2] = c[3]; c[3] = c[4];
		c[4] = temp;
	}

	//z????????¢??????
	void z_migi()
	{
		int temp = c[0];
		c[0] = c[4]; c[4] = c[5]; c[5] = c[2];
		c[2] = temp;
	}

	//z????????¢??????
	void z_hidari()
	{
		int temp = c[0];
		c[0] = c[2]; c[2] = c[5]; c[5] = c[4];
		c[4] = temp;
	}

	//1???????????\?????????????????¢??????2????¨????????????´????????????????\\??????????????°3????\\????????????????????????
	void format()
	{
		if (c[0] == 1) {
			;
		} else if (c[1] == 1) {
			oku();
		} else if (c[2] == 1) {
			z_hidari();
		} else if (c[3] == 1) {
			temae();
		} else if (c[4] == 1) {
			z_migi();
		} else if (c[5] == 1) {
			oku();
			oku();
		}

		if (c[1] == 2)
		{
			y_migi();
			y_migi();
		} else if (c[2] == 2) {
			y_migi();
		} else if (c[4] == 2) {
			y_hidari();
		} else if (c[3] == 2) {
			return;
		} else {
			if (c[1] == 3)
			{
				y_migi();
				y_migi();
			} else if (c[2] == 3) {
				y_migi();
			} else if (c[4] == 3) {
				y_hidari();
			}
		}
	}

	bool operator == (const Dice &d) const {
		Dice td1 = Dice(c[0], c[1], c[2], c[3], c[4], c[5]);
		Dice td2 = d;

		td1.format();
		td2.format();

		rep(i,6)
		{
			if (td1.c[i] != td2.c[i]) return false;
		}
		return true;
	}
};

int n;
map<string, int> c2n;
string color[6];
int cc[6];
Dice d[30];
bool used[30];

signed main()
{
	c2n["Red"] = 1;
	c2n["Yellow"] = 2;
	c2n["Blue"] = 3;
	c2n["Magenta"] = 4;
	c2n["Green"] = 5;
	c2n["Cyan"] = 6;

	while (true)
	{
		cin >> n;
		if (n == 0) break;

		rep(j,n)
		{
			rep(i,6) cin >> color[i];
			cc[0] = c2n[color[0]];
			cc[1] = c2n[color[1]];
			cc[2] = c2n[color[2]];
			cc[3] = c2n[color[4]];
			cc[4] = c2n[color[3]];
			cc[5] = c2n[color[5]];
			d[j] = Dice(cc[0], cc[1], cc[2], cc[3], cc[4], cc[5]);
		}

		rep(i,n) used[i] = false;

		int ans = 0;
		for (int i=0; i<n; i++)
		{
			for (int j=i+1; j<n; j++)
			{
				if (d[i] == d[j] && used[j] == false;)
				{
					ans++;
					used[j] = true;
				}
			}
		}

		cout << ans << endl;
	}
}

C++: #include <iostream>
#include <vector>
#include <string.h>
#include <string>
using namespace std;

typedef vector<string> Dice;

void rotate_front(Dice& dice)
{
	string t = dice[0];
	dice[0] = dice[4];
	dice[4] = dice[5];
	dice[5] = dice[1];
	dice[1] = t;
}

void rotate_right(Dice& dice)
{
	string t = dice[0];
	dice[0] = dice[3];
	dice[3] = dice[5];
	dice[5] = dice[2];
	dice[2] = t;
}

void rotate_clock(Dice& dice)
{
	string t = dice[1];
	dice[1] = dice[2];
	dice[2] = dice[4];
	dice[4] = dice[3];
	dice[3] = t;
}

void rotate(Dice& dice, string top)
{
	for(int i=0; i<4; i++)
	{
		if(dice[0] == top) return;
		rotate_front(dice);
	}

	for(int i=0; i<4; i++)
	{
		if(dice[0] == top) return;
		rotate_right(dice);
	}
}

bool match(Dice d1, Dice d2)
{
	if(d1[5] != d2[5]) return false;

	for(int i=0; i<4; i++)
	{
		bool is_match = true;
		for(int j=1; j<5; j++)
		{
			if(d1[j] != d2[j])
			{
				is_match = false;
				break;
			} 
		}
		if(is_match) return true;
		
		rotate_clock(d2);
	}

	return false;
}

int table[6];

int main()
{
	int T;
	string color;
	vector<Dice> dices;

	while(cin >> T, T)
	{
		dices = vector<Dice>(T);
		for(int t=0; t<T; t++)
		{
			for(int i=0; i<6; i++)
			{
				cin >> color;
				dices[t].push_back(color);
			}
			if(t != 0) rotate(dices[t], dices[0][0]);
		}

		int match_count = 0;
		memset(&table[0], 0, sizeof(int)*6);
		for(int t=0; t<T; t++)
		{
			for(int i=0; i<t; i++)
			{
				if(match(dices[t], dices[i]))
				{
					if(!table[t] || !table[i])
					{
						table[t] = 1;
						table[i] = 1;
						match_count++;
					}
				}
			}
		}

		printf("%d\n", match_count);
	}
}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int cc(int,int);

int main(){
  int i,j,k,l,m,o,n,a[30][7],ans,c;
  string str;
  bool f;
  while(1){
    cin >> n;
    if(n == 0) break;

    for(int t=0;t<n;t++){
      for(i=1;i<7;i++){
	cin >> str;
	if(str == "Cyan") a[t][i] = 1;
	else if(str == "Yellow") a[t][i] = 2;
	else if(str == "Red") a[t][i] = 3;
	else if(str == "Magenta") a[t][i] = 4;
	else if(str == "Green") a[t][i] = 5;
	else a[t][i] = 6;
      }
    }
    ans = 0;

    for(i=0;i<n-1;i++){
      for(j=i+1;j<n;j++){
	f = false;
	for(k=1;k<7;k++){
	  for(l=1;l<7;l++){
	    if(a[i][k] == a[j][l] && a[i][7-k] == a[j][7-l]){
	      f = true;

	      int c1[4],c2[4];
	      for(m=0;m<4;m++){
		c1[m] = cc(k,m);
		c2[m] = cc(l,m);
	      }

	      for(m=0;m<4;m++){
		c = 0;
		for(o=0;o<4;o++){
		  if(a[i][c1[o]] == a[j][c2[(o+m)%4]]) c++;
		}
		if(c == 4){
		  ans++;
		  break;
		}

	      }
	    }
	    if(f) break;
	  }
	  if(f) break;
	}
      }
    }

    cout << ans << endl;

  }
  return 0;
}


int cc(int a,int b){

  if(a == 1){
    if(b == 0) return 5;
    if(b == 1) return 3;
    if(b == 2) return 2;
    if(b == 3) return 4;
  }
  if(a == 2){
    if(b == 0) return 1;
    if(b == 1) return 3;
    if(b == 2) return 6;
    if(b == 3) return 4;
  }
  
  if(a == 3){
    if(b == 0) return 5;
    if(b == 1) return 6;
    if(b == 2) return 2;
    if(b == 3) return 1;
  }
  
  if(a == 4){
    if(b == 0) return 5;
    if(b == 1) return 1;
    if(b == 2) return 2;
    if(b == 3) return 6;
  }
  
  if(a == 5){
    if(b == 0) return 6;
    if(b == 1) return 3;
    if(b == 2) return 1;
    if(b == 3) return 4;
  }
  
  if(a == 6){
    if(b == 0) return 5;
    if(b == 1) return 4;
    if(b == 2) return 2;
    if(b == 3) return 3;
  }
}