boj step 7 rework

zeta_cpp/completed/10798.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main() {
+    vector<string> S;
+    string temp;
+    for (int i = 0; i < 5; i++) {
+        cin >> temp;
+        S.push_back(temp);
+    }
+
+
+    bool is_fin = false;
+    bool flag = false;
+    int j = 0;
+    while (!is_fin) {
+        flag = false;
+        for (int i = 0; i < 5; i++) {
+            if (S[i].length() <= j) {
+                is_fin = is_fin;
+                continue;
+            }
+            flag = true;
+            cout << S[i][j];
+
+        }
+
+        if (!flag) is_fin = true;
+        j++;
+    }
+
+    return 0;
+}

zeta_cpp/completed/2563.cpp

@@ -0,0 +1,30 @@
+#include <iostream>
+
+using namespace std;
+
+void add_paper(int P[], int x, int y) {
+    for (int i = 0; i < 10; i++) {
+        for (int j = 0; j < 10; j++) {
+            P[(x - 1 + i) * 100 + y - 1 + j] = 1;
+        }
+    }
+}
+
+
+int main() {
+    int Paper[100 * 100] = {0,};
+    int N;
+
+    cin >> N;
+    int _x, _y;
+    for (int i = 0; i < N; i++) {
+        cin >> _x >> _y;
+        add_paper(Paper, _x, _y);
+    }
+    int A = 0;
+    for (int i = 0; i < 10000; i++) {
+        A += Paper[i];
+    }
+    cout << A;
+    return 0;
+}

zeta_cpp/completed/2566.cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+
+int main() {
+    int TM = 0;
+    int now;
+    int idx_x, idx_y;
+    for (int i = 0; i < 9; i++) {
+        for (int j = 0; j < 9; j++) {
+            std::cin >> now;
+            if (now >= TM) {
+                TM = now;
+                idx_x = i + 1;
+                idx_y = j + 1;
+            }
+        }
+
+    }
+
+    std::cout << TM << std::endl;
+    std::cout << idx_x << " " << idx_y << std::endl;
+}

zeta_cpp/completed/2738.cpp

@@ -0,0 +1,46 @@
+#include<iostream>
+#include<vector>
+
+using namespace std;
+
+auto sum(int N, int M, int A[], int B[], int S[]) {
+    for (int i = 0; i < N; i++) {
+        for (int j = 0; j < M; j++) {
+            S[i * M + j] = A[i * M + j] + B[i * M + j];
+        }
+    }
+    return S;
+}
+
+void display(int N, int M, int S[]) {
+    for (int i = 0; i < N; i++) {
+        for (int j = 0; j < M; j++) {
+            cout << S[i * M + j];
+            if (j < M - 1) {
+                cout << " ";
+            }
+        }
+        cout << endl;
+    }
+}
+
+int main() {
+    int N, M;
+    cin >> N >> M;
+    int A[N * M];
+    int B[N * M];
+    int S[N * M];
+    for (int i = 0; i < N; i++) {
+        for (int j = 0; j < M; j++) {
+            cin >> A[i * M + j];
+        }
+    }
+    for (int i = 0; i < N; i++) {
+        for (int j = 0; j < M; j++) {
+            cin >> B[i * M + j];
+        }
+    }
+    sum(N, M, A, B, S);
+    display(N, M, S);
+    return 0;
+}