1050. String Subtraction (20)

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.

---

题目大意：

给定两个字符串S1和S2,S=s1-S2被定义为从S1中提取S2中的所有字符后得到剩余的字符串S。你的任务是简单计算任意给定的字符串S1-S2,然而，做起来不可能那么简单。
输入规格：
每个输入文件包含一个测试用例。每个测试用例分别由给定的字符串S1和S2组成。两个字符串的长度都不超过10的4次方。保证所有字符都是可见的ASCII码和空格，一个新的行字符表示字符串的结束。
输出规范：
对于每个测试用例，在一行中打印S1-S2。

代码：

#include<stdio.h>
char str[10001];
char str1[100001];
int arr[1000];
int main()
{
    int i,j,n,m,k,t;
    gets(str);
    gets(str1);
    for(i=0;str1[i]!='\0';i++)
    {
        arr[str1[i]]=1;
    }
    for(i=0;str[i]!='\0';i++)
    {
        if(arr[str[i]]==0)
        printf("%c",str[i]);
    }
    printf("\n");
    return 0;
}