1050. String Subtraction (20)-PAT

1050. String Subtraction (20)

时间限制

10 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

Given two strings S₁ and S₂, S = S₁ - S₂ is defined to be the remaining string after taking all the characters in S₂ from S₁. Your task is simply to calculate S₁ - S₂ for any given strings. However, it might not be that simple to do it fast.

Input Specification:

Each input file contains one test case. Each case consists of two lines which gives S₁ and S₂, respectively. The string lengths of both strings are no more than 10⁴. It is guaranteed that all the characters are visible ASCII codes and white space, and a new line character signals the end of a string.

Output Specification:

For each test case, print S₁ - S₂ in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

推荐指数：※

来源：http://pat.zju.edu.cn/contests/pat-a-practise/1050

往简单了想就好了

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
#define  N 128
int main()
{
	int i=0,sum;
	bool is_exist[N];
	char ch;
	char str[10000];
	memset(is_exist,0,sizeof(is_exist));
	while(scanf("%c",&ch)&&ch!='\n'){
		is_exist[ch]=true;
		str[i++]=ch;
	}
	sum=i;
	while(scanf("%c",&ch)&&ch!='\n'){
		is_exist[ch]=false;
	}
	i=0;
	while(i<sum){
		if(is_exist[str[i]]!=false)
			printf("%c",str[i]);
		i++;
	}
	return 0;
}