zoukankan      html  css  js  c++  java
  • 1035 Password (20)

    To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (zero) from O (o in uppercase). One solution is to replace 1 (one) by @, 0 (zero) by %, l by L, and O by o. Now it is your job to write a program to check the accounts generated by the judge, and to help the juge modify the confusing passwords.

    Input Specification:

    Each input file contains one test case. Each case contains a positive integer N (<= 1000), followed by N lines of accounts. Each account consists of a user name and a password, both are strings of no more than 10 characters with no space.

    Output Specification:

    For each test case, first print the number M of accounts that have been modified, then print in the following M lines the modified accounts info, that is, the user names and the corresponding modified passwords. The accounts must be printed in the same order as they are read in. If no account is modified, print in one line "There are N accounts and no account is modified" where N is the total number of accounts. However, if N is one, you must print "There is 1 account and no account is modified" instead.

    Sample Input 1:

    3
    Team000002 Rlsp0dfa
    Team000003 perfectpwd
    Team000001 R1spOdfa
    

    Sample Output 1:

    2
    Team000002 RLsp%dfa
    Team000001 R@spodfa
    

    Sample Input 2:

    1
    team110 abcdefg332
    

    Sample Output 2:

    There is 1 account and no account is modified
    

    Sample Input 3:

    2
    team110 abcdefg222
    team220 abcdefg333
    

    Sample Output 3:

    There are 2 accounts and no account is modified



     1 #include<iostream>
     2 #include<vector>
     3 using namespace std;
     4 struct node{
     5   string id, psd;
     6 };
     7 
     8 
     9 int main(){
    10   int n, i;
    11   cin>>n;
    12   node nnode;
    13   vector<node> v;
    14   vector<int> exist(128, -1);
    15   exist['1']=1; exist['0'] = 1; exist['l']=1; exist['O']=1;
    16   vector<char> chg(128);
    17   chg['1'] = '@'; chg['0'] = '%'; chg['l']='L'; chg['O']='o';
    18   for(i=0; i<n; i++){
    19     cin>>nnode.id>>nnode.psd;
    20     bool flag=false;
    21     for(int j=0; j<nnode.psd.size(); j++){
    22       if(exist[nnode.psd[j]]==1){
    23         nnode.psd[j]=chg[nnode.psd[j]];
    24         flag=true;
    25       }
    26     }
    27     if(flag) v.push_back(nnode);
    28   }
    29   if(v.size()!=0) cout<<v.size()<<endl;
    30   for(i=0; i<v.size(); i++) cout<<v[i].id<<" "<<v[i].psd<<endl;
    31   if(v.size()==0 && n==1) cout<<"There is 1 account and no account is modified"<<endl;
    32   if(v.size()==0 && n>1) cout<<"There are "<<n<<" accounts and no account is modified"<<endl;
    33   return 0;
    34 }
    有疑惑或者更好的解决方法的朋友,可以联系我,大家一起探讨。qq:1546431565
  • 相关阅读:
    在京东云擎上搭建自己的网站
    在新浪SAE上搭建自己的网站!
    GitHub在windows上代码管理教程
    mongodb在windows下安装教程
    nodejs在windows平台下搭建部署环境教程
    Windows下搭建PHP开发环境,整合Apache+PHP+MySQL(举例软件为32位)
    IIS7发布 EF MVC项目提示404.0页面错误解决方案
    “VS无法连接远程数据库”解决方案
    easyui的 getSelections 与 getSelected 对比区别
    Linq中int转String(解决LINQ to Entities 不识别方法"System.String ToString()",因此该方法无法转换为存储表达式.)
  • 原文地址:https://www.cnblogs.com/mr-stn/p/9178650.html
Copyright © 2011-2022 走看看