/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 532.0 KiB

Code

//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; while (t--)
const int N = 1e9 + 7;
using namespace std;
void s()
{
    string s;
    cin >> s;
    bool up = false;
    bool low = false;
    bool dig = false;
    bool charr = false;
    string chars = "!@#$%^&*()";
    for(int i=0;i<s.size();i++) {
        if(s[i]>='a' && s[i]<='z') {
            low = true;
        }
        if(s[i]>='A' && s[i]<='Z') {
            up = true;
        }
        if(s[i]>='0' && s[i]<='9') {
            dig = true;
        }
        if(s[i]=='!' ||s[i]=='@' ||s[i]=='#' ||s[i]=='$' ||s[i]=='%' ||s[i]=='^' ||s[i]=='&' ||
           s[i]=='*' ||s[i]=='(' ||s[i]==')') {
            charr = true;
           }
    }

    if(up && low && dig && charr && (s.size()>=8)) {
        cout << "valid" << endl;
    }
    else {
        cout << "invalid" << endl;
    }
}
int32_t main()
{   ios::sync_with_stdio(false);

    TC
    s();


}




Information

Submit By
Type
Submission
Problem
P1007 Password Checker
Contest
Beta Round #1
Language
C++17 (G++ 13.2.0)
Submit At
2023-11-29 16:11:43
Judged At
2024-10-03 14:11:14
Judged By
Score
100
Total Time
2ms
Peak Memory
532.0 KiB