From 210b98db0c6edbae12821d093691d6f82065896c Mon Sep 17 00:00:00 2001
From: Meenzino <86910955+Minzino@users.noreply.github.com>
Date: Wed, 22 Mar 2023 11:08:14 +0900
Subject: [PATCH] =?UTF-8?q?[minzino]=20bj1943=20-=20=EB=8F=99=EC=A0=84=20?=
 =?UTF-8?q?=EB=B6=84=EB=B0=B0=20=ED=92=80=EC=9D=B4=20=EC=8B=A4=ED=8C=A8(dp?=
 =?UTF-8?q?)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../java/org/example/mar/bj1943/Main.java     | 59 +++++++++++++++++++
 1 file changed, 59 insertions(+)
 create mode 100644 minzino/java/src/main/java/org/example/mar/bj1943/Main.java

diff --git a/minzino/java/src/main/java/org/example/mar/bj1943/Main.java b/minzino/java/src/main/java/org/example/mar/bj1943/Main.java
new file mode 100644
index 0000000..9315666
--- /dev/null
+++ b/minzino/java/src/main/java/org/example/mar/bj1943/Main.java
@@ -0,0 +1,59 @@
+package main.java.org.example.mar.bj1943;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb = new StringBuilder();
+
+        for (int t = 0; t < 3; t++) {
+            int n = Integer.parseInt(br.readLine());
+            int[] coins = new int[n];
+            int[] counts = new int[n];
+            int totalValue = 0;
+
+            for (int i = 0; i < n; i++) {
+                StringTokenizer st = new StringTokenizer(br.readLine());
+                coins[i] = Integer.parseInt(st.nextToken());
+                counts[i] = Integer.parseInt(st.nextToken());
+                totalValue += coins[i] * counts[i];
+            }
+
+            if (totalValue % 2 != 0) {
+                sb.append(0).append('\n');
+            } else {
+                boolean[] dp = new boolean[totalValue / 2 + 1];
+                dp[0] = true;
+
+                for (int i = 0; i < n; i++) {
+                    int coin = coins[i];
+                    int count = counts[i];
+                    for (int k = 1; k <= count; k *= 2) {
+                        for (int j = totalValue / 2; j >= k * coin; j--) {
+                            dp[j] |= dp[j - k * coin];
+                        }
+                        count -= k;
+                    }
+                    if (count > 0) {
+                        for (int j = totalValue / 2; j >= count * coin; j--) {
+                            dp[j] |= dp[j - count * coin];
+                        }
+                    }
+                }
+
+                if (dp[totalValue / 2]) {
+                    sb.append(1).append('\n');
+                } else {
+                    sb.append(0).append('\n');
+                }
+            }
+        }
+        System.out.print(sb);
+    }
+}
+