HDU 5099 Comparison of Android versions【字符串+模拟】

Comparison of Android versions

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 1178    Accepted Submission(s): 474

Problem Description

As an Android developer, itˇs really not easy to figure out a newer version of two kernels, because Android is updated so frequently and has many branches. Fortunately, Google identifies individual builds with a short build code, e.g. FRF85B.

The first letter is the code name of the release family, e.g. F is Froyo. The code names are ordered alphabetically. The latest code name is K (KitKat).
The second letter is a branch code that allows Google to identify the exact code branch that the build was made from, and R is by convention the primary release branch.

The next letter and two digits are a date code. The letter counts quarters, with A being Q1 2009. Therefore, F is Q2 2010. The two digits count days within the quarter, so F85 is June 24 2010.

Finally, the last letter identifies individual versions related to the same date code, sequentially starting with A; A is actually implicit and usually omitted for brevity.

Please develop a program to compare two Android build numbers.

 

Input

The first line is an integer n (1 <= n <= 2000), which indicates how many test cases need to process.

Each test case consists of a single line containing two build numbers, separated by a space character.

 

Output

For each test case, output a single line starting with ¨Case #: 〃 (# means the number of the test case). Then, output the result of release comparison as follows:

● Print "<" if the release of the first build number is lower than the second one;
● Print "=" if the release of the first build number is same as he second one;
● Print ">" if the release of the first build number is higher than the second one.

Continue to output the result of date comparison as follows:
● Print "<" if the date of the first build number is lower than the second one;
● Print "=" if the date of the first build number is same as he second one;
● Print ">" if the date of the first build number is higher than the second one.

If two builds are not in the same code branch, just compare the date code; if they are in the same code branch, compare the date code together with the individual version.

 

Sample Input

  
  

   
   2
FRF85B EPF21B
KTU84L KTU84M
  
  

 

Sample Output

  
  

   
   Case 1: > >
Case 2: = <
  
  

 

Source

2014上海全国邀请赛——题目重现（感谢上海大学提供题目）

题目链接。

两次比较： 
1、比较发布版本号的大小（字母顺序）。
2、比较剩余代码的大小： 
①如果分支代码（第2个字母）不同，则只需比较日期代码（第3、4、5个字母）。 
②如果分支代码相同，则需比较剩余的四个字母（第3、4、5、6）。


个体版本，也就是最后一个字母，如果为A，通常为了简洁而省略不写。 

#include <cstdio>
#include <cstring>
const int maxn = 10;
char bn1[maxn],bn2[maxn];
char one,two;
void cmp1()
{
	if(bn1[0]>bn2[0]) one = '>';
	else if(bn1[0]==bn2[0]) one = '=';
	else one = '<';
}
void cmp2()
{
	int i;
	for(i=2;i<=4;++i)				//先直接比较日期代码 
		if(bn1[i]!=bn2[i])
		{
			if(bn1[i]>bn2[i]) two = '>';
			else two = '<';
			return ;
		}
	two = '=';
	if(bn1[1]==bn2[1])				//如果日期代码相同，则判断分支代码是否相同，相同则比较最后一个字母 
	{
		if(bn1[5]>bn2[5])  two= '>';
		else if(bn1[5]==bn2[5]) two = '=';
		else two = '<';
	}
}
int main()
{
	int n,k=1,flag;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%s%s",bn1,bn2);
		if(strlen(bn1)<6) bn1[5]='A';
		if(strlen(bn2)<6) bn2[5]='A';
		cmp1();
		cmp2();
		printf("Case %d: %c %c\n",k++,one,two);
	}
	return 0;
}