zoukankan      html  css  js  c++  java
  • pat1084. Broken Keyboard (20)

    1084. Broken Keyboard (20)

    时间限制
    200 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    CHEN, Yue

    On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those keys will not appear on screen.

    Now given a string that you are supposed to type, and the string that you actually type out, please list those keys which are for sure worn out.

    Input Specification:

    Each input file contains one test case. For each case, the 1st line contains the original string, and the 2nd line contains the typed-out string. Each string contains no more than 80 characters which are either English letters [A-Z] (case insensitive), digital numbers [0-9], or "_" (representing the space). It is guaranteed that both strings are non-empty.

    Output Specification:

    For each test case, print in one line the keys that are worn out, in the order of being detected. The English letters must be capitalized. Each worn out key must be printed once only. It is guaranteed that there is at least one worn out key.

    Sample Input:
    7_This_is_a_test
    _hs_s_a_es
    
    Sample Output:
    7TI
    

    提交代码

     1 #include<cstdio>
     2 #include<stack>
     3 #include<algorithm>
     4 #include<iostream>
     5 #include<stack>
     6 #include<set>
     7 #include<map>
     8 #include<vector>
     9 using namespace std;
    10 set<char> s;
    11 vector<char> v;
    12 int main(){
    13     //freopen("D:\INPUT.txt","r",stdin);
    14     string s1,s2;
    15     cin>>s1>>s2;
    16     int i=0,j=0;
    17     while(i<s1.length()){
    18         if(s1[i]==s2[j]){
    19             j++;
    20         }
    21         else{
    22             if(s1[i]>='a'&&s1[i]<='z'){
    23                 s1[i]=s1[i]-'a'+'A';
    24             }
    25             if(!s.count(s1[i])){
    26                 s.insert(s1[i]);
    27                 v.push_back(s1[i]);
    28             }
    29         }
    30         i++;
    31     }
    32 
    33     vector<char>::iterator it;
    34     for(it=v.begin();it!=v.end();it++){
    35         cout<<*it;
    36     }
    37     cout<<endl;
    38     return 0;
    39 }
  • 相关阅读:
    微信小程序Rx 引入 调用合并的方法
    小程序 引入 es-canvas wx:for 单页面渲染多个for不同数据
    jquery操作数组对象
    Docker MySQL 8 主从配置
    CentOS 7 安装 LNMP
    lnmp1.6 配置负载均衡
    Nginx + PHP-FPM 参数优化、性能监视和问题排查
    「查缺补漏」巩固你的Nginx知识体系
    Android生成SHA1(证书指纹)
    android studio 如何把依赖导出成 jar
  • 原文地址:https://www.cnblogs.com/Deribs4/p/4784016.html
Copyright © 2011-2022 走看看