UVA Problem ID 11244 (Counting Stars)

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


public class Main {
	static char image[][];
	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)
		{
			String s[]=input.split(" +");
			int row=Integer.parseInt(s[0]);
			int column=Integer.parseInt(s[1]);
			if(row==0 && column==0)
				break;
			image=new char[row][column];
			for (int i = 0; i < row; i++) {
				input=br.readLine();
				for (int j = 0; j < column; j++) {
					image[i][j]=input.charAt(j);
				}
			}
			int no_of_stars=0;
			for (int i = 0; i < row; i++) {
				for (int j = 0; j =0)
		{
			count+=floodfill(row-1, column, rowlimit, columnlimit);
			if(column-1>=0)
				count+=floodfill(row-1, column-1, rowlimit, columnlimit);
			if(column+1<=columnlimit)
				count+=floodfill(row-1, column+1, rowlimit, columnlimit);
		}
		if(row+1<=rowlimit)
		{
			count+=floodfill(row+1, column, rowlimit, columnlimit);
			if(column-1>=0)
				count+=floodfill(row+1, column-1, rowlimit, columnlimit);
			if(column+1<=columnlimit)
				count+=floodfill(row+1, column+1, rowlimit, columnlimit);
		}
		if(column-1>=0)
			count+=floodfill(row, column-1, rowlimit, columnlimit);
		if(column+1<=columnlimit)
			count+=floodfill(row, column+1, rowlimit, columnlimit);
		return count;
	}

}

UVA Problem ID 11470 (Square Sums)

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


public class Main {
	static int square[][];
	public static void main (String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String input;
		int testno=0;
		StringBuilder sb=new StringBuilder(10000);
		while((input=br.readLine())!=null)
		{
			
			int dimension=Integer.parseInt(input);
			if(dimension==0)
				break;
			testno++;
			square=new int[dimension][dimension];
			for (int i = 0; i < dimension; i++) {
				String s[]=br.readLine().split(" +");
				for (int j = 0; j < dimension; j++) {
					square[i][j]=Integer.parseInt(s[j]);
				}
			}
			sb.append("Case "+testno+": ");
			for (int i = 0; i < dimension/2; i++) {
				int count=0;
				count +=sumsquare(i,i+1,false,dimension-i-1);
				count +=sumsquare(i,i,true,dimension-i);
				count +=sumsquare(dimension-i-1,i+1,false,dimension-i-1);
				count +=sumsquare(i,dimension-i-1,true,dimension-i);
				if(i==0)
					sb.append(count);
				else
					sb.append(" "+count);
			}
			if(dimension % 2!=0 && dimension/2==0)
				sb.append(square[(int) Math.floor(dimension / 2.0)][(int) Math.floor(dimension / 2.0)]);
			else if(dimension % 2!=0)
				sb.append(" "+square[(int) Math.floor(dimension / 2.0)][(int) Math.floor(dimension / 2.0)]);
			sb.append("\n");
		}
		System.out.print(sb);
	}
	public static int sumsquare(int i,int j,boolean isrowchange,int dimension)
	{
		int count=0;
		
		if(isrowchange)
		{
			for (int k = i; k < dimension; k++) {
				count+=square[k][j];
			}
		}
		else
		{
			for (int k = j; k < dimension; k++) {
				count+=square[i][k];
			}
		}
		return count;
	}
}

UVA Problem ID 11364 (Parking)

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().trim());
		for(int i=0;imax)
				{
					max=Integer.parseInt(s[j]);
				}
				if(Integer.parseInt(s[j])

UVA Problem ID 256 (Quirksome Squares)

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;
		while((input=br.readLine())!=null)
		{
			int lowerbound=0;
			int upperbound=0;
			int divider=10;
			switch (Integer.parseInt(input)) {
				case 2:
				{
					lowerbound=00;
					upperbound=99;
					divider=10;
					break;
				}
				case 4:
				{
					lowerbound=0000;
					upperbound=9999;
					divider=100;
					break;
				}
				case 6:
				{
					lowerbound=000000;
					upperbound=999999;
					divider=1000;
					break;
				}
				case 8:
				{
					lowerbound=00000000;
					upperbound=99999999;
					divider=10000;
					break;
				}
			}
			for (int i = lowerbound; i <= upperbound; i++) {
				int a=i/divider;
				int b=i-a*divider;
				if((a+b)*(a+b)==i)
				{
					System.out.format("%0"+Integer.parseInt(input)+"d\n",i);
				}
			}
		}
	}
}

UVA Problem ID 11172 (Relational Operators)

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().trim());
		for(int i=0;ib)
				sb.append(">\n");
			else if(a

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 11313 (Gourmet Games)

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 =m)
			{
				total_shows+=left/m;
				left=left/m+left%m;
			}
			if(left==1)
				sb.append(total_shows+"\n");
			else
				sb.append("cannot do this\n");
		}
		System.out.print(sb);
	}
}

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);
	}
}

UVA Problem ID 11805 (Bafana Bafana)

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