1050. String Subtraction (20)
来源:互联网 发布:珠海知未科技有限公司 编辑:程序博客网 时间:2024/05/16 10:28
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<cstring>#include<cstdio>using namespace std;char s1[10004],s2[10004];int main(){ gets(s1); gets(s2); int len=strlen(s1); for (int i=0;i<len;i++) { if (strchr(s2,s1[i])!=NULL) ; else cout<<s1[i]; } return 0;}
阅读全文
0 0
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- 1050. String Subtraction (20)
- Linux--文件系统复习
- 强制umount nfs 文件系统
- mtr
- Java基础[6]-3-接口Comparator和Comparable
- NYOJ 17 (最长单调递增子序列) O (n*n) + O(n*lgn)
- 1050. String Subtraction (20)
- 第八天-Java常用类之二
- GET、POST区别
- Linux--进程复习
- Hdu 4093 ( Xavier is Learning to Count ) BZOJ2498 FFT+容斥原理
- jndi
- GitHub协同工作
- HDU-5759 Gardener Bo(线段树+分类讨论)
- 基于java的滤波器设计(IIR)