Add files via upload

Author: deltawing71911

AlgorithmDrills/AlgorithmDrills.iml

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

AlgorithmDrills/out/production/AlgorithmDrills/Baekjoon/No1940.class

@@ -0,0 +1,38 @@
+package Baekjoon;
+import java.io.*;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class No1940 {
+    public static void main(String[] args) throws IOException{
+        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
+
+        int material = Integer.parseInt(bf.readLine());
+        int armour = Integer.parseInt(bf.readLine());
+
+        int[] A = new int[material];
+        StringTokenizer st = new StringTokenizer(bf.readLine());
+        for (int i = 0; i < material; i++) {
+            A[i] = Integer.parseInt(st.nextToken());
+        }
+
+        Arrays.sort(A);
+        int count = 0;
+        int left = 0;
+        int right = material - 1;
+
+        while (left < right) {
+            if (A[left] + A[right] < armour) {
+                left++;
+            } else if (A[left] + A[right] > armour) {
+                right--;
+            } else {
+                count++;
+                left++;
+                right--;
+            }
+        }
+        System.out.println(count);
+        bf.close();
+    }
+}

AlgorithmDrills/out/production/AlgorithmDrills/Baekjoon/No2750_1.class

@@ -0,0 +1,11 @@
+package Baekjoon;
+
+public class No2750_1 {
+    public static void main(String[] args) {
+        int N = 100000;
+        int cnt = 0;
+        for (int i = 0; i < N; i++) {
+            System.out.println("연산 횟수:" + cnt++);
+        }
+    }
+}

AlgorithmDrills/out/production/AlgorithmDrills/Baekjoon/No2750_2.class

@@ -0,0 +1,18 @@
+package Baekjoon;
+
+public class No2750_2 {
+    public static void main(String[] args) {
+        int N = 100000;
+        int cnt = 0;
+
+        for(int i = 0; i < N; i++) {
+            System.out.println("연산 횟수: " + cnt++);
+        }
+        for(int i = 0; i < N; i++) {
+            System.out.println("연산 횟수: " + cnt++);
+        }
+        for(int i = 0; i < N; i++) {
+            System.out.println("연산 횟수: " + cnt++);
+        }
+    }
+}

AlgorithmDrills/out/production/AlgorithmDrills/Baekjoon/No2750_3.class

@@ -0,0 +1,13 @@
+package Baekjoon;
+
+public class No2750_3 {
+    public static void main(String[] args) {
+        int N = 100000;
+        int cnt = 0;
+        for(int i = 0; i < N; i++) {
+            for(int j = 0; j < N; j++) {
+                System.out.println("연산 횟수: " + cnt++);
+            }
+        }
+    }
+}