社区讨论

20pts 求条

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

讨论操作

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

当前回复
0 条
当前快照
1 份
快照标识符
@mm8l7tp6
此快照首次捕获于
2026/03/02 10:56
上周
此快照最后确认于
2026/03/04 22:05
6 天前
查看原帖
#1 AC
#2~#5 WA
CPP
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int num[7];

int get(string s) {
	if (s == "another" || s == "one" || s == "a" || s == "first") return 1;
	if (s == "two" || s == "both" || s == "second") return 2;
	if (s == "three" || s == "third") return 3;
	if (s == "four") return 4;
	if (s == "five") return 5;
	if (s == "six") return 6;
	if (s == "seven") return 7;
	if (s == "eight") return 8;
	if (s == "nine") return 9;
	if (s == "ten") return 10;
	if (s == "eleven") return 11;
	if (s == "twelve") return 12;
	if (s == "thirteen") return 13;
	if (s == "fourteen") return 14;
	if (s == "fifteen") return 15;
	if (s == "sixteen") return 16;
	if (s == "seventeen") return 17;
	if (s == "eighteen") return 18;
	if (s == "nineteen") return 19;
	if (s == "twenty") return 20;
	return -1;
}

int main() {
    for (int i = 1; i <= 6; i ++){
        string x;
        cin >> x; 
        if (get(x) == -1) continue;
        num[i] = get(x) * get(x) % 100;
    }
    sort(num + 1, num + 7);
    for (int i = 1; i <= 7; i ++)
        if (num[i] > 0)
            cout << num[i];
    return 0;
}

回复

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

正在加载回复...