fork download
copy 
  1. import java.io.*;
  2.     public class Main {
  3.         public static void main (String[]args)throws Exception{
  4.         BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
  5.  
  6.  
  7.         String[] first_line = read.readLine().split(" ");
  8.         String[] []A = new String [50][];
  9.         String empty;
  10.         int []positions = new int [150];
  11.         int []pancakes = new int [1000];
  12.         String[] ing_bought;
  13.         int []B = new int    [150];
  14.         double lowest;
  15.         int i=0,c;
  16.         int greatest,lowest2;
  17.         int greatest_position;
  18. int u =0;
  19.         while(Integer.parseInt(first_line[0])!=0 && Integer.parseInt(first_line[1])!=0){
  20.             empty = read.readLine();
  21.         if ("0".equals(first_line[0])){
  22.             break;
  23.         }
  24.         ing_bought = read.readLine().split(" ");
  25.  
  26.         for(i=0;i<Integer.parseInt(first_line[1]);i++){
  27.             empty = read.readLine();
  28.             A[i] = read.readLine().split(" ");
  29.         }
  30.  
  31.         for(i=0,c=0;i<Integer.parseInt(first_line[1]);i++,c=0){
  32.             if ("0".equals(A[i][c])){
  33.                 A[i][c] = "1";
  34.             }
  35.  
  36.             lowest2 = Integer.parseInt(ing_bought[c])*10/Integer.parseInt(A[i][c]);
  37.             for(c=1;c<Integer.parseInt(first_line[0]);c++){
  38.                 if ("0".equals(A[i][c])){
  39.                     A[i][c] = "1";
  40.                 }
  41.  
  42.                 if (Integer.parseInt(ing_bought[c])*10/Integer.parseInt(A[i][c]) < lowest2){
  43.                     lowest2 = Integer.parseInt(ing_bought[c])*10/Integer.parseInt(A[i][c]);
  44.                 }
  45.             }
  46.             B[i]=lowest2;  
  47.         }
  48.  
  49.         greatest = (int)B[0];
  50.         greatest_position=1;
  51.         for(i=0;i<Integer.parseInt(first_line[1]);i++){
  52.             if (B[i] > greatest){
  53.                 greatest = (int)B[i];
  54.                 greatest_position = i+1;
  55.             } 
  56.         }
  57.         if (greatest < 1){
  58.             positions[u]=1;
  59.         }
  60. positions[u]=greatest_position;
  61. pancakes[u]=greatest;
  62.       //  System.out.println(greatest_position + " " + greatest + "\n");
  63. empty = read.readLine();
  64. empty = read.readLine();
  65. empty = read.readLine();
  66.  
  67.         first_line = read.readLine().split(" ");
  68.         u++;
  69.         }
  70.         for(int l=0;l<u;l++){
  71.             System.out.println(positions[l] + " " + pancakes[l] + "\n");
  72.         }
  73.         }
  74.     }
  75.  
Success #stdin #stdout 0.09s 212416KB
comments (?)
stdin
copy 
3 2

20 20 20

5 10 1

2 1 3

 

6 3

100 60 130 80 100 90

10 5 10 5 10 5

1 2 1 2 20 7

0 0 0 10 30 1

 

0 0
stdout
copy 
2 66

1 100
https://ideone.com/m0Wmr
language:
Java (HotSpot 12)
created:
14 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!