MGorgon's solutions: Scanner

Showing posts with label Scanner. Show all posts

10/08/2013

12372 - Packing for Holiday - Java

 import java.util.Scanner;  
 public class PackingForHoliday {  
      public static void main(String[] args) {  
           Scanner scan = new Scanner(System.in);  
           int noOfCases = scan.nextInt();  
           int x, y, z;  
           for(int currentCase = 1; currentCase<=noOfCases; currentCase++) {  
                x = scan.nextInt();  
                y = scan.nextInt();  
                z = scan.nextInt();  
                if(x > 20) {  
                     System.out.println("Case " + currentCase + ": bad");  
                     continue;  
                }  
                if(y > 20) {  
                     System.out.println("Case " + currentCase + ": bad");  
                     continue;  
                }  
                if(z > 20) {  
                     System.out.println("Case " + currentCase + ": bad");  
                     continue;  
                }  
                System.out.println("Case " + currentCase + ": good");  
           }  
      }  
 }

12289 - One-Two-Three - Java

 import java.util.Scanner;
 //12289 - One-Two-Three - Java
 public class OneTwoThree {  
      public static void main(String[] args) {  
           Scanner scan = new Scanner(System.in);  
           String line="";  
           int noOfCases = Integer.parseInt(scan.nextLine());  
           while((noOfCases--) > 0) {  
                line = scan.nextLine();  
                if(line.length() == 5) {  
                     System.out.println("3");  
                     continue;  
                }  
                if((line.charAt(0) == 'o' && line.charAt(1) == 'n') ||  
                  (line.charAt(1) == 'n' && line.charAt(2) == 'e') ||  
                  (line.charAt(2) == 'e' && line.charAt(0) == 'o'))   
                          System.out.println("1");  
                else  
                     System.out.println("2");  
           }  
      }  
 }

12279 - Emoogle Balance - Java

 import java.util.Scanner; 
 // 12279 - Emoogle Balance - Java
 public class EmoogleBalance {  
      public static void main(String[] args) {  
           Scanner scanner = new Scanner(System.in);  
           int currentCase = 1;  
           int noOfCases;  
           int currentVal;  
           int total;  
           noOfCases = scanner.nextInt();  
           while(noOfCases != 0) {  
                total = 0;  
                for(int i = 0; i < noOfCases; i++) {  
                     currentVal = scanner.nextInt();  
                     if(currentVal == 0) total--;  
                     else total ++;  
                }  
                System.out.println("Case " + currentCase + ": " + total);  
                noOfCases = scanner.nextInt();  
                currentCase++;  
           }  
      }  
 }

11727 - Cost Cutting - Java

 import java.util.Scanner;
 //11727 - Cost Cutting - Java
 public class CostCutting {  
      static int testCases;  
      static int max;  
      static int min;  
      static int a;  
      static int b;  
      static int c;  
      public static void main(String[] args) {  
           Scanner scanner = new Scanner(System.in);  
           testCases = scanner.nextInt();  
           for(int i = 1; i < testCases+1; i++) {  
                a = scanner.nextInt();  
                b = scanner.nextInt();  
                c = scanner.nextInt();  
                System.out.print("Case " + i + ": ");  
                if (a > b) {  
                     if (b > c) {  
                          System.out.println(b);  
                          continue;  
                     }  
                     if (a > c) {  
                          System.out.println(c);  
                          continue;  
                     }  
                     System.out.println(a);  
                     continue;  
                }  
                if (a > c) {  
                     System.out.println(a);  
                     continue;  
                }  
                if (b > c) {  
                     System.out.println(c);  
                     continue;  
                }  
                System.out.println(b);  
                continue;  
           }  
      }  
 }

11547 - Automatic Answer - Java

 import java.util.Scanner;  
 //11547   
 public class AutomaticAnswer {  
      static int testCases;  
      static String number = "";  
      public static void main(String[] args) {  
           Scanner scanner = new Scanner(System.in);  
           testCases = scanner.nextInt();  
           while((testCases--) != 0) {  
                number = Integer.toString((scanner.nextInt() * 315 + 36962)/10);  
                System.out.println(number.charAt(number.length() - 1));  
           }  
           scanner.close();  
      }  
 }

11498 - Division of Nlogonia - Java

 import java.util.Scanner;  
 //11498  
 public class DivisionOfNlogonia {  
      static int noOfQueries;  
      static int divPtX;  
      static int divPtY;  
      static int ptX;  
      static int ptY;  
      public static void main(String[] args) {  
           Scanner scanner = new Scanner(System.in);  
           while((noOfQueries = scanner.nextInt()) != 0) {  
                divPtX = scanner.nextInt();  
                divPtY = scanner.nextInt();  
                while((noOfQueries--) != 0) {  
                     ptX = scanner.nextInt();  
                     ptY = scanner.nextInt();  
                     doWork();  
                }  
           }  
      }  
      public static void doWork() {  
           if(ptX == divPtX) {  
                System.out.println("divisa");  
                return;  
           }  
           if(ptY == divPtY) {  
                System.out.println("divisa");  
                return;  
           }  
           if(ptY > divPtY) {  
                if(ptX > divPtX) System.out.println("NE");  
                else System.out.println("NO");  
                return;  
           }  
           if(ptX > divPtX) System.out.println("SE");  
           else System.out.println("SO");  
      }  
 }

11364 - Parking - Java

 package org.goro.uva;  
 import java.util.Scanner;  
 //11364 - Parking
 public class Parking {  
      static short testCases, shops;  
      static short min;  
      static short max;  
      static short val;  
      static Scanner scanner;  
      public static void main(String[] args) {  
           scanner = new Scanner(System.in);  
           testCases = scanner.nextShort();  
           while((testCases--) != 0) {  
                shops = scanner.nextShort();  
                min = 100;  
                max = 0;  
                while((shops--) != 0) {  
                     val = scanner.nextShort();  
                     if(val > max) max = val;  
                     if(val < min) min = val;  
                }  
                System.out.println((max - min) * 2);  
           }  
      }  
 }

11172 - Relational Operator - Java

 import java.util.Scanner;  
 public class RelationalOperator {  
      static int testCases;  
      static int a, b;  
      public static void main(String[] args) {  
           Scanner scanner = new Scanner(System.in);  
           testCases = scanner.nextInt();  
           for(int i = 0; i < testCases; i++) {  
                a = scanner.nextInt();  
                b = scanner.nextInt();  
                if(a > b) System.out.println(">");  
                else if(a < b) System.out.println("<");  
                else System.out.println("=");  
           }  
           scanner.close();  
      }  
 }

11044 - Searching for Nessy - Java

 import java.util.Scanner;  
 //11044  
 public class SearchingForNessy {  
      static int testCases;  
      static int val1, val2;  
      public static void main(String[] args) {  
           Scanner scanner = new Scanner(System.in);  
           testCases = scanner.nextInt();  
           while((testCases--) != 0) {  
                val1 = scanner.nextInt();  
                val2 = scanner.nextInt();  
                val1 = val1/3;  
                val2 = val2/3;  
                System.out.println(val1 * val2);  
           }  
           scanner.close();  
      }  
 }

10550 - Combination Lock - Java

 import java.util.Scanner;  
 //10550  
 public class CombinationLock {  
      static int val1, val2, val3, val4;  
      static int sum;  
      public static void main(String[] args) {  
           Scanner scanner = new Scanner(System.in);  
           while(true) {  
                val1 = scanner.nextInt();  
                val2 = scanner.nextInt();  
                val3 = scanner.nextInt();  
                val4 = scanner.nextInt();  
                if((val1 == val2) && (val2 == val3) && (val3 == val4) && (val4 == 0)) break;  
                sum = val1 - val2;  
                if(val1 < val2) {  
                     sum += 40;  
                }  
                sum += (val3 - val2);  
                if(val2 > val3) {  
                     sum += 40;  
                }  
                sum += (val3 - val4);  
                if(val3 < val4) {  
                     sum += 40;  
                }  
                System.out.println((sum + 120) * 9);  
           }  
           scanner.close();  
      }  
 }

1124 - Celebrity jeopardy - Java

 
 import java.util.Scanner;  
 //1124  
 public class CelebrityJeopardy {  
      public static void main(String[] args) {  
           Scanner scanner = new Scanner(System.in);  
           while(scanner.hasNext()) {  
                System.out.println(scanner.nextLine());  
           }  
           scanner.close();  
      }  
 }

272 - TEX Quotes - Java

 
import java.util.Scanner;  
//272 - TEX Quotes
public class TEXQuotes {  
      public static void main(String[] args) {  
           Scanner scanner = new Scanner(System.in);  
           String line;  
           boolean open = true;  
           boolean end = false;  
           while(scanner.hasNextLine()) {  
                line = scanner.nextLine();  
                for(int i = 0; i < line.length(); i++) {  
                     if(line.charAt(i) == '\u001a'){  
                          end = true;  
                          break;  
                     }  
                     if(line.charAt(i) == '\"') {  
                          if(open == true) {  
                               System.out.print("``");  
                               open = false;  
                               continue;  
                          } else {  
                               System.out.print("''");  
                               open = true;  
                               continue;  
                          }  
                     }  
                     System.out.print(line.charAt(i));  
                }  
                System.out.print("\n");       
           }  
      }  
 }