Codechef LongChallenge

Author: singhaniatanay

CODECHEF/August-Long-Challenge/DSTAPLS_Distribute_Apples.java

@@ -0,0 +1,27 @@
+import java.io.*;
+import java.math.BigInteger;
+import java.util.Scanner;
+
+public class DSTAPLS_Distribute_Apples {
+    public static void main(String[] args) throws IOException {
+        Scanner br = new Scanner(System.in);
+        PrintWriter pw = new PrintWriter(System.out);
+        int t = br.nextInt();
+        for (int i = 0; i <t ; i++) {
+            pw.println(disApples(br.nextBigInteger(),br.nextBigInteger()));
+        }
+        pw.flush();
+        br.close();
+    }
+
+    private static String disApples(BigInteger a, BigInteger b) {
+        if(a.equals(BigInteger.ZERO) || b.equals(BigInteger.ONE)){
+            return "NO";
+        }
+        if(a.compareTo(BigInteger.ZERO)<0){
+            return "YES";
+        }
+        return disApples(a.subtract(b.multiply(b)),b);
+    }
+
+}

CODECHEF/August-Long-Challenge/MSNSADM1_Football.java

@@ -0,0 +1,36 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.io.PrintWriter;
+
+public class MSNSADM1_Football {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        PrintWriter pw = new PrintWriter(System.out);
+        int t = Integer.parseInt(br.readLine());
+        for (int i = 0; i <t ; i++) {
+            int n = Integer.parseInt(br.readLine());
+            int[] A = new int[n];
+            int[] B = new int[n];
+            String[] a = br.readLine().split(" ");
+            String[] b = br.readLine().split(" ");
+            for (int j = 0; j <n ; j++) {
+                A[j] = Integer.parseInt(a[j]);
+                B[j] = Integer.parseInt(b[j]);
+            }
+            pw.println(football(A,B));
+        }
+        pw.flush();
+        br.close();
+    }
+
+    private static int football(int[] a, int[] b) {
+        int max = 0;
+        for (int i = 0; i < a.length; i++) {
+            int score = (a[i]*2)-b[i];
+            score = score<0?0:score;
+            max = score>max?score:max;
+        }
+        return max*10;
+    }
+}

Competitive Programming.iml

@@ -21,6 +21,8 @@
       <sourceFolder url="file://$MODULE_DIR$/Trees" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/BITWISE ALGORITHMS" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/Basic Code" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/CODECHEF/August-Long-Challenge" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/CODECHEF" isTestSource="false" />
     </content>
     <orderEntry type="inheritedJdk" />
     <orderEntry type="sourceFolder" forTests="false" />