Tic-Tac-Toe-Tomek is a game played on a 4 x 4 square board. The board starts empty, except that a single ‘T’ symbol may appear in one of the 16 squares. There are two players: X and O. They take turns to make moves, with X starting. In each move a player puts her symbol in one of the empty squares. Player X’s symbol is ‘X’, and player O’s symbol is ‘O’.

After a player’s move, if there is a row, column or a diagonal containing 4 of that player’s symbols, or containing 3 of her symbols and the ‘T’ symbol, she wins and the game ends. Otherwise the game continues with the other player’s move. If all of the fields are filled with symbols and nobody won, the game ends in a draw. See the sample input for examples of various winning positions.

Given a 4 x 4 board description containing ‘X’, ‘O’, ‘T’ and ‘.’ characters (where ‘.’ represents an empty square), describing the current state of a game, determine the status of the Tic-Tac-Toe-Tomek game going on. The statuses to choose from are:

“X won” (the game is over, and X won)
“O won” (the game is over, and O won)
“Draw” (the game is over, and it ended in a draw)
“Game has not completed” (the game is not over yet)

If there are empty cells, and the game is not over, you should output “Game has not completed”, even if the outcome of the game is inevitable.

Input

The first line of the input gives the number of test cases, T. T test cases follow. Each test case consists of 4 lines with 4 characters each, with each character being ‘X’, ‘O’, ‘.’ or ‘T’ (quotes for clarity only). Each test case is followed by an empty line.
Output

For each test case, output one line containing “Case #x: y”, where x is the case number (starting from 1) and y is one of the statuses given above. Make sure to get the statuses exactly right. When you run your code on the sample input, it should create the sample output exactly, including the “Case #1: “, the capital letter “O” rather than the number “0″, and so on.

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;


public class Solution {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		FileInputStream fis = new FileInputStream("input.in");
		DataInputStream in = new DataInputStream(fis);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File("Output.in")));
		int N = Integer.parseInt(br.readLine());
		char table[][] = new char [4][4]; 
		int result = 0;
		int c = 1;
		boolean completed = true;
		while (N>0)
		{
			completed = true;
			for (int i = 0; i<4; i++)
			{
				String line = br.readLine();
				for (int j=0; j<4; j++) table[i][j] = line.charAt(j);
			}
			br.readLine();
			char[][] Xtable = replace(table,'T','X');
			result = checkResult(Xtable); 
			if (result == 1) bw.append("Case #"+c+": X won\n");
			else
			{
				char[][] Otable = replace(table,'T','O');
				result = checkResult(Otable);
				if (result == 1) bw.append("Case #"+c+": X won\n");
				if (result == 2) bw.append("Case #"+c+": O won\n");
				if (result == 0)
				{
					for (int p = 0; p<4; p++)
					{
						for (int q = 0; q<4; q++) if (table[p][q] == '.') completed = false;
					}
					if (completed) bw.append("Case #"+c+": Draw\n");
					else bw.append("Case #"+c+": Game has not completed\n");
				}
			}
			N--;
			c++;
		}
		br.close();
		bw.close();
	}
	private static char[][] replace(char[][] oldtable, char c, char d) {
		// TODO Auto-generated method stub
		char[][] table= new char[4][4];
		
		for (int i=0; i< 4; i++)
		{
			for (int j=0 ; j< 4; j++)
			{
				table[i][j] = oldtable[i][j];
				if (table[i][j] == c) table[i][j] = d;
			}
		}
		return table;
	}
	private static int checkResult(char[][] table) {
		// TODO Auto-generated method stub
		if( (table[0][0] == table[0][1] && table[0][1] == table[0][2]) && (table[0][2] == table[0][3])) 
			if (table[0][0] == 'X')return 1;
			else if(table[0][0] == 'O') return 2;
		if( (table[1][0] == table[1][1] && table[1][1] == table[1][2]) && (table[1][2] == table[1][3]))
			if (table[1][0] == 'X')return 1;
			else if(table[1][0] == 'O') return 2;
		if( (table[2][0] == table[2][1] && table[2][1] == table[2][2]) && (table[2][2] == table[2][3]))
			if (table[2][0] == 'X')return 1;
			else if(table[2][0] == 'O') return 2;
		if( (table[3][0] == table[3][1] && table[3][1] == table[3][2]) && (table[3][2] == table[3][3])) 
			if (table[3][0] == 'X')return 1;
			else if(table[3][0] == 'O') return 2;
		if( (table[0][0] == table[1][0] && table[1][0] == table[2][0]) && (table[2][0] == table[3][0]))
			if (table[0][0] == 'X')return 1;
			else if(table[0][0] == 'O') return 2;
		if( (table[0][1] == table[1][1] && table[1][1] == table[2][1]) && (table[2][1] == table[3][1]))
			if (table[0][1] == 'X')return 1;
			else if(table[0][1] == 'O') return 2;
		if( (table[0][2] == table[1][2] && table[1][2] == table[2][2]) && (table[2][2] == table[3][2]))
			if (table[0][2] == 'X')return 1;
			else if(table[0][2] == 'O') return 2;
		if( (table[0][3] == table[1][3] && table[1][3] == table[2][3]) && (table[2][3] == table[3][3]))
			if (table[0][3] == 'X')return 1;
			else if(table[0][3] == 'O') return 2;
		if( (table[0][0] == table[1][1] && table[1][1] == table[2][2]) && (table[2][2] == table[3][3]))
			if (table[0][0] == 'X')return 1;
			else if(table[0][0] == 'O') return 2;
		if( (table[0][3] == table[1][2] && table[1][2] == table[2][1]) && (table[2][1] == table[3][0]))
			if (table[0][3] == 'X')return 1;
			else if(table[0][3] == 'O') return 2;
		return 0;
	}

}

The problem

You are given two vectors v1=(x1,x2,…,xn) and v2=(y1,y2,…,yn). The scalar product of these vectors is a single number, calculated as x1y1+x2y2+…+xnyn.

Suppose you are allowed to permute the coordinates of each vector as you wish. Choose two permutations such that the scalar product of your two new vectors is the smallest possible, and output that minimum scalar product.

Input
The first line of the input file contains integer number T – the number of test cases. For each test case, the first line contains integer number n. The next two lines contain n integers each, giving the coordinates of v1 and v2 respectively.

Output

For each test case, output a line
Case #X: Y

where X is the test case number, starting from 1, and Y is the minimum scalar product of all permutations of the two given vectors.

Limits

Small dataset

T = 1000
1 ≤ n ≤ 8
-1000 ≤ xi, yi ≤ 1000

Large dataset

T = 10
100 ≤ n ≤ 800
-100000 ≤ xi, yi ≤ 100000

Sample Input:

2
3
1 3 -5
-2 4 1
5
1 2 3 4 5
1 0 1 0 1

Sample Output:

Case #1: -25
Case #2: 6

The simple approach would be to multiply the smaller numbers from one array with the larger numbers of the other array and then sum up their products.
So basically, we sort both the arrays and then multiply the smallest to the largest or we can sort and reverse one array and multiply the same indexes of both arrays. I have used the former one.

/*
 * Author: Vlad - www.mycoding.net
 * This program is the solution to code jam's "Minimum Scalar Product" problem.
 */

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.Arrays;
public class Solution {

	/**
	 * @param args
	 * 
	 */
	public static long[] convertStringToLong(String array[])
	{
		long longArray[] = new long[array.length];
		for (int i = 0; i < array.length; i++) longArray[i] = Long.parseLong(array[i]);
		return longArray;
	}
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		FileInputStream fis = new FileInputStream("MinimumScalarProductB.in");
		DataInputStream in = new DataInputStream(fis);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		int N = Integer.parseInt(br.readLine());
		int x = 1;
		int totalVectors;
		BigInteger min;
		long arrX[], arrY[];
		while(x <= N)
		{
			totalVectors = Integer.parseInt(br.readLine());
			arrX = convertStringToLong(br.readLine().split(" "));
			arrY = convertStringToLong(br.readLine().split(" "));
			Arrays.sort(arrX);
			Arrays.sort(arrY);
			min= new BigInteger("0");
			for (int i = 0; i< totalVectors; i++ )
			{
				min = min.add(new BigInteger(Long.toString(arrX[i] * arrY[(totalVectors-1)-i])));
			}
			System.out.println("Case #"+x+": "+min);
			x++;
		}
		br.close();
	}
}

Problem

You receive a credit C at a local store and would like to buy two items. You first walk through the store and create a list L of all available items. From this list you would like to buy two items that add up to the entire value of the credit. The solution you provide will consist of the two integers indicating the positions of the items in your list (smaller number first).

Input

The first line of input gives the number of cases, N. N test cases follow. For each test case there will be:

One line containing the value C, the amount of credit you have at the store.
One line containing the value I, the number of items in the store.
One line containing a space separated list of I integers. Each integer P indicates the price of an item in the store.
Each test case will have exactly one solution.

Output

For each test case, output one line containing “Case #x: ” followed by the indices of the two items whose price adds up to the store credit. The lower index should be output first.

Limits

5 ≤ C ≤ 1000
1 ≤ P ≤ 1000

Small dataset

N = 10
3 ≤ I ≤ 100

Large dataset

N = 50
3 ≤ I ≤ 2000

Input:

3
100
3
5 75 25
200
7
150 24 79 50 88 345 3
8
8
2 1 9 4 4 56 90 3

Output:

Case #1: 2 3
Case #2: 1 4
Case #3: 4 5

My Program:

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class StoreCredit {

	/**
	 * @param args
	 */
	public static Object[] getItems(int items[], int total)
	{
		ArrayList selectedItems = new ArrayList();
		int index = 0;
		for (int i = 0; i<items.length; i++)
		{
			for (int j = i+1; j < items.length; j++)
			{
				if (items[i] + items[j] == total)
				{
					selectedItems.add(index, i);
					selectedItems.add(index+1,j);
				}
			}
		}
		return selectedItems.toArray();
	}
	public static int[] convertStringToInt(String array[])
	{
		int intArray[] = new int[array.length];
		for (int i = 0; i < array.length; i++) intArray[i] = Integer.parseInt(array[i]);
		return intArray;
	}
	public static void main(String[] args) throws IOException 
	{
		FileInputStream fis = new FileInputStream("StoreCreditLarge.in");
		DataInputStream in = new DataInputStream(fis);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		String N = br.readLine();
		String line = null;
		int caseNo = 1;
		while((line = br.readLine()) != null )
		{
			int credits = Integer.parseInt(line);
			int totalItems = Integer.parseInt(br.readLine());
			String strItems[] = br.readLine().split(" ");
			int Items[] = convertStringToInt(strItems);
			//System.out.println("Credits: "+credits+" total= "+totalItems+"ItemsLength= "+Items.length);
			Object selectedItems[] = getItems(Items, credits);
			//System.out.println(selectedItems.length);
			System.out.println("Case #"+caseNo+":"+printArray(selectedItems));
			caseNo++;
		}
	}
	public static String printArray(Object[] selectedItems) {
		// TODO Auto-generated method stub
		String result = "";
		for (int i=0; i<selectedItems.length; i++) result = result +" "+((int)selectedItems[i]+1);
		return result;
	}

}

Output:

So, here we go:

public class OddWayToSquare {
	public static int Square(int num)
	{
		int square = 0;
		int count = 0;
		while (count < num)
		{
			square = square + num;
			count++;
		}
		return square;
	}
	public static void main(String args[])
	{
		System.out.println(Square(10));
	}
}

Output:

The problem:

A double-square number is an integer X which can be expressed as the sum of two perfect squares. For example, 10 is a double-square because 10 = 32 + 12. Your task in this problem is, given X, determine the number of ways in which it can be written as the sum of two squares. For example, 10 can only be written as 32 + 12 (we don’t count 12 + 32 as being different). On the other hand, 25 can be written as 52 + 02 or as 42 + 32.

Input
You should first read an integer N, the number of test cases. The next N lines will contain N values of X.
Constraints
0 ≤ X ≤ 2147483647
1 ≤ N ≤ 100
Output
For each value of X, you should output the number of ways to write X as the sum of two squares.

Example Input:

5
10
25
3
0
1

Example Output:

Case #1: 1
Case #2: 2
Case #3: 0
Case #4: 1
Case #5: 1

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;

public class DoubleSquares {
	DoubleSquares(String inputFile) throws IOException, FileNotFoundException
	{
		FileInputStream fis = new FileInputStream(inputFile);
		DataInputStream in = new DataInputStream(fis);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		String line = null;
		System.out.println("Total test cases: "+br.readLine());
		//Reading the file line by line
		while((line = br.readLine()) != null)
		{
			int num = Integer.valueOf(line);
			int count = 0;
			//double second;
			for (int i = 0; i <= (int) Math.sqrt(num)+1; i++)
			{
				for (int j = i;j<=(int) Math.sqrt(num)+1; j++)
				{
					if ( (i*i) + (j*j) == num) count++;
				}
			}
			System.out.println("Count for "+num+": "+count);
			}
		br.close();
		}
	public static void main (String args[]) throws FileNotFoundException, IOException
	{
		new DoubleSquares("DoubleSquaresInput.txt");
	}
}

Output:

The problem:

Studious Student

You’ve been given a list of words to study and memorize. Being a diligent student of language and the arts, you’ve decided to not study them at all and instead make up pointless games based on them. One game you’ve come up with is to see how you can concatenate the words to generate the lexicographically lowest possible string.

Input

As input for playing this game you will receive a text file containing an integer N, the number of word sets you need to play your game against. This will be followed by N word sets, each starting with an integer M, the number of words in the set, followed by M words. All tokens in the input will be separated by some whitespace and, aside from N and M, will consist entirely of lowercase letters.

Output

Your submission should contain the lexicographically shortest strings for each corresponding word set, one per line and in order.

Constraints

1 <= N <= 100
1 <= M <= 9
1 <= all word lengths <= 10

Example input

5
6 facebook hacker cup for studious students
5 k duz q rc lvraw
5 mybea zdr yubx xe dyroiy
5 jibw ji jp bw jibw
5 uiuy hopji li j dcyi

Example output

cupfacebookforhackerstudentsstudious
duzklvrawqrc
dyroiymybeaxeyubxzdr
bwjibwjibwjijp
dcyihopjijliuiuy

import java.io.*;
import java.util.Arrays;
public class StudiousStudent 
{
	StudiousStudent(String inputFile) throws IOException, FileNotFoundException
	{
		FileInputStream fis = new FileInputStream(inputFile);
		DataInputStream in = new DataInputStream(fis);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		String line = null;
		String splitArray[] = null;
		//Reading the file line by line
		while((line = br.readLine()) != null)
		{
			//Splitting a line from spaces
			splitArray = line.split(" ");
			
			//Initial Sort
			Arrays.sort(splitArray);

			//Advanced Sort
			for (int i = 1; i<splitArray.length; i++)
			{
				for (int j = i+1; j<splitArray.length; j++)
				{
					if ((splitArray[j].startsWith(splitArray[i])))
					{
						if ((splitArray[i]+splitArray[j]).compareTo(splitArray[j]+splitArray[i]) > 0)
						{
							String tmp = splitArray[i];
							splitArray[i] = splitArray[j];
							splitArray[j] = tmp;
						}
					}
				}
			}
			for (int i = 1; i<splitArray.length; i++) System.out.print(splitArray[i]+"");
			System.out.println();
		}
		br.close();
	}
	public static void main(String args[]) throws FileNotFoundException, IOException
	{
		new StudiousStudent("StudiousStudent.txt");
	}
}

Output:

The word to guess is represented by a row of dashes, giving the number of letters and category of the word. If the guessing player suggests a letter which occurs in the word, the other player writes it in all its correct positions. If the suggested letter does not occur in the word, the other player draws one element of the hanged man stick figure as a tally mark. The game is over when:

The guessing player completes the word, or guesses the whole word correctly
The other player completes the diagram

Here, is the code:
config.php
It has two variables, $MAX_ATTEMPTS to store the number of maximum attempts the player has and $WORDLISTFILE to store the location of the text file that contains all the words which will be used in the game.

<?php
	$MAX_ATTEMPTS = 7;
	$WORDLISTFILE = 'wordlist.txt';
?>

functions.php
This file has all the important functions that are used in the script. Functions present in this file are:

fetchWordArray() : It returns a random word that is going to be used in the game from the specified text file.
hideCharacters() : It hides certain characters of the word that has been generated by fetchWordArray().
checkAndReplace() : This function checks if the character entered by the user is one of the missing characters of the hidden word. If the character is found in the word, it is placed into its exact location.
checkGameOver() : This function checks if the game is over. Games ends when user exceeeds maximum allowed attempts or if the user guesses the word right.

<?php
/*
	Function Name: fetchWordArray()
	Parameters: None
	Return values: Returns an array of characters.
*/
	function fetchWordArray($wordFile)
	{
		$file = fopen($wordFile,'r');
   		if ($file)
		{
        	$random_line = null;
        	$line = null;
        	$count = 0;
        	while (($line = fgets($file)) !== false) 
			{
            	$count++;
            	if(rand() % $count == 0) 
				{
              		$random_line = trim($line);
            	}
        }
        if (!feof($file)) 
		{
            fclose($file);
            return null;
        }else 
		{
        	fclose($file);
        }
    }
		$answer = str_split($random_line);
		return $answer;
	}
/*
	Function Name: hideCharacters()
	Parameters: Word whose characters are to be hidden.
	Return values: Returns a string of characters.
*/
	function hideCharacters($answer)
	{
		$noOfHiddenChars = floor((sizeof($answer)/2) + 1);
		$count = 0;
		$hidden = $answer;
		while ($count < $noOfHiddenChars )
		{
			$rand_element = rand(0,sizeof($answer)-2);
			if( $hidden[$rand_element] != '_' )
			{
				$hidden = str_replace($hidden[$rand_element],'_',$hidden,$replace_count);
				$count = $count + $replace_count;
			}
		}
		return $hidden;
	}
/*
	Function Name: checkAndReplace()
	Parameters: UserInput, Hidden string and the answer.
	Return values: Returns a character array.
*/
	function checkAndReplace($userInput, $hidden, $answer)
	{
		$i = 0;
		$wrongGuess = true;
		while($i < count($answer))
		{
			if ($answer[$i] == $userInput)
			{
				$hidden[$i] = $userInput;
				$wrongGuess = false;
			}
			$i = $i + 1;
		}
		if (!$wrongGuess) $_SESSION['attempts'] = $_SESSION['attempts'] - 1;
		return $hidden;
	}
	
	
/*
	Function Name: checkGameOver()
	Parameters: Maximum attempts, no. of attempts made by user, Hidden string and the answer.
	Return values: Returns a character array.
*/
	function checkGameOver($MAX_ATTEMPTS,$userAttempts, $answer, $hidden)
	{
		if ($userAttempts >= $MAX_ATTEMPTS)
			{
				echo "Game Over. The correct word was ";
				foreach ($answer as $letter) echo $letter;
				echo '<br><form action = "" method = "post"><input type = "submit" name = "newWord" value = "Try another Word"/></form><br>';
				die();
			}
			if ($hidden == $answer)
			{
				echo "Game Over. The correct word is indeed ";
				foreach ($answer as $letter) echo $letter;
				echo '<br><form action = "" method = "post"><input type = "submit" name = "newWord" value = "Try another Word"/></form><br>';
				die();
			}
	}
?>

Finally, the index page:
index.php
It is responsible for initiating a session, validation of user input and calling the functions appropriately.

<?php session_start();?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>Hangman</title>
</head>

<body>
<?php
	include 'config.php';
	include 'functions.php';
	if (isset($_POST['newWord'])) unset($_SESSION['answer']);
	if (!isset($_SESSION['answer']))
	{
		$_SESSION['attempts'] = 0;
		$answer = fetchWordArray($WORDLISTFILE);
		$_SESSION['answer'] = $answer;
		$_SESSION['hidden'] = hideCharacters($answer);
		echo 'Attempts remaining: '.($MAX_ATTEMPTS - $_SESSION['attempts']).'<br>';
	}else
	{
		if (isset ($_POST['userInput']))
		{
			$userInput = $_POST['userInput'];
			$_SESSION['hidden'] = checkAndReplace(strtolower($userInput), $_SESSION['hidden'], $_SESSION['answer']);
			checkGameOver($MAX_ATTEMPTS,$_SESSION['attempts'], $_SESSION['answer'],$_SESSION['hidden']);
		}
		$_SESSION['attempts'] = $_SESSION['attempts'] + 1;
		echo 'Attempts remaining: '.($MAX_ATTEMPTS - $_SESSION['attempts'])."<br>";
	}
	$hidden = $_SESSION['hidden'];
	foreach ($hidden as $char) echo $char."  ";
?>
<script type="application/javascript">
	function validateInput()
	{
	var x=document.forms["inputForm"]["userInput"].value;
	if (x=="" || x==" ")
  	{
  		alert("Please enter a character.");
  		return false;
  	}
	if (!isNaN(x))
	{
		alert("Please enter a character.");
		return false;
	}
}
</script>
<form name = "inputForm" action = "" method = "post">
Your Guess: <input name = "userInput" type = "text" size="1" maxlength="1"  />
<input type = "submit"  value = "Check" onclick="return validateInput()"/>
<input type = "submit" name = "newWord" value = "Try another Word"/>
</form>
</body>
</html>

Check the demo here: http://dev.mycoding.net/Hangman/

using System;
class Program
{
 static void Main(string[] args)
	{
	int i,tot=0;
	for (i = 0; i <= 20; i++)
	{
		if (i % 2 == 0)
		{}
		else
		{
		goto cal;
		}
		cal: tot = tot + i;
	}
	Console.WriteLine("Sum of odd numbers from 0 to 20: "+tot);
	Console.ReadKey();
	}
}

Output:-

Sum of odd numbers from 0 to 20: 100

The goto statement is used as a jump statement that skips some of the some that we don’t want to execute on some condition….

using System;
class Program
{
	static void Main(string[] args)
	{
		int s=0;
		for (int i = 1; i<= 10; i++)
		{
			if (i % 2 == 0)
			s = s - i;
			else
			s = s + i;
		}
	Console.WriteLine("The value of s is:"+s);
	Console.ReadKey();
	}
}

Output:-

The value of s is: -5

using System;

class Program

{

static void Main(string[] args)

{

float s=0;

for (float i = 1; i <= 9; i++)

{

s =s + (i/(i+1));

i++;

}

Console.WriteLine("The value of s is:"+s);

Console.ReadKey();

}

}

Output:-

The value of s is:3.858333.