[summer daily question] Luogu p6461 [coci2006-2007 5] trik

Topic link ：P6461 [COCI2006-2007#5] TRIK - Luogu | New ecology of computer science education (luogu.com.cn)

Title Description

A cup with three cups facing down , There is a small ball under the leftmost Cup .

Next , Perform a series of transposition operations on the three cups , The operation is represented by a string , among A  B C  They correspond to the three transposition modes shown in the above figure .

You need to find out which cup the final ball is under .

Input format

Enter one string per line , Indicates the order of operations , Ensure that the operands do not exceed 50 , And each letter is A B C  One of the , No spaces .

Output format

Output a line of integers ：

- If the ball is under the cup on the left ： Output 1;
- If the ball is under the middle Cup ： Output 2;
- If the ball is under the cup on the right ： Output 3.

Examples #1

The sample input #1

AB

Sample output #1

3

Examples #2

The sample input #2

CBABCACCC

Sample output #2

1

Tips

explain

The title is translated from  COCI2006-2007 CONTEST #5 T1 TRIK.

AC code:

#include<iostream>
#include<algorithm>

using namespace std;

int main()
{
	int a[3]={1,0,0};
	string x;
	cin>>x;
	for(auto i:x)
	{
		switch(i)
		{
			case 'A':
			{
				swap(a[0],a[1]);
				break;
			}
			case 'B':
			{
				swap(a[1],a[2]);
				break;
			}
			case 'C':
			{
				swap(a[0],a[2]);
				break;
			}
		}
	}
	for(int i=0;i<3;i++)
	{
		if(a[i]==1)
		{
			cout<<i+1;
			return 0;
		}
	}
	
}