qz,样例过,全WA
查看原帖
qz,样例过,全WA
577241
违规用户名577241楼主2023/7/24 17:18
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
using namespace std;
const int maxn=2e3+5;
const int maxn1=2e3+5;
string s;
string ans[maxn1];
string a[maxn1];
int main()
{
	cin>>s;
	int tot=0;
	int beginning,ends;
	int len=s.length();
	for(int i=0;i<len;i++)
	{
		if((s[i]>='a'&&s[i]<='z')
		||(s[i]>='0'&&s[i]<='9')
		||(s[i]>='A'&&s[i]<='Z'))
		{
			ans[tot]+=s[i];
		}
		else
		{
			tot++;
			ans[tot]=' ';
			tot++;
			continue;
		}
	}
	for(int i=0;i<=tot;i++)
	{
		int lena=ans[i].length();
		for(int j=0;j<lena;j++)
		{
			if(ans[i][j]>='a'&&ans[i][j]<='z')
			{
				a[i][j]=ans[i][j]-32;
			}
			if(ans[i][j]>='A'&&ans[i][j]<='Z')
			{
				a[i][j]=ans[i][j]+32;
			}
			if(ans[i][j]>='0'&&ans[i][j]<='9')
			{
				char tmp;
				tmp=ans[i][j];
				a[i][j]=ans[i][lena-j-1];
				a[i][lena-j-1]=tmp;
			}
		}
	}
	for(int i=tot;i>=0;i--)
	{
		for(int j=0;j<ans[i].length();j++)
		{
			cout<<a[i][j];
		}
	}
	return 0;
}
2023/7/24 17:18
加载中...