Nimionese

input/code.cpp: In function 'bool is_hard(char)':
input/code.cpp:17:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < hard.size(); i++){
                      ^
input/code.cpp: In function 'int main()':
input/code.cpp:66:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < words.size(); i++){
                      ^
input/code.cpp:69:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < words.size(); i++){
                      ^
input/code.cpp:72:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < word.size(); j++){
                          ^
input/code.cpp:80:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < words.size(); i++){
                      ^
input/code.cpp:89:36: warni...

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <sstream>
#include <utility>
#include <set>
#include <iomanip>

using namespace std;
typedef long long LL;

string hard = "bcdgknpt";

bool is_hard(char c){
    for(int i = 0; i < hard.size(); i++){
        if(hard[i] == c) return true;
    }
    return false;
}

char nearest_hard(char c){
    char best_char;
    int best_dist = 1000;
    for(char h : hard){
        int dist = abs(c-h);
        if(dist < best_dist){
            best_dist = dist;
            best_char = h;
        }
    }
    return best_char;
}

string vowels = "aou";

char nearest_vowel(char c){
    char best_char;
    int best_dist = 1000;
    for(char h : vowels){
        int dist = abs(c-h);
        if(dist < best_dist){
            best_dist = dist;
            best_char = h;
        }
    }
    return best_char;
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    vector<string> words;
    vector<bool> uppercase;
    while(true){
        string word; cin >> word;
        if(!cin.good()) break;
        if(word[0] <= 'Z') uppercase.push_back(true);
        else uppercase.push_back(false);
        word[0] = tolower(word[0]);
        words.push_back(word);
    }
       
    
    for(int i = 0; i < words.size(); i++){
        words[i][0] = nearest_hard(words[i][0]);
    }
    for(int i = 0; i < words.size(); i++){
        string& word = words[i];
        bool flag = false;
        for(int j = 0; j < word.size(); j++){
            if(word[j] == '-') flag = true;
            else if(flag && is_hard(word[j]))
                word[j] = nearest_hard(word[0]);
        
        }
    }
    
    for(int i = 0; i < words.size(); i++){
        string& word = words[i];
        if(is_hard(word.back())){
            word.push_back(nearest_vowel(word.back()));
            word.push_back('h');
//            word += nearest_hard(word.back()) + "h";
        }
    }
    
    for(int word_idx = 0; word_idx < words.size(); word_idx++){
        string& word = words[word_idx];
        for(int i = 0; i < word.size(); i++){
            char c = word[i];
            if(c == '-') continue;
            if(i == 0 && uppercase[word_idx]) c = toupper(c);
            cout << c;
        }
        cout << " ";
    }
    cout << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED