3 solutions
-
0
#include<bits/stdc++.h> using namespace std; int zxdvfsrtehj; int main() { cin>>zxdvfsrtehj; while(zxdvfsrtehj--){ string ckostg; cin>>ckostg; int dnjfogvn=0,idjfdjv=0; for(int i=0;i<ckostg.size();i++){ if(ckostg[i]>='A'&&ckostg[i]<='Z'){ dnjfogvn++; } if(ckostg[i]>='0'&&ckostg[i]<='9'){ idjfdjv++; } } if(ckostg.size()<8) cout<<"N"; else if(dnjfogvn==0) cout<<"N"; else if(idjfdjv==0) cout<<"N"; else cout<<'Y'; cout<<endl; } return 0; } -
0
#include <bits/stdc++.h> using namespace std; const int N=1e5; int s[N]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ string s; cin>>s; if(s.size()<8) { cout<<"N"<<endl; continue; } int x=0,y=0; for(int j=0;j<s.size();j++) { if(s[j]>='A'&& s[j]<='Z') y=1; else if(s[j]>='0'&&s[j]<='9') x=1; } if(x+y<2) cout<<"N"<<endl; else cout<<"Y"<<endl; } return 0; } -
0
#include<bits/stdc++.h> using namespace std; int main() { int n;cin>>n; for(int i=1;i<=n;i++) { int q=0,x=0; string s;cin>>s; if(s.size()<8) { cout<<"N"<<endl; continue; } for(int j=0;j<s.size();j++) { if(s[j]>='A'&&s[j]<='Z') q=1; else if(s[j]>='0'&&s[j]<='9') x=1; } if(q==1&&x==1) cout<<"Y"<<endl; else cout<<"N"<<endl; } return 0; }
- 1
Information
- ID
- 3019
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 1
- Tags
- # Submissions
- 40
- Accepted
- 13
- Uploaded By