Win_Man的专栏

心有猛虎,细嗅蔷薇

1050 String Subtraction

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 - S2 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 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.

Output Specification:

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

Sample Input:
They are students.
aeiou
Sample Output:

Thy r stdnts.

#include<iostream>
#include<string>
using namespace std;
int main(){
	for(string s1;getline(cin,s1);){
		string s2;
		getline(cin,s2);
		int flag[257]={0};
		for(int i = 0;i < s2.length();i++){
			flag[s2[i]] = 1;
		}
		for(int i = 0; i < s1.length();i++){
			if(!flag[s1[i]]){
				cout<<s1[i];
			}
		}
		cout<<endl;
	}
	return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Win_Man/article/details/49962269
文章标签: pat
个人分类: PAT (Advanced Level)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

1050 String Subtraction

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭