1050 String Subtraction (20 分)

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<cstring>
using namespace std;
int main()
{
    int substract[128]={0};//用来存放“减数”中是否出现对应ASCII码值的字符
    char S1[10010],S2[10010];//用来存放“被减数”和“减数”字符串
    cin.getline(S1,10010);//因为字符串中可能出现空格，所以应该用cin.getline();
    cin.getline(S2,10010);
    int len1=strlen(S1),len2=strlen(S2);//len1，len2 分别存放被减数和减数字符串的长度
    for(int i=0;i<len2;i++)//遍历减数字符串，看都有哪些字符需要减去
        substract[S2[i]]=1;
    for(int i=0;i<len1;i++)//遍历被减数字符串，并判断该字符是否需要被减去
    {
        if(substract[S1[i]]==0)//若不需要被减去，则输出相应字符
            printf("%c",S1[i]);
    }
    return 0;
}