1050 String Subtraction
来源:互联网 发布:淘梦淘宝大学教程网 编辑:程序博客网 时间:2024/06/05 00:59
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.aeiouSample 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;}
0 0
- PAT 1050 String Subtraction
- PAT 1050 String Subtraction
- 1050 String Subtraction
- PAT 1050 String Subtraction (20)
- String Subtraction
- string subtraction
- Pat(Advanced Level)Practice--1050(String Subtraction)
- 1050. String Subtraction (20)
- 1050. String Subtraction
- PAT_1050: String Subtraction
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- PAT 1050. String Subtraction
- [哈希]PAT1050 String Subtraction
- 1050. String Subtraction
- 1050. String Subtraction (20)
- 1050. String Subtraction
- 设计模式之---策略模式
- 大数乘法模板
- jdbc连接oracle教程
- Linux---mkdir
- Java计算一个字符在另一个字符串出现的次数
- 1050 String Subtraction
- LeetCode -- Bitwise AND of Numbers Range
- android笔记 看过stormzhang大大的博客(关于像素,屏幕密度)
- Material Design(1)底部表单(Bottom sheets)
- 1040 Longest Symmetric String
- LeetCode -- Contains Duplicate II
- js几秒以后倒计时跳转示例
- Android setOnItemLongClickListener setOnItemClickListener 同时触发解决
- 计算机基础知识(软件开发和编程语言简介)