水题...
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <cstring>
#include <cmath>
#include <cstdlib>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
int main(int argc, char** argv) {
char in[105];
char out[105];
int flag[1005]={0};
char cunchu[1005];
int count = 0;
scanf("%s%s",in,out);
// printf("%s\n%s",in,out);
int i=0;
int j=0;
while(1)
{
if(in[i]==out[j])
{
i++;
j++;
if(i==strlen(in)-1)
{
break;
}
}
else if(in[i]!=out[j])
{
if(in[i]>='a'&&in[i]<='z')
{
in[i]-=32;
}
if(flag[in[i]]!=1)
{
cunchu[count++] = in[i];
flag[in[i]] = 1;
}
i++;
if(i==strlen(in)-1)
{
break;
}
}
}
for(int i=0;i<count;i++)
{
printf("%c",cunchu[i]);
}
//system("pause");
return 0;
}