ZOJ Problem Set - 3492||Kagome Kagome
来源:互联网 发布:服务器开放端口查看 编辑:程序博客网 时间:2024/04/26 17:44
Kagome kagome, kago no naka no tori waItsu itsu deyaru? Yoake no ban niTsuru to kame to subetta.Ushiro no shoumen daare?Translation:
Kagome kagome, the bird in the cage,when will you come out?In the evening of the dawn,the crane and turtle slipped.Who stands right behind you now?
Kagome Kagome is a Japanese children's game. One child is chosen as the oni (literally demon or ogre, but similar to the concept of "it" in tag) and sits blindfolded (or with their eyes covered). The other children join hands and walk in circles around the oni while singing the song for the game. When the song stops, the oni speaks aloud the name of the person behind him, and if he is correct, the person behind will exchange places with the oni.
Higurashi Tewi is playing Kagome Kagome with her n (n is even) friends as the oni now. She peeps to know who is right in front of her. Knowing the order of the children in circle and assuming that they keep distance evenly, it's easy to derive who is right behind her.
Input
There are multiple test cases. The first line of input is an integer T ≈ 100 indicating the number of test cases.
The first line of each test case starts with an even number 1 ≤ n ≤ 100, followed by the name of the child who is right in front of Higurashi Tewi. The second line contains exactly ndifferent names, listed in counterclockwise order. Name is an alphanumeric string whose length never exceeds 20. It's guaranteed that the child in front of Higurashi Tewi is always contained in the list exactly once.
Output
For each test case, output the name of the child who is right behind Higurashi Tewi.
Sample Input
32 AliceAlice Bob4 inuinu neko usagi kizune4 catdog cat rabbit fox
Sample Output
Bobusagifox
References
- http://en.wikipedia.org/wiki/Kagome_Kagome
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int main(){int t;cin >> t;while (t--){int n, i,j;char name[105][25];scanf("%d %s", &n, name[0]);for (i = 1; i <= n; i++)scanf("%s", name[i]);for (i = 1; i <= n; i++){if (strcmp(name[0], name[i]) == 0)break;}if (i <= n / 2)j = i + n / 2;elsej = (i + n/2) % n;printf("%s\n", name[j]);}return 0;}
- ZOJ Problem Set - 3492||Kagome Kagome
- zoj 3492 Kagome Kagome
- zoj 3492 Kagome Kagome
- ZOJ 3492 Kagome Kagome
- zoj 3492 Kagome Kagome
- ZOJ 3492 Kagome Kagome
- ZOJ 3492Kagome Kagome
- ZOJ-3492 Kagome Kagome
- ZOJ 3492Kagome Kagome
- ZOJ 3492 F - Kagome Kagome
- ZOJ 3488 Kagome Kagome
- Kagome Kagome
- F Kagome Kagome
- ZOJ3492 Kagome Kagome
- ZOJ3492-Kagome Kagome
- 2014ACM集训13级PK赛2-Kagome Kagome
- The 8th Zhejiang Provincial Collegiate Programming Contest-> Kagome Kagome
- The 8th Zhejiang Provincial Collegiate Programming Contest / F - Kagome Kagome
- 指针与数组的区别与联系
- ImageView出现警告[Accessibility]Missing contentDescription attribute on imag
- hdu-1695 GCD(容斥原理+欧拉函数)
- 题解_四月十九
- 深度解析上海互联网产业为何沉沦
- ZOJ Problem Set - 3492||Kagome Kagome
- Struts2的常用结果类型分析
- 工厂模式factory(创建型)
- 基本的排序算法之——插入排序法(稳定)(对于固定的空间数组或者顺序表)
- HTML5 实战之 Video Events and API
- 几种常用的适配器--Adapter
- 进程调度时机跟踪分析进程调度与进程切换的过程
- 构造器的调用顺序
- 使用SQL时,用一条命令上传多行数据