Submission #1307473
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define all(c) (c).begin(), (c).end() #define rep(i, n) for (int i = 0; i < (int)(n); i++) int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; int main() { string bo = "aiueo"; string c; cin >> c; if (bo.find(c) == string::npos) { cout << "consonant" << endl; } else { cout << "vowel" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - UOIAUAI |
User | odan |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 427 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 1 ms | 256 KB |
subtask0_1.txt | AC | 1 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 1 ms | 256 KB |
subtask1_1.txt | AC | 1 ms | 256 KB |
subtask1_2.txt | AC | 1 ms | 256 KB |
subtask1_3.txt | AC | 1 ms | 256 KB |
subtask1_4.txt | AC | 1 ms | 256 KB |
subtask1_5.txt | AC | 1 ms | 256 KB |
subtask1_6.txt | AC | 1 ms | 256 KB |