1.

/**
* Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link:
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Schramm, Felix
* @author Vogel, Johannes
* @version 1.0, 03/21/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.140
*/

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

public class Main {
public static void main(String args[]){
Scanner scanner = new Scanner(System.in);
int numbers[] = new int[31];
int i = 0;
while (scanner.hasNextInt()) {
numbers[i++] = scanner.nextInt();
}

for(int j=0; j<numbers[0]; j++) {
System.out.println(toSymbol(numbers[2*j+1], numbers[2*j+2]));
}
}

static char toSymbol(int first, int second) {
return first<second?'<':first>second?'>':'=';
}
}


2.


/**
* FWP, Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* 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, 21/03/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.148
*/
import java.io.*;
import java.util.*;

/**
*
* @author ifw10264
*/
public class Main {

/**
* @param args the command line arguments
*/
public static void main(String[] args) throws IOException {
Scanner scan = new Scanner(System.in);
int t = scan.nextInt();
for (int j = 0; j < t; j++) {
int i = scan.nextInt();
int ii = scan.nextInt();
if (i < ii) {
System.out.println("<");
} else if (i == ii) {
System.out.println("=");
} else {
System.out.println(">");
}
}
}
}


3.
/**
* Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Ritter Marius
* @author Wende Tom
* @author Zehentbauer Stefan
* @version 1.0, 10/23/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.124
*/

import java.util.Scanner;

public class Main11172 {
public static void main(String[] args){
Scanner eingabe1 = new Scanner(System.in);
int anzahl = eingabe1.nextInt();
for(int i = 0; i < anzahl; i++){
int zahl1 = eingabe1.nextInt();
int zahl2 = eingabe1.nextInt();

if(zahl1 > zahl2){
System.out.println(">");
}else if(zahl1 < zahl2){
System.out.println("<");
}else System.out.println("=");
}
}
}


4.
package sem2.am.relationaloperator;

/**
* Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Florian Stein
* @author Franz Sommer
* @version 1.0, 03/21/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.132
*/

import java.util.*;

class Main {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int rows = scanner.nextInt();

for (int n = 0; n < rows; n++) {
int i = scanner.nextInt();
int j = scanner.nextInt();
if (i > j) {
System.out.println(">");
}
if (i < j) {
System.out.println("<");
}
if (i == j) {
System.out.println("=");
}
}
}
}

5.

/*
Brielbeck u. Weber
*/

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Apl {
public static void main(String[] args) {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
try {
String inputLine = reader.readLine();
int c = Integer.parseInt(inputLine);
for(int i=0; i<c; i++){
inputLine = reader.readLine();
String[] x = inputLine.split(" ");
int a = Integer.parseInt(x[0]);
int b = Integer.parseInt(x[1]);
if (a==b) System.out.println("=");
else {
if(a<b) System.out.println("<");
else System.out.println(">");
}
}
} catch (IOException e) {
e.printStackTrace();
}
}
}


6.

/**
* Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Unverzart Michael
* @author Wurth Manuel
* @version 1.0, 23/3/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.092
*/

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

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=0; i<t; i++) {
StringTokenizer st = new StringTokenizer(reader.readLine());

int a = new Integer(st.nextToken());
int b = new Integer(st.nextToken());

System.out.println(a<b?"<":(a>b?">":"="));
}
}
}

7.

/**
* Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Benedikt Z¨nnchen
* @author Erik Wenzel
* @version 1.0, 03/22/2011
*
* Method :
* Status : Accepted
* Runtime: 0.120
*/

import java.util.Scanner;

public class Main
{

public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);

int rows = sc.nextInt();
int v1 = 0;
int v2 = 0;
while (rows != 0)
{
rows--;
v1 = sc.nextInt();
v2 = sc.nextInt();
if (v1 > v2)
{
System.out.println(">");
}
else if (v1 < v2)
{
System.out.println("<");
}
else
{
System.out.println("=");
}
}
sc.close();
}
}

8.

/**
* Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Markus Schöllner
* @author Andreas Maier
* @version 1.0, 03/27/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.120
*/

import java.util.Scanner;

class Main {

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);
int quantity = scanner.nextInt();
int number1 = 0;
int number2 = 0;

for(int counter = 0; counter < quantity; counter++){
number1 = scanner.nextInt();
number2 = scanner.nextInt();

if(number1 < number2) System.out.println("<");
else {
if(number1 > number2) System.out.println(">");
else System.out.println("=");
}
}
}
}


9.

/**
* Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Fabian Trampusch
* @author Robert Schwarz
* @version 1.0, 03/27/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.276
*/
import java.io.BufferedReader;
import java.util.Scanner;

public class Main {

public static void main(String args[]) {
Scanner sc = new Scanner(System.in);

while (sc.hasNextLine() && sc.hasNextInt())
{
int count = sc.nextInt();

if (count <= 14) {
for (int i = 0; i < count; i++) {
while(!sc.hasNext())
{}

int firstNumber = sc.nextInt();
int secondNumber = sc.nextInt();

if (Math.abs(firstNumber) < 1000000001 && Math.abs(secondNumber) < 1000000001) {
if (firstNumber > secondNumber) {
System.out.println(">");
} else if (firstNumber < secondNumber) {
System.out.println("<");
} else if (firstNumber == secondNumber) {
System.out.println("=");
}
}
}
}

System.exit(0);
}
}
}


10.

/**

 * Angewandte Mathematik, SS11

 * Problem: 11172 Relational Operator

 * Link:
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=11172

 *

 * @author Peter Weismann

 * @author Pirmin Schneider

 * @version 1.0, 03/29/2011

 *

 * Method : Ad-Hoc

 * Status : Accepted

 * Runtime: 0.136

 */



import java.util.Scanner;



public class Main {

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);

        int lines = input.nextInt();

        String[] result = new String[lines];



        if (lines > 15)

            System.out.println("Anzahl der Zeilen darf 15 nicht
überschreiten!");





        for (int i = 0; i < lines; i++) {

            int int1 = input.nextInt();

            int int2 = input.nextInt();



            if (int1 > int2)

                result[i] = ">";

            else if (int1 < int2)

                result[i] = "<";

            else

                result[i] = "=";





        }

        for (String operator: result)

            System.out.println(operator);

    }



}

11.



/**


 * Angewandte Mathematik, SS11


 * Problem: 11172 Relational Operator



 *


 * @author Christopher Westerfield


 * @version 1.0, 03/20/2011


 *


 * Method : Ad-Hoc


 * Status : Accepted


 * Runtime: 0.100


 */


 

import java.util.Scanner;


import java.io.*;


 

 

class Main{


    public static void main(String[] str){


        Scanner sc = new Scanner(System.in);


        int i = sc.nextInt();


        int n1 = 0;


        int n2 = 0;


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


            n1 = sc.nextInt();


            n2 = sc.nextInt();


            if(n1<n2){


                System.out.println("<");


            }else if(n1==n2){


                System.out.println("=");


            }else{


                System.out.println(">");


            }


        }


    }


}

12.

/**
* Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Gent Selmanaj
* @author Peter Weismann
* @author Marco Schuster
* @version 1.0, 2011-03-22
*
* Method :
* Status : Accepted
* Runtime: 0.112
*/

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


public class Main {

/**
* @param args
*/
public static void main(String[] args) {
try {
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
String line = input.readLine();

int numLines=Integer.parseInt(line);
int[][] nums=new int[numLines][2];
for(int i=0;i<numLines;i++) {

}
for(int i=0;i<numLines;i++) {
line=input.readLine();
String[] tmp=line.split(" ");
int int1=Integer.parseInt(tmp[0]);
int int2=Integer.parseInt(tmp[1]);
if(int1<int2)
System.out.println("<");
else if(int1>int2)
System.out.println(">");
else
System.out.println("=");
}
} catch (IOException e) {
e.printStackTrace();
}
}
}

13.

/**
* FWP, Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Sebastian Stumpf
* @author Benjamin Vogt
* @version 1.0, 2011-03-21 08:57:36
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.124
*/

import java.util.*;

class Main
{
public static void main(String[] args)
{
Scanner scanner = new Scanner(System.in);
int t = scanner.nextInt();

if(t<15)
{
for(int i=0; i<t; i++)
{
int a = scanner.nextInt();
int b = scanner.nextInt();

System.out.println(a<b?"<":(a>b?">":"="));
}
}
else
System.err.println("t ist zu groß");
}
}

14.

/**
* Angewandte Mathematik, SS11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Marco Wolff
* @author Christian Weber
* @author Christoph Waldleitner
* @version 1.0, 10/23/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.112
*/
import java.util.*;

public class Main
{

public static void main(String[] args)
{
int times = 0;
boolean a = true;
Scanner s = new Scanner(System.in);
while(a)
{
if (s.hasNextInt())
{
times = s.nextInt();
if(times<15)
{
a = false;
}
}
}
for (int k = 0; k < times; k++)
{
if (s.hasNextInt())
{
int[] numbers = new int[2];
numbers[0] = s.nextInt();
if (s.hasNextInt())
{
numbers[1] = s.nextInt();

if (!(numbers[0] > 1000000001 || numbers[1] > 1000000001))
{
if (numbers[0] > numbers[1])
System.out.println(">");
else if (numbers[0] < numbers[1])
System.out.println("<");
else
System.out.println("=");
}
else
k--;
}
else
k--;
}
else
k--;
}
System.exit(0);
}
}


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

1.

/**
* FWP, Ausgewählte Probleme aus dem ACM Programming Contest, WS10/11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Fabian Liebl
* @version 1.0, 10/06/2010
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.096
*/

import java.io.*;

public class Main {

public static void main(String[] args) {
BufferedReader inputReader = new BufferedReader(new InputStreamReader(System.in));
int numberOfRequests = 0;
int number1 = 0;
int number2 = 0;
try {
numberOfRequests = Integer.parseInt(inputReader.readLine());
} catch (IOException e) {
System.out.println("IOException reading number of requests");
return;
}

for (int i = 0; i < numberOfRequests; i++) {
try {
String[] line = inputReader.readLine().split(" ");
number1 = Integer.parseInt(line[0]);
number2 = Integer.parseInt(line[1]);
} catch (IOException e) {
System.out.println("IOException reading numbers for request " + i);
}
if (number1 > number2) {
System.out.println(">");
} else {
if (number1 < number2) {
System.out.println("<");
} else {
System.out.println("=");
}
}
}
}

}

2.

/**
* FWP, Ausgewählte Probleme aus dem ACM Programming Contest, WS10/11
* Problem: 11172 Relational Operator
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Manuel Hager
* @version 1.0, 10/11/2010
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.108
*/

import java.io.*;

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

String currLine = reader.readLine();

int number = Integer.parseInt(currLine.trim());

for(int i = 0; i < number; i++)
{
currLine = reader.readLine();

String[] parts = currLine.split(" ");

int val1 = Integer.parseInt(parts[0]);
int val2 = Integer.parseInt(parts[1]);

if (val1 == val2)
System.out.println("=");
else if (val1 > val2) {
System.out.println(">");
}
else
System.out.println("<");
}

reader.close();
}
catch(Exception ex) {
throw new RuntimeException(ex);
}
}
}