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.

来源： <http://www.patest.cn/contests/pat-a-practise/1050>

 

1. #pragma warning(disable:4996)
2. #include <stdio.h>
3. #include <iostream>
4. #include <string>
6. using namespace std;
8. int main(void) {
9. char a[10010], c[128] = { 0 };
10. int count=0;
12. while (true)
13. {
14. scanf("%c", &a[count]);
15. if (a[count] == '\n')
16. break;
17. count++;
18. }
19. while (true)
20. {
21. char temp;
22. scanf("%c", &temp);
23. if (temp == '\n')
24. break;
25. c[temp]++;
26. }
27. for (int i = 0; i <= count; i++) {
28. if (c[a[i]] == 0)
29. printf("%c", a[i]);
30. }
32. return 0;
35. }

来自为知笔记(Wiz)

转载于:https://www.cnblogs.com/zzandliz/p/5023167.html