1.


/**
* Angewandte Mathematik, SS11
* Problem: 11734 Big Number of Teams will Solve This
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Tran, Tuan Anh
* @version 1.0, 03/22/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.124
*/


import java.util.*;
import java.io.*;


public class Main {

public static void main(String[] args) throws IOException {
Scanner scan = new Scanner(System.in);
int t = Integer.parseInt(scan.nextLine());
int counter = 1;
for (int i = 0; i < t; i++) {
String str1 = scan.nextLine();
String str2 = scan.nextLine();
System.out.printf("Case " + counter +": ");
if (str1.equals(str2)) {
System.out.printf("Yes\n");
} else {
str1 = str1.replaceAll(" ","");
str2 = str2.replaceAll(" ","");
if (str1.equals(str2)) {
System.out.printf("Output Format Error\n");
} else {
System.out.printf("Wrong Answer\n");
}
}
counter ++;
}
}
}


2.

/**
* Angewandte Mathematik, SS11
* Problem: 11734 Big Number of Teams will Solve This
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2834
*
* @author Ritter Marius
* @author Wende Tom
* @author Zehentbauer Stefan
* @version 1.0, 10/23/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.100
*/

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

import java.io.InputStreamReader;



public class Main11734 {

public static BufferedReader bsr = new BufferedReader(new InputStreamReader(System.in));
public static void main(String[] args) throws IOException{

int anzahl = Integer.parseInt(bsr.readLine());

for(int i = 1; i < anzahl+1; i++){

String string1 = bsr.readLine();
String string2 = bsr.readLine();

if(string1.equals(string2)){
System.out.println("Case " + i + ": Yes");
}else{
string1 = string1.replaceAll(" ", "");

if(string1.equals(string2)){
System.out.println("Case " + i + ": Output Format Error");
}
else System.out.println("Case " + i + ": Wrong Answer");
}


}





}
}

3.

/**
* Angewandte Mathematik, SS11
* Problem: 11734 Big Number of Teams will Solve This
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2834
*
* @author Unverzart Michael
* @author Wurth Manuel
* @version 1.0, 23/3/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.100
*/

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

public class Main {

public static void main(String[] args) throws Exception{

BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

int t = new Integer(reader.readLine());

for(int i=1; i<=t; i++) {

String a = reader.readLine();
String b = reader.readLine();

System.out.print("Case "+i+": ");

if(a.equals(b)) {
System.out.println("Yes");
} else {
a = a.replaceAll(" ", "");
b = b.replaceAll(" ", "");
if(a.equals(b)) {
System.out.println("Output Format Error");
} else {
System.out.println("Wrong Answer");
}
}
}
}
}


4.

import java.util.Scanner;

/**
* Angewandte Mathematik, SS11
* Problem: 11734 - Big Number of Teams will Solve This
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2834
*
* @author Benedikt Z¨nnchen
* @author Erik Wenzel
* @version 1.0, 03/26/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.128
*/

public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int cases = sc.nextInt();
sc.nextLine();
String s1 = "";
String s2 = "";

for(int i=1; i<=cases; i++)
{
s1 = sc.nextLine();
s2 = sc.nextLine();

if(s1.equals(s2))
{
System.out.println("Case "+i+": Yes");
}
else
{
s1 = s1.replaceAll("\\W","");
s2 = s2.replaceAll("\\W","");

if(s1.equals(s2))
{
System.out.println("Case "+i+": Output Format Error");
}
else
{
System.out.println("Case "+i+": Wrong Answer");
}
}
}
}
}

5.

/** * Angewandte Mathematik, SS11 * Problem: 11734 Big Number of Teams will Solve This * Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113 * * @author Gulchiroy Toshtemirova * @author YYY * @version 1.0, 12/04/2011 * * Method : Ad-Hoc * Status : Accepted * Runtime: 0.132 */
import java.util.*;

public class Main {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
int Zahl = Integer.parseInt (scan.nextLine());
for (int i = 1; i<Zahl+1; i++){
String string1 = scan.nextLine();
String string2 = scan.nextLine();
if (string1.equals(string2)){
System.out.println("Case " + i +": Yes");
}else{
string1 = string1.replaceAll(" ","");
string2 = string2.replaceAll(" ","");
if (string1.equals(string2)){
System.out.println("Case "+i+": Output Format Error");
}else{
System.out.println("Case "+i+": Wrong Answer");
}
}

}
}
}


-------------------------------------------------------------------------------------

1.


/**
* FWP, Ausgewählte Probleme aus dem ACM Programming Contest, WS10/11
* Problem: 11734 Big Number of Teams will Solve This
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2834
*
* @author Fabian Liebl
* @version 1.0, 10/06/2010
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.088
*/

import java.io.*;

public class Main {

public static void main(String[] args) throws IOException {
BufferedReader inputReader = new BufferedReader(new InputStreamReader(System.in));
int numberOfTests = 0;
String line1 = "";
String line2 = "";

numberOfTests = Integer.parseInt(inputReader.readLine());

for (int i = 0; i < numberOfTests; i++) {
line1 = inputReader.readLine();
line2 = inputReader.readLine();

if (line1.equals(line2)) {
System.out.println("Case " + (i + 1) + ": Yes");
} else {
line1 = line1.replaceAll("\\s", "");
if (line1.equals(line2)) {
System.out.println("Case " + (i + 1) + ": Output Format Error");
} else {
System.out.println("Case " + (i + 1) + ": Wrong Answer");
}
}
}
}

}


2.

package BigNumberOfTeams;

import java.io.*;

/**
* FWP, Ausgewählte Probleme aus dem ACM Programming Contest, WS10/11
* Problem: 11734 Big Number of Teams will Solve This
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2834
*
* @author Manuel Hager
* @version 1.0, 10/11/2010
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.092
*/
public class Main
{

private static String RemoveSpaces(String tmp)
{
String[] parts = tmp.split("\\s+");

StringBuilder builder = new StringBuilder();
for(String curr :parts)
builder.append(curr);

return builder.toString();
}

public static void main(String[] args) {
try
{
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

String line = reader.readLine();

if(line == null || !line.matches("\\d+"))
return;

int number = Integer.parseInt(line);

for(int i = 0; i < number; i++)
{
String firstLine = reader.readLine();
String secondLine = reader.readLine();

if(firstLine.equals(secondLine))
System.out.printf("Case %d: Yes%n", (i + 1) );

else if(firstLine.toLowerCase().equals(secondLine.toLowerCase()))
System.out.printf("Case %d: Wrong Answer%n", (i + 1));

else if(RemoveSpaces(firstLine).equals(secondLine))
{
System.out.printf("Case %d: Output Format Error%n", (i + 1));
}
else
System.out.printf("Case %d: Wrong Answer%n", (i + 1) );
}

reader.close();
}
catch(Exception ex) {

}
}
}