zoukankan      html  css  js  c++  java
  • poj3087 Shuffle'm Up

    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,然后使它们合成一个字符串,合成的规则是s2的最前一个字符作为新字符串的开头字母,再是s1的最前一个字符,这样一次夹着排列,组合成新的字符串,如果和目标字符串一致,就输出要变化的次数,否则新字符串的前n个字符变成s1,后n个变成s2,再合成。
    #include<stdio.h>
    #include<string.h>
    char s[400],s1[400],s2[400],str[400],str1[400];
    int main()
    {
    	int T,n,m,i,j,h,num;
    	scanf("%d",&T);
    	for(h=1;h<=T;h++)
    	{
    		scanf("%d",&n);
    		scanf("%s%s%s",s1,s2,s);
    		strcpy(str1,s1);
    		num=0;
    		memset(str,0,sizeof(str));
    		for(j=1;j<=100000;j++)
    		{
    			for(i=0;i<n;i++){
    				str[i*2]=s2[i];str[i*2+1]=s1[i];
    			}
    			str[2*n]='';
    			num++;
    			if(strcmp(str,s)==0){
    				break;
    			}
    			for(i=0;i<n;i++){
    				s1[i]=str[i];
    			}
    			for(i=n;i<2*n;i++){
    				s2[i-n]=str[i];
    			}
    		}
    		if(num>=99999)printf("%d %d
    ",h,-1);
    	        else	printf("%d %d
    ",h,num);
    	}
    	return 0;
    }
    
  • 相关阅读:
    SAP UI5 formatter的工作原理
    SAP UI5 Negative cache的工作原理
    使用View modification扩展SAP Fiori应用的一个案例
    SAP Fiori应用没能从Fiori Launchpad启动的一个可能原因及分析过程
    使用扩展方式隐藏SAP Fiori应用某个表格标签页的实际案例
    使用Source Monitor检测Java代码的环复杂度
    一个小技巧,快速找出一段ABAP代码里访问到的所有透明表
    如何提取SAP UI5 XML view里定义的字段元素绑定信息(binding path)
    使用扩展技术将SAP Fiori应用隐藏动态创建的UI字段
    使用扩展技术对SAP Fiori应用进行端到端的增强,一个实际案例介绍
  • 原文地址:https://www.cnblogs.com/herumw/p/9464816.html
Copyright © 2011-2022 走看看