B3843密码合规 0pts求助(求助大佬NOI必金
  • 板块学术版
  • 楼主NEYCzsj
  • 当前回复1
  • 已保存回复1
  • 发布时间2024/8/29 10:50
  • 上次更新2024/8/29 14:05:24
查看原帖
B3843密码合规 0pts求助(求助大佬NOI必金
1126949
NEYCzsj楼主2024/8/29 10:50
#include<bits/stdc++.h>
using namespace std;
string str[10001];
char x;
bool a=1;
bool cnt1,cnt2,cnt3,cnt4;
int daxie(string x)
{
	for (auto p:x)
	{
		if (p>='A'&&p<='Z')
		cnt1=1;
	}
	return cnt1;
}
int xiaoxie(string x)
{
	for (auto p:x)
	{
		if (p>='a'&&p<='z')
		cnt2=1;
	}
	return cnt2;
}
int shuzi(string x)
{
	for (auto p:x)
	{
		if (p>='0'&&p<='9')
		cnt3=1;
	}
	return cnt3;
}
int teshu(string x)
{
	for (auto p:x)
	{
		if (p=='!'||p=='@'||p=='$'||p=='#')
		cnt4=1;
	}
	return cnt4;
}
int main()
{
	int cnt=1;
	while(cin>>x)
	{
		if (x==',')
		{
			cnt++;
		}
		else
		{
			str[cnt]=str[cnt]+x;
		}
	}
	for (int i=1;i<=cnt;i++)
	{
		a=1;
		int sum=daxie(str[i])+shuzi(str[i])+xiaoxie(str[i]);
		for (int j=0;j<str[i].size();j++)
		{
			if ((str[i][j]=='!'||str[i][j]=='@'||str[i][j]=='#'||str[i][j]=='$')||(str[i][j]>='a'&&str[i][j]<='z')||(str[i][j]>='A'&&str[i][j]<='Z')||(str[i][j]>='0'&&str[i][j]<='9'))
			{
				continue;
			}
			else
			{
				a=0;
			}
		}
		if (a==1&&(str[i].size()>=6&&str[i].size()<=12)&&sum>=2&&teshu(str[i])==1)
		cout<<str[i]<<endl;
	}
	return 0;
}
2024/8/29 10:50
加载中...