1008Chinese Zodiac

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

心得：
比赛过程中，我写的AC的程序是下面这个。比赛结束后我发现大佬们用的都是map容器，并没有用二维数组。

映射：map
map就是从键(key)到值(value)的映射。因为重载了[]运算符，map像是数组的“高级版”。例如可以用一个map<string,int>month_name来表示“月份名字到月份编号”的映射，然后用month_name[“July”]=7这样的方式来赋值。

我的代码：

#include <iostream>
#include <string.h>
using namespace std;
int main()
{
    char age[12][12]={"rat", "ox", "tiger", "rabbit", "dragon", "snake", "horse", "sheep", "monkey", "rooster", "dog", "pig"},str1[12],str2[12];
    int t;
    cin>>t;
    while(t--)
    {
        int cnt1,cnt2,res;
        cin>>str1>>str2;
        for(int i=0;i<12;i++)
        {
            if(strcmp(age[i],str1)==0)
                cnt1=i;
            if(strcmp(age[i],str2)==0)
                cnt2=i;
        }
        res=cnt2-cnt1;
        if(res<0)
            res+=12;
        if(res==0)
            res=12;
        cout<<res<<endl;
    }
}

大佬的代码（借助map）：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<map>
#include<string>
using namespace std;
map<string,int> M;
int main()
{
    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 n;
    cin>>n;
    while(n--)
    {
        string str1,str2;
        cin>>str1>>str2;
        int x=M[str2]-M[str1];
        x=(x+12)%12;
        if(x==0) x=12;
        cout<<x<<endl;
    }
    return 0;
}