From 757d677076826cfc4d90403799907860cb8a14c8 Mon Sep 17 00:00:00 2001
From: JinHyeok <101380919+YangJinHyeok@users.noreply.github.com>
Date: Fri, 25 Jul 2025 23:08:57 +0900
Subject: [PATCH] =?UTF-8?q?[20250725]=20BAJ=20/=20=EA=B3=A8=EB=93=9C4=20/?=
 =?UTF-8?q?=20=EC=A2=8B=EB=8B=A4=20/=20=EC=96=91=EC=A7=84=ED=98=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../25 BAJ \354\242\213\353\213\244.md"       | 49 +++++++++++++++++++
 1 file changed, 49 insertions(+)
 create mode 100644 "JinHyeok/202507/25 BAJ \354\242\213\353\213\244.md"

diff --git "a/JinHyeok/202507/25 BAJ \354\242\213\353\213\244.md" "b/JinHyeok/202507/25 BAJ \354\242\213\353\213\244.md"
new file mode 100644
index 0000000..1f9b5ea
--- /dev/null
+++ "b/JinHyeok/202507/25 BAJ \354\242\213\353\213\244.md"	
@@ -0,0 +1,49 @@
+```
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+int main() {
+    int N;
+    cin >> N;
+
+    vector<long long> A(N);
+    for (int i = 0; i < N; ++i)
+        cin >> A[i];
+
+    sort(A.begin(), A.end());
+
+    int count = 0;
+
+    for (int k = 0; k < N; ++k) {
+        int i = 0, j = N - 1;
+
+        while (i < j) {
+            if (i == k) {
+                ++i;
+                continue;
+            }
+            if (j == k) {
+                --j;
+                continue;
+            }
+
+            long long sum = A[i] + A[j];
+
+            if (sum == A[k]) {
+                ++count;
+                break;
+            } else if (sum < A[k]) {
+                ++i;
+            } else {
+                --j;
+            }
+        }
+    }
+
+    cout << count;
+    return 0;
+}
+
+```