6120 Problem D String Subtraction (20)

問題 D: String Subtraction (20)

時間限制: 1 Sec  內存限制: 32 MB

題目描述

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

輸入

Each input file contains one test case. Each case consists of two lines which gives S1 and S2, respectively. The string lengths of both strings are no more than 104. 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.

輸出

For each test case, print S1 - S2 in one line.

樣例輸入

They are students.
aeiou

樣例輸出

Thy r stdnts.

經驗總結

題意是給出兩個字符串,輸出將第二個字符串中出現的字符去除的第一個字符串,難度不大~~

AC代碼

#include <cstdio>
#include <cstring>
int main()
{
	char s1[10010],s2[10010];
	int flag[255];
	while(gets(s1))
	{
		memset(flag,0,sizeof(flag));
		gets(s2);
		for(int i=0;s2[i]!='\0';++i)
			flag[s2[i]]=true;
		for(int i=0;s1[i]!='\0';++i)
			if(flag[s1[i]]==false)
				printf("%c",s1[i]);
	}
	return 0;
} 

 

發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章