added solutions of random online judges

Author: mustankap

testJava/.classpath

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry kind="src" path=""/>
+	<classpathentry kind="output" path=""/>
+</classpath>

testJava/.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>src_testJava</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

testJava/BreakingBricksCodechef.class

@@ -0,0 +1,57 @@
+/* package codechef; // don't place package name! */
+
+import java.util.*;
+
+
+/* Name of the class has to be "Main" only if the class is public. */
+class BreakingBricksCodechef
+{
+	public static void main (String[] args)
+	{
+	
+	try {
+	    Scanner sc = new Scanner(System.in);
+	  
+	    int T = sc.nextInt();
+	    while(T!=0)
+	    {    
+	       int ans=0;
+	        int s = sc.nextInt();
+	        int w1 = sc.nextInt();
+	        int w2 = sc.nextInt();
+	        int w3 = sc.nextInt();
+	        
+	         
+	         
+	         if(w1<=s)
+	         {   
+	             if(w1+w2+w3<=s)
+	             {  
+	                 ans=1;
+	             }else if(w1+w2<=s)
+	             {
+	                 ans=2;
+	             }
+	             else 
+	             {
+	                 ans=3;
+	             }
+	             
+	         }
+	        
+	        
+	        
+	        
+	        
+	     System.out.println(ans);   
+	        
+	        T--;
+		}
+		
+		
+		sc.close();
+	} catch(Exception e) {return;
+	} 
+
+	}
+}

testJava/BreakingBricksCodechef.java

@@ -0,0 +1,32 @@
+package testJava;
+
+import java.util.Scanner;
+
+public class CHEFWARS {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+		int t = sc.nextInt();
+		while(t-->0)
+		{
+			int h=sc.nextInt();
+			int p=sc.nextInt();
+			while(p>0&&h>0)
+			{
+				h=h-p;
+				p=p/2;
+			}
+			if((p==0||p<0)&&(h>0))
+			{
+				System.out.println(0);
+			}
+			else {
+				System.out.println(1);
+			}
+			
+		}
+
+	}
+
+}

testJava/CHEFWARS.class

@@ -0,0 +1,43 @@
+package testJava;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class CHELADDU {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+		
+		int t = sc.nextInt();
+		while(t-->0)
+		{
+		int n = sc.nextInt();
+		int k = sc.nextInt();
+		int s[]=new int[n];
+		
+		for(int i = 0;i<n;i++)
+		{
+			s[i]=sc.nextInt();
+		}
+		
+		Arrays.parallelSort(s);
+		int temp=0;
+		int min=Integer.MAX_VALUE;
+		
+		for(int i = 0;i<n-1;i++)
+		{
+			temp=Math.abs((s[i+1]-s[i]));
+			if(temp<min)
+			{
+				min=temp;
+			}
+		
+		}
+		
+		System.out.println(min);
+		}
+		
+	}
+
+}

testJava/CHEFWARS.java

@@ -0,0 +1,81 @@
+package testJava;
+import java.util.*;
+import java.io.*;
+class CHFMOT18{
+	//SOLUTION BEGIN
+	void pre() throws Exception{}
+	void solve(int TC) throws Exception{
+	    long S = nl(), N = nl();
+	    long ans = 0;
+	    
+	    ans += S/N;
+	    S %= N;
+	    //Check 1
+	    if(S%2 == 1){
+	        S--;
+	        ans++;
+	    }
+	    //Check 2
+	    if(S > 0)ans++;
+	    //Make sure this check 2 doesn't come before check 1, or you'll fail at cases like S = N+1
+	    pn(ans);
+	}
+	//SOLUTION END
+	void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
+	static boolean multipleTC = true;
+	FastReader in;PrintWriter out;
+	void run() throws Exception{
+	    in = new FastReader();
+	    out = new PrintWriter(System.out);
+	    //Solution Credits: Taranpreet Singh
+	    int T = (multipleTC)?ni():1;
+	    pre();for(int t = 1; t<= T; t++)solve(t);
+	    out.flush();
+	    out.close();
+	}
+	public static void main(String[] args) throws Exception{
+	    new CHFMOT18().run();
+	}
+	int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
+	void p(Object o){out.print(o);}
+	void pn(Object o){out.println(o);}
+	void pni(Object o){out.println(o);out.flush();}
+	String n()throws Exception{return in.next();}
+	String nln()throws Exception{return in.nextLine();}
+	int ni()throws Exception{return Integer.parseInt(in.next());}
+	long nl()throws Exception{return Long.parseLong(in.next());}
+	double nd()throws Exception{return Double.parseDouble(in.next());}
+
+	class FastReader{
+	    BufferedReader br;
+	    StringTokenizer st;
+	    public FastReader(){
+	        br = new BufferedReader(new InputStreamReader(System.in));
+	    }
+
+	    public FastReader(String s) throws Exception{
+	        br = new BufferedReader(new FileReader(s));
+	    }
+
+	    String next() throws Exception{
+	        while (st == null || !st.hasMoreElements()){
+	            try{
+	                st = new StringTokenizer(br.readLine());
+	            }catch (IOException  e){
+	                throw new Exception(e.toString());
+	            }
+	        }
+	        return st.nextToken();
+	    }
+
+	    String nextLine() throws Exception{
+	        String str = "";
+	        try{   
+	            str = br.readLine();
+	        }catch (IOException e){
+	            throw new Exception(e.toString());
+	        }  
+	        return str;
+	    }
+	}
+}