Submission #1496887
Source Code Expand
#include<cstdio> #include<iostream> #include<algorithm> #include<string> #include<queue> #include<vector> #include<functional> #include<cmath> #include<map> #include<stack> #include<set> #include<numeric> #include<limits> #include<iterator> #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() using namespace std; typedef long long ll; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<ll, char> plc; vector<string> spel = { "nil","un","bi","tri","quad","pent","hex","sept","oct","enn" }; vector<string> spel1 = { "nilium","unium","bium","trium","quadium","pentium","hexium","septium","octium","ennium" }; int main() { string n,str; cin >> n; int size_0 = spel[0].size(); int size_1 = spel[1].size(); if (spel[n[0] - '0'][size_0 - 1] == spel[n[1] - '0'][0])spel[n[1] - '0'][0] = ' '; if (spel[n[1] - '0'][size_1 - 1] == spel1[n[2] - '0'][0])spel1[n[2] - '0'][0] = ' '; str = spel[n[0] - '0'] + spel[n[1] - '0'] + spel1[n[2]-'0']; str[0] = toupper(str[0]); for (int i = 0; i < str.size(); i++) { if (str[i] == ' ')continue; cout << str[i]; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 元素の系統名 |
User | jj |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1177 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | basic_case00, basic_case01, basic_case02, basic_case03, basic_case04, basic_case05, basic_case06, basic_case07, basic_case08, basic_case09, basic_case10, basic_case11, basic_case12, basic_case13, basic_case14, basic_case15, basic_case16, basic_case17, basic_case18, basic_case19, basic_case20, basic_case21, basic_case22, basic_case23, basic_case24, basic_case25, basic_case26, basic_case27, basic_case28, basic_case29, sample00, sample01 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
basic_case00 | AC | 1 ms | 256 KB |
basic_case01 | AC | 1 ms | 256 KB |
basic_case02 | AC | 1 ms | 256 KB |
basic_case03 | AC | 1 ms | 256 KB |
basic_case04 | AC | 1 ms | 256 KB |
basic_case05 | WA | 1 ms | 256 KB |
basic_case06 | AC | 1 ms | 256 KB |
basic_case07 | AC | 1 ms | 256 KB |
basic_case08 | WA | 1 ms | 256 KB |
basic_case09 | AC | 1 ms | 256 KB |
basic_case10 | AC | 1 ms | 256 KB |
basic_case11 | AC | 1 ms | 256 KB |
basic_case12 | AC | 1 ms | 256 KB |
basic_case13 | AC | 1 ms | 256 KB |
basic_case14 | WA | 1 ms | 256 KB |
basic_case15 | AC | 1 ms | 256 KB |
basic_case16 | AC | 1 ms | 256 KB |
basic_case17 | AC | 1 ms | 256 KB |
basic_case18 | AC | 1 ms | 256 KB |
basic_case19 | AC | 1 ms | 256 KB |
basic_case20 | AC | 1 ms | 256 KB |
basic_case21 | AC | 1 ms | 256 KB |
basic_case22 | AC | 1 ms | 256 KB |
basic_case23 | AC | 1 ms | 256 KB |
basic_case24 | AC | 1 ms | 256 KB |
basic_case25 | AC | 1 ms | 256 KB |
basic_case26 | AC | 1 ms | 256 KB |
basic_case27 | AC | 1 ms | 256 KB |
basic_case28 | AC | 1 ms | 256 KB |
basic_case29 | AC | 1 ms | 256 KB |
sample00 | AC | 1 ms | 256 KB |
sample01 | AC | 1 ms | 256 KB |