Source code for submission s856

Go to diff to previous submission

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package mosquito;
 
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
 
/**
 *
 * @author student
 */
public class Mosquito {
 
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String res = sc.nextLine();
        List<Integer> result = new LinkedList<Integer>();
        int[] a =  new int[7];
        int pom = 0;
       while (!"".equals(res)){
        String[] ress = res.split(" ");
           for (int i = 0; i < ress.length; i++) {
               a[i] = Integer.parseInt(ress[i]);
           }
        for (int i = 0; i < a[6]; i++) {
            pom = a[0];
            if(a[5] > 0) a[0] = Math.round(a[1] / a[5]);
            else a[0] = a[1];
            if(a[4] >0)  a[1] = Math.round(a[2] / a[4]);
            else a[1] = a[2];
            a[2] = pom*a[3];                  
 
        }
       result.add(a[0]);
       res = sc.nextLine();       
       }
        for (Integer string : result) {
            System.out.println(string);
        }
 
 
    }
}
 

Diff to submission s803

--- c4.s803.cteam124.mosquito.java.0.Mosquito.java
+++ c4.s856.cteam124.mosquito.java.0.Mosquito.java
@@ -22,26 +22,21 @@
         String res = sc.nextLine();
         List<Integer> result = new LinkedList<Integer>();
-        
-        int pom, m, p, l, e, r, s, n;
+        int[] a =  new int[7];
+        int pom = 0;
        while (!"".equals(res)){
         String[] ress = res.split(" ");
-        m = Integer.parseInt(ress[0]);
-        p = Integer.parseInt(ress[1]);
-        l = Integer.parseInt(ress[2]);
-        e = Integer.parseInt(ress[3]);
-        r = Integer.parseInt(ress[4]);
-        s = Integer.parseInt(ress[5]);
-        n = Integer.parseInt(ress[6]);
-        
-        for (int i = 0; i < n; i++) {
-            pom = m;
-            if(s > 0) m = Math.round(p / s);
-            else m = p;
-            if(r >0)  p = Math.round(l / r);
-            else p = l;
-            l = pom*e;                  
+           for (int i = 0; i < ress.length; i++) {
+               a[i] = Integer.parseInt(ress[i]);
+           }
+        for (int i = 0; i < a[6]; i++) {
+            pom = a[0];
+            if(a[5] > 0) a[0] = Math.round(a[1] / a[5]);
+            else a[0] = a[1];
+            if(a[4] >0)  a[1] = Math.round(a[2] / a[4]);
+            else a[1] = a[2];
+            a[2] = pom*a[3];                  
                         
         }
-       result.add(m);
+       result.add(a[0]);
        res = sc.nextLine();       
        }