Help Victoria the Wise（cf 07/22/2011）

题目链接：

http://codeforces.com/contest/99/problem/C

C. Help Victoria the Wise

time limit per test2 seconds

memory limit per test  256 megabytes

input: standard input

output: standard output

Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the surprise actually is because she cannot open the box. She hopes that you can help her in that.

The box's lock is constructed like that. The box itself is represented by an absolutely perfect black cube with the identical deepening on each face (those are some foreign nanotechnologies that the far away kingdom scientists haven't dreamt of). The box is accompanied by six gems whose form matches the deepenings in the box's faces. The box can only be opened after it is correctly decorated by the gems, that is, when each deepening contains exactly one gem. Two ways of decorating the box are considered the same if they can be obtained one from the other one by arbitrarily rotating the box (note that the box is represented by a perfect nanotechnological cube)

Now Vasilisa the Wise wants to know by the given set of colors the following: in how many ways would she decorate the box in the worst case to open it? To answer this question it is useful to know that two gems of one color are indistinguishable from each other. Help Vasilisa to solve this challenging problem.

Input

The first line contains exactly 6 characters without spaces from the set {R, O, Y, G, B, V} — they are the colors of gems with which the box should be decorated.

Output

Print the required number of different ways to decorate the box.

Sample test(s)

input

YYYYYY

output

1

input

BOOOOB

output

2

input

ROYGBV

output

30

这是一道暴力题。分六种情况，分别是只有1种，2种。。。。。。6种颜色。然后每种情况有几种组合，分别算出每种组合能够有几种涂色方案就可以了。

代码：

#include"iostream"

#include"string.h"

using namespace std;

 

int main()

{

char col[10];

int num[30];

int mm[10];

int k;

int counts;

while(cin>>col)

{

k = 0;

counts = 0;

memset(num,0,sizeof(num));

for(int i = 0;i<6;i++)

{

num[col[i]-'A']++;

}

for(int j = 0;j<26;j++)

{

if(num[j]>0)

{

counts++;

mm[k++] = num[j];

}

}

switch(counts)

{

case 1:cout<<1<<endl;break;

case 2:

{

if(mm[0]==1||mm[1]==1)

{

cout<<1<<endl;

break;

}

else

{

cout<<2<<endl;

break;

}

}

case 3:

{

if(mm[0]==3||mm[1]==3||mm[2]==3)

{

cout<<3<<endl;

break;

}

else

if(mm[0]==2&&mm[1]==2&&mm[2]==2)

{

cout<<6<<endl;

break;

}

else

{

cout<<2<<endl;

break;

}

}

case 4:

{

if(mm[0]==3||mm[1]==3||mm[2]==3||mm[3]==3)

{

cout<<5<<endl;

break;

}

else

{

cout<<8<<endl;

break;

}

}

case 5:

{

cout<<15<<endl;

break;

}

case 6:

{

cout<<30<<endl;

break;

}

}

}

return 0;

}