Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- bool check(char a) {
- if (a == 'a' || a == 'i' || a == 'u' || a == 'e' || a == 'o' || a == 'A' || a == 'I' || a == 'U' || a == 'E' || a == 'O') return true;
- else return false;
- }
- int main() {
- int n;
- scanf("%d", &n);
- char a[n][105];
- for (int i = 0 ; i < n ; i++) {
- scanf("%s", a[i]);
- for (int k = 1 ; k < strlen(a[i]) ; k++) {
- if (check(a[i][k]) && check(a[i][k-1])) {
- a[i][k] = toupper(a[i][k]);
- a[i][k-1] = toupper(a[i][k-1]);
- }
- else if (!check(a[i][k]) && a[i][k-1] == 'g' && a[i][k-2] == 'n') {
- a[i][k] = toupper(a[i][k]);
- a[i][k-1] = toupper(a[i][k-1]);
- a[i][k-2] = toupper(a[i][k-2]);
- }
- else if (!check(a[i][k]) && !check(a[i][k-1])) {
- if (a[i][k] == 'g' && a[i][k-1] == 'n') continue;
- else {
- a[i][k] = toupper(a[i][k]);
- a[i][k-1] = toupper(a[i][k-1]);
- }
- }
- }
- }
- for (int i = 0 ; i < n ; i++) printf("Case #%d : %s\n", i+1, a[i]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement