zoukankan      html  css  js  c++  java
  • 2017 ACM/ICPC Asia Regional Qingdao Online

    2017-09-17 13:28:04

    writer:pprp

     签到题:1008 Chinese Zodiac 

    #include <iostream>
    #include <string>
    #include <cstdio>
    #include <algorithm>
    #include <cmath>
    
    using namespace std;
    
    string str[12] = {"rat", "ox", "tiger", "rabbit", "dragon", "snake", "horse", "sheep", "monkey", "rooster", "dog","pig"};
    
    int main()
    {
        //freopen("in.txt","r",stdin);
        int cas;
        cin >> cas;
        while(cas--)
        {
            string st1,st2;
            cin >> st1 >> st2;
            int num1, num2;
            for(int i = 0 ; i < 12; i++)
            {
                if(st1 == str[i])
                    num1 = i;
                if(st2 == str[i])
                    num2 = i;
            }
    //        cout << num1 <<" " << num2 << endl;
            if(num1 == num2 )
                cout << 12 << endl;
            else if(num1 > num2)
            {
                int Min = 12-abs(num1-num2);
                cout << Min << endl;
            }
            else
            {
                cout << num2-num1 << endl;
            }
    
        }
        return 0;
    }
  • 相关阅读:
    stack 栈
    链表
    2018.09.08 DL24 Day1 总结
    10.07 WZZX Day2总结
    10.06 WZZX Day1总结
    Joseph问题 (线段树)
    [POI2006]TET-Tetris 3D
    10.05FZSZ Day2模拟总结
    Tarjan求LCA
    数据结构
  • 原文地址:https://www.cnblogs.com/pprp/p/7535326.html
Copyright © 2011-2022 走看看