Chinese Zodiac
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 1037 Accepted Submission(s): 654
Problem Description
The Chinese Zodiac, known as Sheng Xiao, is based on a twelve-year cycle, each year in the cycle related to an animal sign. These signs are the rat, ox, tiger, rabbit, dragon, snake, horse, sheep, monkey, rooster, dog and pig.
Victoria is married to a younger man, but no one knows the real age difference between the couple. The good news is that she told us their Chinese Zodiac signs. Their years of birth in luner calendar is not the same. Here we can guess a very rough estimate of the minimum age difference between them.
If, for instance, the signs of Victoria and her husband are ox and rabbit respectively, the estimate should be 2 years. But if the signs of the couple is the same, the answer should be 12 years.
Input
The first line of input contains an integer T (1≤T≤1000) indicating the number of test cases.
For each test case a line of two strings describes the signs of Victoria and her husband.
Output
For each test case output an integer in a line.
Sample Input
3 ox rooster rooster ox dragon dragon
Sample Output
8 4 12
Source
2017 ACM/ICPC Asia Regional Qingdao Online
问题简述:(略)
问题分析:
这个题是有关中国生肖的计算题。
Victoria与比她年轻的man结婚,知道2人的生肖,计算年龄的差。
使用map是最为简单的做法,用map存储生肖到数字的映射,查表计算一下就好了。
程序说明:(略)
题记:(略)
参考链接:(略)
AC的C++语言程序如下:
/* HDU6213 Chinese Zodiac */
#include <iostream>
#include <map>
using namespace std;
map<string, int> m;
int main()
{
ios::sync_with_stdio(false);
m["rat"] = 1;
m["ox"] = 2;
m["tiger"] = 3;
m["rabbit"] = 4;
m["dragon"] = 5;
m["snake"] = 6;
m["horse"] = 7;
m["sheep"] = 8;
m["monkey"] = 9;
m["rooster"] = 10;
m["dog"] = 11;
m["pig"] = 12;
int t;
cin >> t;
while(t--) {
string a, b;
cin >> a >> b;
printf("%d\n", a == b ? 12 : (m[b] - m[a] + 12) % 12);
}
return 0;
}