Submission #1779071
Source Code Expand
#include <iostream> #include <math.h> #include <algorithm> #include <vector> #include <numeric> #include <string> using namespace std; const double PI = acos(-1.0); const string alp = "abcdefghijklmnopqrstuvwxyz"; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define SUM(c) accumulate((c).begin(),(c).end(),0) int main(){ char c; cin >> c; string v = "aeiou"; if (v.find(c)!=-1) { puts("vowel"); } else { puts("consonant"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - UOIAUAI |
User | V_Melville |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 650 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 |