社区讨论

啊啊啊!为什么RE!!

P1603斯诺登的密码参与者 1已保存回复 0

讨论操作

快速查看讨论及其快照的属性,并进行相关操作。

当前回复
0 条
当前快照
1 份
快照标识符
@m0ae99k7
此快照首次捕获于
2024/08/26 10:43
2 年前
此快照最后确认于
2024/08/26 13:41
2 年前
查看原帖
CPP
#include <bits/stdc++.h>
#define int long long
using namespace std;
string a[]={"one","two","three","four","five","six","seven","eight","nine","eleven","twelve",
"thirteen","fourteen","fifteen","sixteen","seventeen","eighteen","nineteen","a","both","another",
"first","second","third"};
int b[]={1,4,9,16,25,36,49,64,81,21,44,69,96,25,56,89,24,61,1,4,1,1,4,9};
int data[10001];
bool cmp (int x, int y)
{
	return x < y;
}
signed main()
{
    string s;
    int q = 0;
    for (int i=1; i<=6; ++i)
    {
    	std::cin >> s;
    	for (int j=0; j<=23; ++j)
    	{
    		if (s.length() == a[j].length())
    		{
    			bool flag = true;
    			for (int x=0; x<s.length(); ++x)
    			{
    				if(s[x] != a[j][x])
    				{
    					flag = false;
					}
				}
				if(flag == true)
				{
					data[++q] = b[j];
				}
			}
		}
	}
	if (q == 0)
	{
		putchar(48); 
		return 0;
	}
	sort (data+1, data+q+1, cmp);
	std::cout << data[1];
	for (int i=2; i<=q; ++i)
	{
		std::cout << data[i];
	} 
    return 1;
}

回复

0 条回复,欢迎继续交流。

正在加载回复...