2014ACM集训13级PK赛4-A Stack or A Queue?
2014-03-15 21:17
351 查看
Description
Do you know stack and queue? They're both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first in first out" (FIFO) one.
Here comes the problem: given the order of some integers (it is assumed that the stack and queue are both for integers) going into the structure and coming out of it, please guess what kind of data structure it could be - stack or queue?
Notice that here we assume that none of the integers are popped out before all the integers are pushed into the structure.
Input
There are multiple test cases. The first line of input contains an integer
T (T <= 100), indicating the number of test cases. Then T test cases follow.
Each test case contains 3 lines: The first line of each test case contains only one integer
N indicating the number of integers (1 <= N <= 100). The second line of each test case contains
N integers separated by a space, which are given in the order of going into the structure (that is, the first one is the earliest going in). The third line of each test case also contains
N integers separated by a space, whick are given in the order of coming out of the structure (the first one is the earliest coming out).
Output
For each test case, output your guess in a single line. If the structure can only be a stack, output "stack"; or if the structure can only be a queue, output "queue"; otherwise if the structure can be either a stack or a queue, output "both", or else otherwise
output "neither".
Sample Input
Sample Output
stack
queue
both
neither
分别输入数据的输入和输出顺序,来判断是栈(先进后出),还是队列(先进先出)。
Do you know stack and queue? They're both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first in first out" (FIFO) one.
Here comes the problem: given the order of some integers (it is assumed that the stack and queue are both for integers) going into the structure and coming out of it, please guess what kind of data structure it could be - stack or queue?
Notice that here we assume that none of the integers are popped out before all the integers are pushed into the structure.
Input
There are multiple test cases. The first line of input contains an integer
T (T <= 100), indicating the number of test cases. Then T test cases follow.
Each test case contains 3 lines: The first line of each test case contains only one integer
N indicating the number of integers (1 <= N <= 100). The second line of each test case contains
N integers separated by a space, which are given in the order of going into the structure (that is, the first one is the earliest going in). The third line of each test case also contains
N integers separated by a space, whick are given in the order of coming out of the structure (the first one is the earliest coming out).
Output
For each test case, output your guess in a single line. If the structure can only be a stack, output "stack"; or if the structure can only be a queue, output "queue"; otherwise if the structure can be either a stack or a queue, output "both", or else otherwise
output "neither".
Sample Input
4 3 1 2 3 3 2 1 3 1 2 3 1 2 3 3 1 2 1 1 2 1 3 1 2 3 2 3 1
Sample Output
stack
queue
both
neither
分别输入数据的输入和输出顺序,来判断是栈(先进后出),还是队列(先进先出)。
#include <string.h> #include <stdio.h> #include <stdlib.h> int a[1000]; int main() { int N; scanf ("%d",&N); while (N--) { int zhan = 1,dui = 1; int n,i; scanf ("%d",&n); for (i = 0; i < n; i++) scanf ("%d",&a[i]); for (i = 0;i < n;i++) { int tmp; scanf ("%d",&tmp); if(tmp != a[n - i - 1]) { zhan = 0; } if(tmp != a[i]) { dui = 0; } } if (zhan) { if (dui) puts ("both"); else puts ("stack"); }else { if (dui) puts ("queue"); else puts ("neither"); } } return 0; }
相关文章推荐
- 2014ACM集训13级PK赛2-Somali Pirates
- 2014ACM集训13级PK赛3-Java Beans
- 2014ACM集训13级PK赛2-An Awful Problem
- 2014ACM集训13级PK赛2-Wu Xing
- 2014ACM集训13级PK赛5- Accurately Say "CocaCola"!
- 2014ACM集训13级PK赛4-Second-price Auction
- 2014ACM集训13级PK赛2-Ordinal Numbers
- 2014ACM集训13级PK赛4-80ers' Memory
- 2014ACM集训13级PK赛5-Easy Task
- 2014ACM集训13级PK赛2-Conic Section
- 2014ACM集训13级PK赛4-K-Nice
- 2014ACM集训13级PK赛2-Kagome Kagome
- 2014ACM集训13级PK赛4-Light Bulb
- 2014ACM集训13级PK赛5-Faster, Higher, Stronger
- 2014ACM集训13级PK赛2-Javabeans
- 2014ACM集训13级PK赛5-Give Me the Number
- 2014ACM集训13级PK赛2-Median
- 2014ACM集训13级PK赛3-Draw Something Cheat
- 2014ACM集训13级PK赛3-Modular Inverse
- 2014ACM集训13级PK赛3-Yet Another Story of Rock-paper-scissors