김태오 25177

Baekjoon Contest/(2022.06.04) 2022 서강대학교 청정수컵-새내기 Round/(A) 두~~부 두부 두부/theo_sogang_A.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+#define all(v) v.begin(),v.end()
+#define endl "\n"
+#define pii pair<int,int>
+#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+#define fs first
+#define sc second
+#define ll long long
+#define np(v) while(next_permutation(v.begin(),v.end()))
+using namespace std;
+
+int n, m, k;
+int main() {
+	cin >> n >> m >> k;
+	k -= 3; m += k;
+	m %= n;
+	if (m == 0) {
+		m = n;
+	}
+	if (m < 0) {
+		m = n + m;
+	}
+	cout << m;
+}
+
+

Baekjoon Contest/(2022.06.04) 2022 서강대학교 청정수컵-새내기 Round/(B) 청정수열 (Easy)/theo_sogang_B.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+#define all(v) v.begin(),v.end()
+#define endl "\n"
+#define pii pair<int,int>
+#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+#define fs first
+#define sc second
+#define ll long long
+#define np(v) while(next_permutation(v.begin(),v.end()))
+using namespace std;
+
+
+int main() {
+	int res = 1;
+	int n; cin >> n;
+	for (int i = 1; i <= n; i++) {
+		res *= i;
+	}
+	cout << res;
+}
+
+

Baekjoon Contest/(2022.06.04) 2022 서강대학교 청정수컵-새내기 Round/(C) 서강의 역사를 찾아서/theo_sogang_C.cpp

@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+#define all(v) v.begin(),v.end()
+#define endl "\n"
+#define pii pair<int,int>
+#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+#define fs first
+#define sc second
+#define ll long long
+#define np(v) while(next_permutation(v.begin(),v.end()))
+using namespace std;
+
+
+int main() {
+	int n, m; cin >> n >> m;
+	int a[1001] = {}, b[1001] = {};
+	for (int i = 0; i < n; i++) {
+		cin >> a[i];
+	}
+	for (int i = 0; i < m; i++) {
+		cin >> b[i];
+	}
+	int mx = -1e9;
+	for (int i = 0; i < max(n, m); i++) {
+		mx = max(b[i] - a[i], mx);
+	}
+	cout << (mx < 0 ? 0 : mx);
+}
+
+

Codeforces/(2022.05.23) ECR_129/(A) Game with Cards/CF129_A.cpp

@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+#define all(v) v.begin(),v.end()
+#define endl "\n"
+#define pii pair<int,int>
+#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
+#define fs first
+#define sc second
+#define ll long long
+#define np(v) while(next_permutation(v.begin(),v.end()))
+using namespace std;
+
+int n, m, t;
+int k;
+int tmp = 0;
+int main() {
+    fastio;
+    vector<int>a; vector<int>b;
+    cin >> t;
+    while (t--) {
+        a.clear(); b.clear();
+        cin >> n;
+        for (int i = 0; i < n; i++) {
+            cin >> k;
+            a.push_back(k);
+        }
+        cin >> m;
+        for (int i = 0; i < m; i++) {
+            cin >> k; b.push_back(k);
+        }
+        sort(all(a));
+        sort(all(b));
+        if (a[n - 1] >= b[m - 1]) {
+            cout << "Alice" << endl;
+        }
+        else if (a[n - 1] <= b[m - 1]) {
+            cout << "Bob" << endl;
+        }
+        if (a[n - 1] <= b[m - 1]) {
+            cout << "Bob" << endl;
+        }
+        else if (a[n - 1] >= b[m - 1]) {
+            cout << "Alice" << endl;
+        }
+
+
+
+    }
+}