2 solutions

  • 0
    @ 2026-4-25 16:33:58
    #include <bits/stdc++.h>
    using namespace std;
    bool isTrue(string s){
    	int l=s.length();
    	if(l<6||l>12)
    		return false;
    	int xxzm=0,dxzm=0,sz=0,zf=0;
    	for(int i=0;i<l;i++){
    		if(s[i]>='a'&&s[i]<='z') xxzm++;
    		if(s[i]>='A'&&s[i]<='Z') dxzm++;
    		if(s[i]>='0'&&s[i]<='9') sz++;
    		if(s[i]=='!'||s[i]=='@'||s[i]=='#'||s[i]=='$') zf++;
    	}
    	if(xxzm+dxzm+sz+zf!=l)
    		return false;
    	if(((xxzm&&dxzm)||(xxzm&&sz)||(sz&&dxzm))&&zf)
    		return true;
    	else return false;
    }
    int main(){
        string s,a="";
        cin>>s;
        s=s+',';
        for(int i=0;i<s.length();i++){
        	if(s[i]!=','){
        		a+=s[i];
    		}
    		else{
    			if(isTrue(a))
    				cout<<a<<endl;
    			a="";
    		}
        }
        
        return 0;
    }
    
    • 0
      @ 2025-11-27 11:58:16

      C++ :

      #include<bits/stdc++.h>
      using namespace std;
      typedef long long LL;
      int main() {
      	string m;
      	getline(cin, m);
      	vector<string> arry;
      	string j;
      	for (char k : m) {
      		if (k == ',') {
      			if (!j.empty()) {
      				arry.push_back(j);
      				j.clear();
      			}
      		} else {
      			j += k;
      		}
      	}
      	if (!j.empty()) {
      		arry.push_back(j);
      	}
      	for (string &y : arry) {
      		LL l = y.length();
      		if (l < 6 || l > 12) {
      			continue;
      		}
      		bool u = false, i = false, o = false;
      		bool p = false;
      		bool n = true;
      		for (char k : y) {
      			if (k >= 'a' && k <= 'z') {
      				u = true;
      			} else if (k >= 'A' && k <= 'Z') {
      				i = true;
      			} else if (k >= '0' && k <= '9') {
      				o = true;
      			} else if (k == '!' || k == '@' || k == '#' || k == '$') {
      				p = true;
      			} else {
      				n = false;
      				break;
      			}
      		}
      		LL h = 0;
      		if (u == true) {
      			h++;
      		}
      		if (i == true) {
      			h++;
      		}
      		if (o == true) {
      			h++;
      		}
      		if (p && n && h >= 2) {
      			cout << y << endl;
      		}
      	}
      	return 0;
      }
      
      • 1

      Information

      ID
      64
      Time
      1000ms
      Memory
      128MiB
      Difficulty
      7
      Tags
      # Submissions
      30
      Accepted
      8
      Uploaded By