模拟/poj 3087 Shuffle'm Up

 1 #include<cstdio>
 2 #include<cstring>
 3 using namespace std;
 4 char s1[110],s2[110],ss[220];
 5 int len,n;
 6
 7 int f()
 8 {
 9     int ans=0;
10     char t1[110],t2[110],tt[220];
11     strcpy(t1,s1);strcpy(t2,s2);
12     while (1)
13     {
14         ans++;
15         for (int i=0;i<len;i++)
16         {
17             tt[i*2]=t2[i];
18             tt[i*2+1]=t1[i];
19         }
20         tt[2*len]=‘\0‘;
21         if (strcmp(tt,ss)==0) return ans;
22         for (int i=0;i<len;i++)
23         {
24             t1[i]=tt[i];
25             t2[i]=tt[i+len];
26         }
27         t1[len]=‘\0‘;
28         t2[len]=‘\0‘;
29         if (strcmp(t1,s1)==0 && strcmp(t2,s2)==0) break;
30     }
31     return -1;
32 }
33
34 int main()
35 {
36     scanf("%d",&n);
37     for (int t=1;t<=n;t++)
38     {
39         scanf("%d %s %s %s",&len,s1,s2,ss);
40         printf("%d %d\n",t,f());
41     }
42     return 0;
43 }

时间： 2024-10-05 04:58:08

模拟/poj 3087 Shuffle'm Up的相关文章

POJ 3087 Shuffle'm Up (模拟+map)

题目链接:http://poj.org/problem?id=3087 题目大意:已知两堆牌s1和s2的初始状态, 其牌数均为c,按给定规则能将他们相互交叉组合成一堆牌s12,再将s12的最底下的c块牌归为s1,最顶的c块牌归为s2,依此循环下去. 现在输入s1和s2的初始状态以及预想的最终状态s12.问s1 s2经过多少次洗牌之后,最终能达到状态s12,若永远不可能相同,则输出"-1". 解题思路:照着模拟就好了,只是判断是否永远不能达到状态s12需要用map,定义map<

POJ 3087 Shuffle'm Up （模拟）

Shuffle'm Up Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5850 Accepted: 2744 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

POJ 3087 Shuffle&#39;m Up(模拟)

Shuffle'm Up Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7404 Accepted: 3421 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

poj 3087 Shuffle'm Up （模拟搜索）

Shuffle'm Up Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5953 Accepted: 2796 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

POJ 3087 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

poj 3087 Shuffle'm Up (模拟过程)

poj 3087 Shuffle'm Up(模拟题)

Shuffle'm Up Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6143 Accepted: 2880 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

POJ 3087 Shuffle'm Up（模拟）

题意给两堆牌s1,s2交给你洗每堆有c张每次洗牌得到s12 其中s2的最下面一张在s12的最下面一张然后按顺序一张s1一张s2 洗好之后可以把s12下面的c张做s1 上面的c张做s2 求多少次洗牌之后可以得到输入给你的串s 不能得到输出-1 简单模拟 s1+s2!=s就一直洗牌如果回到初始状态都没得到s就不会得到s了得到s就可以输出洗牌次数了 #include<iostream> #include<string> using namespace

POJ 3087 Shuffle'm Up （DFS）

题目链接:Shuffle'm Up 题意:有a和b两个长度为n的字符序列,现定义操作: 将a.b的字符交叉合并到一个序列c,再将c最上面的n个归为a,最下面n个归为b 给出a,b和目标序列c,问最少多少次操作a.b转化为c 解析:将a.b放入哈希表,然后模拟操作过程直接dfs即可. AC代码: #include <cstdio> #include <iostream> #include <cstring> #include <map> using names