UVA Problem ID 10924 (Prime Words)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main{
	public static void main(String[] args) throws IOException {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String input;
		StringBuilder sb=new StringBuilder(1000);
		while((input=br.readLine())!=null) 
		{
			int sum=0;
			for (int i = 0; i < input.length(); i++) {
				if(input.charAt(i)>=97 && input.charAt(i)<=122)
					sum+=input.charAt(i)-96;
				else if(input.charAt(i)>=65 && input.charAt(i)<=90)
					sum+=input.charAt(i)-38;
			}
			if(isPrime(sum))
				sb.append("It is a prime word.\n");
			else
				sb.append("It is not a prime word.\n");
		}
		System.out.print(sb);
	}
	public static boolean isPrime(int number)
	{
		if(number!=2  && number%2==0)
			return false;
		for (int i =3; i <= Math.ceil(Math.sqrt(number)); i=i+2) {
			if(number%i==0)
				return false;
		}
		return true;
	}
}

UVA Problem ID 10976 (Fractions Again)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main {
	public static void main (String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String input;
		
		StringBuilder sb1=new StringBuilder(1000);
		while((input=br.readLine())!=null)
		{
			StringBuilder sb=new StringBuilder(1000);
			int k=Integer.parseInt(input);
			int count=0;
			for (int i = k+1; i <= k*2; i++) {
				
				if((i*k)%(i-k)==0)
				{
					count++;
					sb.append("1/"+k+" = 1/"+((k*i)/(i-k))+" + 1/"+i+"\n");				
				}
			}
			sb1.append(count+"\n"+sb);
		}
		System.out.print(sb1);
	}
}

UVA Problem ID 1237 (Halloween Treats)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main {
	public static void main (String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb=new StringBuilder(1000);
		int testcases=Integer.parseInt(br.readLine());
		for (int i = 0; i 0)
				sb.append("\n");
			int d=Integer.parseInt(br.readLine().trim());
			String name[]=new String[d];
			int lowestprice[]=new int[d];
			int highestprice[]=new int[d];
			for(int j=0;j=lowestprice[t] && queryvalue<=highestprice[t])
					{
						index=t;
						count++;
					}
				}
				if(count==1)
					sb.append(name[index]+"\n");
				else
					sb.append("UNDETERMINED\n");
			}
		}
		System.out.print(sb);
	}
}

UVA Problem ID 927 (Integer Sequences from Addition of Terms)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main {
	public static void main (String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb=new StringBuilder(1000);
		int testcases=Integer.parseInt(br.readLine());
		for (int i = 0; i =k)
				{
					for (int t = 0; t < coefficients.length; t++) {
						ans+=coefficients[t]*Math.pow(j, t);
					}
					break;
				}
			}
			sb.append(ans+"\n");
		}
		System.out.print(sb);
	}
}

UVA Problem ID 294 (Divisors)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main {
	public static void main (String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb=new StringBuilder(1000);
		int testcases=Integer.parseInt(br.readLine());
		for (int i = 0; i 

UVA Problem ID 11723 (Numbering Roads)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main {
	public static void main (String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb=new StringBuilder(1000);
		int testcase=0;
		while(true)
		{
			testcase++;
			String s[]=br.readLine().split(" +");
			int R=Integer.parseInt(s[0]);
			int N=Integer.parseInt(s[1]);
			if(R==0 && N==0)
				break;
			int a=R-N;
			int ans;
			if(a%N==0 || R26)
				sb.append("Case "+testcase+": impossible\n");
			else
				sb.append("Case "+testcase+": "+ans+"\n");
		}
		System.out.print(sb);
	}
}