zoukankan      html  css  js  c++  java
  • HDU6213

    Chinese Zodiac

    Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
    Total Submission(s): 184    Accepted Submission(s): 135


    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 (1T1000) 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

     
     1 //2017-09-18
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 #include <algorithm>
     6 #include <map>
     7 
     8 using namespace std;
     9 
    10 map<string, int> mp;
    11 
    12 int main()
    13 {
    14     mp["rat"] = 1;
    15     mp["ox"] = 2;
    16     mp["tiger"] = 3;
    17     mp["rabbit"] = 4;
    18     mp["dragon"] = 5;
    19     mp["snake"] = 6;
    20     mp["horse"] = 7;
    21     mp["sheep"] = 8;
    22     mp["monkey"] = 9;
    23     mp["rooster"] = 10;
    24     mp["dog"] = 11;
    25     mp["pig"] = 12;
    26 
    27     int T;
    28     cin>>T;
    29     string str1, str2;
    30     while(T--){
    31         cin>>str1>>str2;
    32         int ans = ((mp[str2]-mp[str1])+12)%12;
    33         if(ans == 0)ans = 12;
    34         cout<<ans<<endl;
    35     }
    36 
    37     return 0;
    38 }
  • 相关阅读:
    在报表中录入数据时如何实现行列转换
    CNN卷积神经网络代码实现【基于Python,Tensorflow】
    Spark Word2Vec算法代码实现
    Spark ML逻辑回归
    SolrCloud搜索引擎集群搭建【伪分布式、完全分布式】
    Scala之List,Set及Map基本操作
    bs4爬虫入门
    Scrapy爬虫入门
    Solr参数详解【Web客户端,DIH数据导入】
    Python多态
  • 原文地址:https://www.cnblogs.com/Penn000/p/7542636.html
Copyright © 2011-2022 走看看