社区讨论
40分TOT!!!
P1603斯诺登的密码参与者 2已保存回复 1
讨论操作
快速查看讨论及其快照的属性,并进行相关操作。
- 当前回复
- 1 条
- 当前快照
- 1 份
- 快照标识符
- @mbwc3v20
- 此快照首次捕获于
- 2025/06/14 22:31 8 个月前
- 此快照最后确认于
- 2025/11/04 07:10 4 个月前
CPP
#include<iostream>
#include<cmath>
#include<map>
using namespace std;
map<string, int>dic;
string s;
int a[1000001], k;
int main() {
dic["one"] = 1;
dic["two"] = 2;
dic["three"] = 3;
dic["four"] = 4;
dic["five"] = 5;
dic["six"] = 6;
dic["seven"] = 7;
dic["eight"] = 8;
dic["nine"] = 9;
dic["ten"] = 10;
dic["eleven"] = 11;
dic["twelve"] = 12;
dic["thirteen"] = 13;
dic["fourteen"] = 14;
dic["fifteen"] = 15;
dic["sixteen"] = 16;
dic["seventeen"] = 17;
dic["eighteen"] = 18;
dic["nineteen"] = 19;
dic["twenty"] = 20;
dic["first"] = 1;
dic["second"] = 2;
dic["third"] = 3;
dic["another"] = 1;
dic["a"] = 1;
dic["both"] = 1;
for (int i = 1; i <= 6; ++i) {
cin >> s;
if (dic[s]) {
if (dic[s]*dic[s] % 100 != 0)a[++k] = dic[s] * dic[s] % 100;
}
}
for(int i=1;i<k;++i){
for(int j=i+1;j<=k;++j){
if(a[j]<a[i])swap(a[j],a[i]);
}
}
cout<<a[1];
for(int i=2;i<=k;++i){
if(a[i]<10)cout<<' ';
cout<<a[i];
}
return 0;
}
回复
共 1 条回复,欢迎继续交流。
正在加载回复...