Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.IOException;
- import java.io.InputStreamReader;
- import java.util.Hashtable;
- 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
- return Math.abs(key.hashCode()) % buckets.length;
- }
- 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<>(N);
- char znak=' ';
- String[] pomniza;
- for (int i = 0; i < N; i++) {
- pomniza = rechnik[i].split(" ");
- table.insert(pomniza[0], pomniza[1]);
- }
- String[] zborchinja = tekst.split(" ");
- StringBuilder s = new StringBuilder();
- boolean flag = false;
- if(N==0)
- System.out.println(tekst);
- else{
- for (int i = 0; i < zborchinja.length; i++) {
- StringBuilder a = new StringBuilder();
- if (zborchinja[i].contains(",") || zborchinja[i].contains(".") || zborchinja[i].contains("!") || zborchinja[i].contains("?")) {
- znak = zborchinja[i].charAt(zborchinja[i].length()-1);
- zborchinja[i] = zborchinja[i].substring(0, zborchinja[i].length() - 1);
- }
- if (table.search(zborchinja[i].toLowerCase()) == null) {
- s.append(zborchinja[i]);
- if (znak != ' '){
- s.append(znak);
- znak = ' ';
- }
- s.append(" ");
- }
- else
- {
- SLLNode<MapEntry<String,String>> pom = table.search(zborchinja[i].toLowerCase());
- if(Character.isUpperCase(zborchinja[i].charAt(0))){
- flag = true;
- }
- if(flag) {
- String temp = pom.element.value;
- a.append(Character.toUpperCase(temp.charAt(0)));
- temp = temp.substring(1,temp.length());
- a.append(temp);
- flag = false;
- s.append(a.toString());
- }
- else
- s.append(pom.element.value);
- if (znak != ' '){
- s.append(znak);
- znak = ' ';
- }
- s.append(" ");
- }
- }
- }
- System.out.println(s.toString());
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement