程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> POJ 3087 Shuffle'm Up

POJ 3087 Shuffle'm Up

編輯:C++入門知識

POJ 3087 Shuffle'm Up


Shuffle'm Up Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6625   Accepted: 3105

Description

A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips. Each stack may contain chips of several different colors.

The actual shuffle operation is performed by interleaving a chip from S1 with a chip from S2 as shown below for C = 5:

\

The single resultant stack, S12, contains 2 * C chips. The bottommost chip of S12 is the bottommost chip from S2. On top of that chip, is the bottommost chip from S1. The interleaving process continues taking the 2nd chip from the bottom of S2 and placing that on S12, followed by the 2nd chip from the bottom of S1 and so on until the topmost chip from S1 is placed on top of S12.

After the shuffle operation, S12 is split into 2 new stacks by taking the bottommost C chips from S12 to form a new S1 and the topmost C chips from S12 to form a new S2. The shuffle operation may then be repeated to form a new S12.

For this problem, you will write a program to determine if a particular resultant stack S12 can be formed by shuffling two stacks some number of times.

Input

The first line of input contains a single integer N, (1 ≤ N ≤ 1000) which is the number of datasets that follow.

Each dataset consists of four lines of input. The first line of a dataset specifies an integer C, (1 ≤ C ≤ 100) which is the number of chips in each initial stack (S1 and S2). The second line of each dataset specifies the colors of each of the C chips in stack S1, starting with the bottommost chip. The third line of each dataset specifies the colors of each of the C chips in stack S2 starting with the bottommost chip. Colors are expressed as a single uppercase letter (A through H). There are no blanks or separators between the chip colors. The fourth line of each dataset contains 2 * C uppercase letters (A through H), representing the colors of the desired result of the shuffling of S1 and S2 zero or more times. The bottommost chip’s color is specified first.

Output

Output for each dataset consists of a single line that displays the dataset number (1 though N), a space, and an integer value which is the minimum number of shuffle operations required to get the desired resultant stack. If the desired result can not be reached using the input for the dataset, display the value negative 1 (?1) for the number of shuffle operations.

Sample Input

2
4
AHAH
HAHA
HHAAAAHH
3
CDE
CDE
EEDDCC

Sample Output

1 2
2 -1

題目大意:洗牌,會玩牌的都懂(其實我愛打牌夠級*_*),分s1和s2,中間那幅圖一樣交叉合並成s,然後將s上下平分成兩份,下半部分作為新的s1,上半部分作為新的s2,然後再洗牌,一直做下去。分別給出s1和s2序列,和目標序列,問是否能洗成目標序列,若能輸出最少次數。
水題,模擬一下即可。 注意不可能出現目標序列的情況是:現在洗成目標序列之前,出現了循環。
#include 
#include 

const int maxn=105;
char result[2*maxn],s[2*maxn];
char or1[maxn],or2[maxn];

int main()
{
	int i,k,T,kcase=1,c,res;
	char s1[110],s2[110];
	scanf("%d",&T);
	while(T--){
		scanf("%d",&c);
		scanf("%s%s%s",s1,s2,result);
		strcpy(or1,s1);
		strcpy(or2,s2);
		int index1,index2;		
		res=0;
		do{
			index1=index2=0;
			for(i=0;i


  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved