fork download
copy 
  1.  
  2. import java.io.BufferedReader;
  3. import java.io.IOException;
  4. import java.io.InputStreamReader;
  5. import java.io.Reader;
  6. import java.util.logging.Level;
  7. import java.util.logging.Logger;
  8.  
  9.  
  10. /*
  11.  * To change this template, choose Tools | Templates
  12.  * and open the template in the editor.
  13.  */
  14.  
  15. /**
  16.  *
  17.  * @author saopayne
  18.  */
  19.  
  20. /**
  21.  * 
  22.  * ProblemCode RRSTONE May challenge
  23.  */
  24. public class Main {
  25.  
  26.  
  27.     public static long findLargest(long[] numbers){  
  28.         long largest = numbers[0];  
  29.         for(int i= 1; i < numbers.length; i++){  
  30.             if(numbers[i] > largest){  
  31.                 largest = numbers[i];  
  32.             }  
  33.          }  
  34.     return largest;
  35. }
  36.  
  37.     public static StringBuilder  deductNumfromLargest(long [] numbers ,long largest, long maxNumbers){
  38.  
  39.         long [] newArray = new long [(int)maxNumbers ];
  40.         StringBuilder builder = new StringBuilder();
  41.  
  42.         for (int i = 0 ; i < maxNumbers; i++){
  43.  
  44.                 numbers[i] = largest - numbers[i];
  45.  
  46.                     newArray[i] = numbers[i];
  47.  
  48.                     builder.append(newArray[i] + " ");
  49.  
  50.         }
  51.  
  52.                 return builder;
  53.  
  54.     }
  55.  
  56.     public static void main (String [] args){
  57.  
  58.         try {
  59.  
  60.             BufferedReader bufReader = new BufferedReader(new InputStreamReader(System.in));
  61.  
  62.             String [] theLine = bufReader.readLine().split(" ");
  63.  
  64.             long lengthOfArray = Long.parseLong(theLine[0]);
  65.             long numOfTurns = Long.parseLong(theLine[1]);
  66.  
  67.             if ((lengthOfArray >= 1 && lengthOfArray <= 100000) && (numOfTurns >= 0 && numOfTurns <= 1000000000)){
  68.  
  69.             String [] secondLine = bufReader.readLine().split(" ");
  70.  
  71.             long [] finalArray = new long [(int)lengthOfArray];
  72.  
  73.                 for (int i = 0; i < secondLine.length ; i++){
  74.  
  75.                           long num = Long.parseLong(secondLine[i]);
  76.                           if (Math.abs(num) > 2000000000){
  77.                               System.exit(0);
  78.                           }
  79.                           else if (Math.abs(num) >= 0) {
  80.                             finalArray[i] = num;
  81.  
  82.                       }
  83.             }
  84.             //deduct each value from the largest
  85.             StringBuilder newest = null;
  86.             for (int j = 0 ; j < numOfTurns;j ++){
  87.                  newest = deductNumfromLargest(finalArray, findLargest(finalArray), (int)lengthOfArray);
  88.  
  89.             }
  90.             System.out.println(newest);
  91.  
  92.             }else{
  93.                 System.exit(0);
  94.             }
  95.         } catch (IOException ex) {
  96.             Logger.getLogger(Main.class.getName()).log(Level.SEVERE, null, ex);
  97.         }
  98.  
  99.     }
  100. }
  101.  
Runtime error #stdin #stdout #stderr 0.07s 380224KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
Exception in thread "main" java.lang.NullPointerException
	at Main.main(Main.java:62)
https://ideone.com/wT8XtF
language:
Java (HotSpot 12)
created:
9 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!