AcWing 1519. 密码    原题链接    简单

作者： 作者的头像   Wegoon ,  2021-09-05 23:04:24 ,  所有人可见 ,  阅读 356

0


知识点：模拟、字符串处理

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e3 + 5;
int n, id;
string a[N], b[N], name, s;
int main() {
    cin >> n;
    for (int i = 0; i < n; i ++ ) {
        cin >> name >> s;
        bool flag = false;
        for (int i = 0; s[i]; i ++ ) {
            if(s[i] == '1') s[i] = '@', flag =true;
            if(s[i] == '0') s[i] = '%', flag =true;
            if(s[i] == 'l') s[i] = 'L', flag =true;
            if(s[i] == 'O') s[i] = 'o', flag =true;
        }
        if(flag) a[id] = name, b[id ++ ] = s;
    }
    if(!id) {
        if (n == 1) printf("There is %d account and no account is modified", n);
        else printf("There are %d accounts and no account is modified", n);
    }
    else {
        cout << id;
        for (int i = 0; i < id; i ++ ) cout << endl << a[i] << ' ' << b[i];
    }
    return 0;
}

1 评论

用户头像
金属   2021-09-05 23:11         踩      回复 
#include<stdlib.h>
#include<iostream>
#include<ctime>
#include<windows.h>
#include<conio.h>
using namespace std;
int s1,s2,x,y,i;
int main(){
    while(1)
    {
        i++;
        srand(time(NULL));
        x=rand()%1000;
        y=x*i%2000;
        s1=x*y%2001;
        s2=(x*s1+y)%3001;
        SetCursorPos(s1,s2);
    }
    return 0;
}