HDU5095

最新推荐文章于 2019-09-26 16:35:54 发布

原创最新推荐文章于 2019-09-26 16:35:54 发布 · 517 阅读

0 ·

CC 4.0 BY-SA版权

这个题就是个模拟题，小心点就不会错了。一遍AC

#include<iostream>

#include<cstdio>
#include<string.h>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<sstream>
#include<queue>

#define ll __int64
#define lll unsigned long long
#define MAX 1000009
#define MAXN 2009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007
#define clr(a) memset(a,0,sizeof(a))
#define clr1(a) memset(a,-1,sizeof(a))
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1

using namespace std;

inline ll Max(ll a,ll b)
{
return a>b?a:b;
}
inline ll Min(ll a,ll b)
{
return a<b?a:b;
}

int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("ans.txt","r", stdin);
#endif
int T;
int d = 1;
string str1,str2;
scanf("%d",&T);
while(T--)
{
cin>>str1>>str2;
int flag1 = 0;
int flag2 = 2;
if(str1[0]>str2[0]) flag1 = 1;
else if(str1[0]==str2[0]) flag1 = 2;
else flag1 = 3;
if(str1[1]!=str2[1])
{
for(int i = 2; i<=4; i++)
{
if(str1[i]>str2[i])
{
flag2 = 1;
break;
}
else if(str1[i]<str2[i])
{
flag2 = 3;
break;
}
}
}
else
{
for(int i = 2; i<=5; i++)
{
if(str1[i]>str2[i])
{
flag2 = 1;
break;
}
else if(str1[i]<str2[i])
{
flag2 = 3;
break;
}
}
}
printf("Case %d:",d++);
if(flag1==1)
printf(" >");
else if(flag1==2)
printf(" =");
else
printf(" <");

if(flag2==1)
printf(" >");
else if(flag2==2)
printf(" =");
else
printf(" <");
puts("");
}
return 0;
}