zoukankan      html  css  js  c++  java
  • A1050. 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.
    
     1 #include<cstdio>
     2 #include<iostream>
     3 using namespace std;
     4 char s1[10001], s2[10001];
     5 int main(){
     6     int hashTB[128] = {0,0};
     7     gets(s1);
     8     gets(s2);
     9     for(int i = 0; s2[i] != ''; i++)
    10         hashTB[s2[i]] = 1;
    11     for(int i = 0; s1[i] != ''; i++)
    12         if(hashTB[s1[i]] == 0)
    13             printf("%c", s1[i]);
    14     cin >> s1;
    15     return 0;
    16 }
    View Code
  • 相关阅读:
    【转】acm小技巧
    poj-1703-Find them, Catch them
    poj-1611-The Suspects
    poj-2236-Wireless Network
    hdu-4496-D-City
    hdu-1213-How Many Tables
    hdu-1856-More is better
    gcd和ex_gcd
    递归趣文
    算法实质【Matrix67】
  • 原文地址:https://www.cnblogs.com/zhuqiwei-blog/p/8495978.html
Copyright © 2011-2022 走看看