-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcentauri-prime.cpp
59 lines (53 loc) · 1.15 KB
/
centauri-prime.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/**
* Author: Vindru
* Problem: (https://codingcompetitions.withgoogle.com/kickstart/round/00000000008f4332/0000000000941ec5)
**/
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()
const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
string solve(string name)
{
char a = name.back();
string res;
char v[] = {'A', 'E', 'I', 'O', 'U', 'a', 'e', 'i', 'o', 'u', '\0'};
for (int i = 0; v[i] != '\0'; i++)
{
if (a == v[i])
{
res = "Alice";
}
else if (a == 'y' || a == 'Y')
{
res = "nobody";
}
}
if (res.length() == 0)
{
res = "Bob";
}
return res;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc;
cin >> tc;
for (int t = 1; t <= tc; t++)
{
int n, m, temp;
string name;
cin >> name;
string res = solve(name);
cout << "Case #" << t << ": " << name << " is ruled by " << res << ".\n";
}
}