题目:
输入样例 1:
1112031584
011102315849
输出样例 1:
112358
输入样例 2:
111203158412334
12341112031584
输出样例 2:
1123583
112358
代码:
#include <stdio.h>
#include <string.h>
int max(int a,int b)
{
return a>b?a:b;
}
int main()
{
const int N = 1e4+6;
char ch1[N];
char ch2[N];
char jg1[N];
char jg2[N];
gets(ch1);
gets(ch2);
int sz1 = strlen(ch1);
int sz2 = strlen(ch2);
int j = 0;
for(int i = 1;i<sz1;i++)//模拟题目代码
{
if(ch1[i]%2 == ch1[i-1]%2)
jg1[j++] = max(ch1[i],ch1[i-1]);
}
j = 0;
for(int i = 1;i<sz2;i++)//模拟题目代码
{
if(ch2[i]%2 == ch2[i-1]%2)
jg2[j++] = max(ch2[i],ch2[i-1]);
}
if(strcmp(jg1,jg2) == 0)//比较两个结果
printf("%s\n",jg1);
else
{
printf("%s\n",jg1);
printf("%s\n",jg2);
}
return 0;
}
结果: