UVA 10295 Hay Points Solution

import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.StringTokenizer;
import java.util.TreeMap;

class Main {

//UVA 10295
public static void main(String[] args) throws IOException {

InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
String m[] = br.readLine().split(" ");
int words = Integer.parseInt(m[0]);
int tc = Integer.parseInt(m[1]);
TreeMap <String, Integer> dic = new TreeMap<String, Integer>();
StringBuffer sb = new StringBuffer("");
for (int i=0 ; i< words; i++){
m = br.readLine().split(" ");
dic.put(m[0], Integer.parseInt(m[1]));
}
String str = br.readLine();
int ctr=0;
while(true){

if(str == null) {
System.out.print(sb);
System.exit(0);
}
                if(str.equalsIgnoreCase(".")){
sb.append(ctr).append("\n");
ctr =0;
}
StringTokenizer st = new StringTokenizer(str);
while(st.hasMoreTokens()) {
String check = st.nextToken();
//System.out.println("what am i checing" + check);
if(dic.containsKey(check)) {
//System.out.println(ctr);
ctr = ctr + dic.get(check);
}


}
//System.out.println(ctr);
str=br.readLine();
}

}
}

UVA 10374 Election solution

import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.Iterator;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.HashMap;


class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);


int tc = sc.nextInt();

boolean ind = false;
for (int i =0 ;i < tc ;i++) {

sc.nextLine();
if(ind) System.out.println();
ind = true;
{
HashMap<String,String> cand = new HashMap<> ();
HashMap<String,Integer> vt_ctr= new HashMap<> ();
int p = sc.nextInt();
 sc.nextLine();

 for (int i1 =0; i1<p; i1++) {
 String candt = sc.nextLine();
 String part = sc.nextLine();
 if (part.equalsIgnoreCase("independent")) part = part+candt;
 cand.put(candt, part);
 }

 int votes = sc.nextInt();
 sc.nextLine();
 for(int i1 =0;i1<votes;i1++) {
 String cand1 = sc.nextLine();

 if (!vt_ctr.containsKey(cand1)) vt_ctr.put(cand1, (Integer)1);
 else {
 int tmp =1 + vt_ctr.get(cand1);
 vt_ctr.put(cand1,tmp);
 }
 }
 boolean flag = false;
 String winner=null;
 int max=0;
 Iterator<Entry<String, Integer>> it  = vt_ctr.entrySet().iterator();
while(it.hasNext()) {
Entry<String, Integer> entry = it.next();
 String key = entry.getKey();
 Integer value = entry.getValue();
 if(max<value) {
 max = value;
 winner = key;
 flag = false;
 }
 else if (max==value) {
 flag = true;
 }
}
if (flag) System.out.println("tie");
else
System.out.println(cand.get(winner));

}
}
}

}

UVA 10945 Mother Bear Solution

import java.util.Scanner;

class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
boolean flag = true;
String s= null;
while (flag) {
s =sc.nextLine().toLowerCase().replaceAll("[^a-z]", "");
if (s.equalsIgnoreCase("DONE")) break;
StringBuffer sb = new StringBuffer(s);
if(s.equalsIgnoreCase(sb.reverse().toString())) System.out.println("You won't be eaten!");
//if (s(sb.reverse()))
else System.out.println("Uh oh..");
}
}

}

UVA 10098 Solution

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;


class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int tc = sc.nextInt();
StringBuffer bf = new StringBuffer("");
sc.nextLine();
for (int i =0; i<tc ; i++) {
if (i>0) bf.append("\n");
char [] a =sc.nextLine().toCharArray();
Arrays.sort(a);
//String s =String.valueOf(a);
Arrays.asList(a);
do{
bf.append(new String(a)+"\n");
//System.out.println(new String(a));
}while(next_permutation2(a));


}
System.out.println(bf);

}
public static boolean next_permutation2(char a[])
    {
       for(int i = a.length-2, j; i >= 0; i--)
       {
        if (a[i+1] > a[i])
               {
               for(j = a.length-1; a[j] <= a[i]; j--);
swap(a, i, j);
  for(j = 1; j <= (a.length-i)/2; j++)
  swap(a, i+j, a.length-j);
                     return true;
           }
       }
        return false;
   }


public static void swap(char a[], int i, int j)
{
char temp = a[i];
a[i] = a[j];
  a[j] = temp;
      }
}

UVA 495 Solution

import java.math.BigInteger;
import java.util.Scanner;

class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
BigInteger [] bg = new BigInteger[5001];

bg[0] = BigInteger.ZERO;
bg[1] = BigInteger.ONE;
for (int i=2; i<5001; i++) bg[i] = bg[i-1].add(bg[i-2]);
Scanner sc = new Scanner(System.in);
while(sc.hasNext())
{
int i = sc.nextInt();
System.out.println( "The Fibonacci number for "  + i + " is " +  bg[i]);
}
}

}