fork(1) download
copy 
  1.  
  2. import java.util.*;
  3. import java.lang.*;
  4. import java.io.*;
  5.  
  6. class Ideone
  7. {
  8. 	public static void main (String[] args) throws java.lang.Exception
  9. 	{
  10. 		Scanner in=new Scanner(System.in);
  11. 		long  n,k;
  12.  
  13. 		n=in.nextLong();
  14. 		k=in.nextLong();
  15.  
  16. 		Long arr[]=new Long[(int)n];
  17.  
  18. 		long findMax;      
  19. 		if(n>0&& k>=0)
  20. 		{
  21. 			for(int iter=0;iter<n;iter++)
  22. 			{
  23. 				arr[iter]=in.nextLong();
  24.  
  25. 			}
  26.             if(k==0)
  27.             {
  28.             	     for(int iter=0;iter<n;iter++)
  29. 	      	        { 
  30.         			System.out.print(arr[iter]+"  ");
  31. 	            	}  
  32.  
  33.  
  34.             }
  35. 		    if(k>0)
  36. 			{
  37. 				if(k%2==1)
  38. 			    {k=1;}
  39. 			    else
  40. 		        	{k=2;}
  41.  
  42. 		   	        while(k-->0)
  43. 					{
  44. 					List <Long> list= Arrays.asList(arr);
  45. 				    findMax=(long)Collections.max(list);
  46.  
  47. 				    for(int iter=0;iter<n;iter++)
  48. 				    {
  49. 					arr[iter]=findMax-arr[iter];
  50.  
  51. 				    }    
  52.  
  53. 			        }
  54. 		             for(int iter=0;iter<n;iter++)
  55. 	      	        { 
  56.         			System.out.print(arr[iter]+"  ");
  57. 	            	}  
  58. 		    }
  59. 		}
  60.  
  61. 	}
  62. }
Success #stdin #stdout 0.1s 380736KB
comments (?)
stdin
copy 
5 0
23 23 4 5 6
stdout
copy 
23  23  4  5  6
https://ideone.com/hafiFJ
language:
Java (HotSpot 12)
created:
9 years ago
visibility:
secret

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!