zoukankan      html  css  js  c++  java
  • Chinese Zodiac (水题)

    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 22 years. But if the signs of the couple is the same, the answer should be 1212 years.

    Input

    The first line of input contains an integer T (1≤T≤1000)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

    题解:感觉用map更好,但是我STL玩的还是不是特别好,就用二维字符数组代替了

    代码:

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    #include<map>
    
    using namespace std;
    
    
    int main()
    {
       char a[12][15]={"rat","ox","tiger","rabbit","dragon","snake","horse","sheep","monkey","rooster","dog","pig"};
       int n;
       cin>>n;
       char s1[15],s2[15];
       int k1,k2;
       for(int t=0;t<n;t++)
       {
       	
       	  scanf("%s%s",s1,s2);
       	  for(int j=0;j<12;j++)
       	  {
       	  	if(strcmp(s1,a[j])==0)
       	  	{
       	  	    k1=j;	
    		}
    		if(strcmp(s2,a[j])==0)
    		{
    			k2=j;
    		}
    	  }
    	  if(k1==k2)
    	  {
    	  	printf("12
    ");
    	  }
    	  if(k1<k2)
    	  {
    	  	printf("%d
    ",k2-k1);
    	  }
    	  if(k1>k2)
    	  {
    	  	printf("%d
    ",12+k2-k1);
    	  }
       }
    	return 0;
    }
  • 相关阅读:
    shell-条件测试
    51Nod 1279 扔盘子 (思维+模拟)
    51Nod 1042 数字0-9的数量(数位DP)
    Codeforces 1138B Circus (构造方程+暴力)
    51nod 1133 不重叠的线段 (贪心,序列上的区间问题)
    51nod 1091 线段的重叠(贪心)
    EOJ Monthly 2019.2 E 中位数 (二分+中位数+dag上dp)
    牛客练习赛39 C 流星雨 (概率dp)
    牛客练习赛39 B 选点(dfs序+LIS)
    Educational Codeforces Round 57
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10781963.html
Copyright © 2011-2022 走看看