Kumanovski Dijalekt AIPS

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.Character;
import java.lang.String;

class MapEntry<K extends Comparable<K>,E> implements Comparable<K> {

    // Each MapEntry object is a pair consisting of a key (a Comparable
    // object) and a value (an arbitrary object).
    K key;
    E value;

    public MapEntry (K key, E val) {
        this.key = key;
        this.value = val;
    }

    public int compareTo (K that) {
        // Compare this map entry to that map entry.
        @SuppressWarnings("unchecked")
        MapEntry<K,E> other = (MapEntry<K,E>) that;
        return this.key.compareTo(other.key);
    }

    public String toString () {
        return "<" + key + "," + value + ">";
    }
}

class SLLNode<E> {
    protected E element;
    protected SLLNode<E> succ;

    public SLLNode(E elem, SLLNode<E> succ) {
        this.element = elem;
        this.succ = succ;
    }

    @Override
    public String toString() {
        return element.toString();
    }
}

class CBHT<K extends Comparable<K>, E> {

    // An object of class CBHT is a closed-bucket hash table, containing
    // entries of class MapEntry.
    private SLLNode<MapEntry<K,E>>[] buckets;

    @SuppressWarnings("unchecked")
    public CBHT(int m) {
        // Construct an empty CBHT with m buckets.
        buckets = (SLLNode<MapEntry<K,E>>[]) new SLLNode[m];
    }

    private int hash(K key) {
        // Napishete ja vie HASH FUNKCIJATA
        String str = key.toString();
        char letters[] = str.toCharArray();
        int num = 0;

        for ( int i = 0; i < letters.length; i++ ){
            num += ( int ) letters[i] * i * i;
        }
        num = num % buckets.length;
        return num;
    }

    public SLLNode<MapEntry<K,E>> search(K targetKey) {
        // Find which if any node of this CBHT contains an entry whose key is
        // equal
        // to targetKey. Return a link to that node (or null if there is none).
        int b = hash(targetKey);
        for (SLLNode<MapEntry<K,E>> curr = buckets[b]; curr != null; curr = curr.succ) {
            if (targetKey.equals(((MapEntry<K, E>) curr.element).key))
                return curr;
        }
        return null;
    }

    public void insert(K key, E val) {		// Insert the entry <key, val> into this CBHT.
        MapEntry<K, E> newEntry = new MapEntry<K, E>(key, val);
        int b = hash(key);
        for (SLLNode<MapEntry<K,E>> curr = buckets[b]; curr != null; curr = curr.succ) {
            if (key.equals(((MapEntry<K, E>) curr.element).key)) {
                // Make newEntry replace the existing entry ...
                curr.element = newEntry;
                return;
            }
        }
        // Insert newEntry at the front of the 1WLL in bucket b ...
        buckets[b] = new SLLNode<MapEntry<K,E>>(newEntry, buckets[b]);
    }

    public void delete(K key) {
        // Delete the entry (if any) whose key is equal to key from this CBHT.
        int b = hash(key);
        for (SLLNode<MapEntry<K,E>> pred = null, curr = buckets[b]; curr != null; pred = curr, curr = curr.succ) {
            if (key.equals(((MapEntry<K,E>) curr.element).key)) {
                if (pred == null)
                    buckets[b] = curr.succ;
                else
                    pred.succ = curr.succ;
                return;
            }
        }
    }

    public String toString() {
        String temp = "";
        for (int i = 0; i < buckets.length; i++) {
            temp += i + ":";
            for (SLLNode<MapEntry<K,E>> curr = buckets[i]; curr != null; curr = curr.succ) {
                temp += curr.element.toString() + " ";
            }
            temp += "\n";
        }
        return temp;
    }

}

public class KumanovskiDijalekt {
    public static void main (String[] args) throws IOException {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt(br.readLine());

        String rechnik[]=new String[N];
        for(int i=0;i<N;i++){
            rechnik[i]=br.readLine();
        }

        String tekst=br.readLine();

        //Vasiot kod tuka

        CBHT< String, String > table = new CBHT<>( 2 * N + 1);
        for( int i = 0; i < N; i++ ){

            String words[] = rechnik[i].split( " " );
            table.insert( words[0], words[1] );
        } // hash tabelata e gotova

        String words[] = tekst.split( " " );

        for( int i = 0; i < words.length; i++ ){ // gi sreduva zborovite po red

            char firstLetter = words[i].charAt(0);
            char lastLetter = words[i].charAt( words[i].length() - 1 );

            String bareWord = words[i].toLowerCase(); // site bukvi gi pravi mali
            if( !Character.isLetter( lastLetter ) ){ // ako ne zavrsuva so bukva
                bareWord = bareWord.replace( lastLetter, ' ' ); // ako zavrsuva so interpunkciski go menuva so prazno mesto
            }

            bareWord = bareWord.trim(); // go trga praznoto mesto
            // vo words[i] ima zbor so site mali bukvi i bez interpunkciski znaci na krajot
            //System.out.println( bareWord + " " + i );

            SLLNode< MapEntry< String, String > > node = table.search( bareWord );

            if( node == null )
                continue;

            String newWord = node.element.value; // go dobiva noviot zbor, treba da se sredi so interounkciski i golemi mesta

            if( Character.isUpperCase( firstLetter ) ) {// ako ptvicniot zbor imal golema bukva
                //System.out.println( newWord + " " + i );
                newWord = newWord.replace( newWord.charAt( 0 ), Character.toUpperCase( newWord.charAt( 0 ) ) );
            }

            if( !Character.isAlphabetic( lastLetter ) ){ // ako imal interpunkciski znak na kraj
               // System.out.println( newWord + " " + i );
                newWord += Character.toString( lastLetter );
            }

            words[i] = newWord;
        }

        tekst = "";
        for ( int i = 0; i < words.length; i++ ){
            tekst += words[i] + " ";
        }

        System.out.println( tekst );
        return;

    }
}