Part1 practice sunwoo

Part1_강의자료/Part1_연습문제_풀이/10986_나머지합/10986.cpp

@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <vector>
+using namespace std;
+
+int main()
+{
+    int N, M;
+    scanf("%d %d", &N, &M);
+
+    vector<int> vec(N + 1);
+    for (int i = 1; i <= N; i++)
+    {
+        int num;
+        scanf("%d", &num);
+        vec[i] = num % M;
+    }
+
+    vector<int> acc_remain_cnt(M);
+    int cur_remain = 0;
+    acc_remain_cnt[cur_remain]++;
+    long long ans = 0;
+
+    for (int i = 1; i <= N; i++)
+    {
+        cur_remain = (cur_remain + vec[i]) % M;
+        ans += acc_remain_cnt[cur_remain];
+        acc_remain_cnt[cur_remain]++;
+    }
+    printf("%lld\n", ans);
+    return 0;
+}

Part1_강의자료/Part1_연습문제_풀이/10986_나머지합/10986.py

@@ -0,0 +1,12 @@
+N, M = map(int, input().split())
+li = list(map(int, input().split()))
+
+acc_remain_cnt = [0] * M
+acc_remain_cnt[cur_remain := 0] = 1
+ans = 0
+
+for x in li:
+    ans += acc_remain_cnt[cur_remain := (cur_remain + x) % M]
+    acc_remain_cnt[cur_remain] += 1
+
+print(ans)

Part1_강의자료/Part1_연습문제_풀이/10986_나머지합/10986_map.cpp

@@ -0,0 +1,27 @@
+#include <map>
+#include <stdio.h>
+#include <vector>
+using namespace std;
+
+int main()
+{
+    int N, M;
+    scanf("%d %d", &N, &M);
+
+    int cur_remain = 0;
+    map<int, int> remain_cnt;
+    remain_cnt[cur_remain] = 1;
+    long long ans = 0;
+
+    for (int i = 0; i < N; i++)
+    {
+        int num;
+        scanf("%d", &num);
+        cur_remain = (cur_remain + num) % M;
+        ans += remain_cnt[cur_remain];
+        remain_cnt[cur_remain]++;
+    }
+
+    printf("%lld\n", ans);
+    return 0;
+}

Part1_강의자료/Part1_연습문제_풀이/1107_리모컨/1107.cpp

@@ -0,0 +1,45 @@
+#include <algorithm>
+#include <stdio.h>
+#include <string.h>
+#include <string>
+using namespace std;
+
+bool can_make_num(int x, bool is_broken[10])
+{
+    if (x == 0)
+        return !is_broken[0];
+    while (x > 0)
+    {
+        if (is_broken[x % 10])
+            return false;
+        x /= 10;
+    }
+    return true;
+}
+
+int main()
+{
+    int N, M;
+    scanf("%d %d", &N, &M);
+
+    bool is_broken[10];
+    memset(is_broken, 0, sizeof(is_broken));
+
+    for (int i = 0; i < M; i++)
+    {
+        int broken;
+        scanf("%d", &broken);
+        is_broken[broken] = true;
+    }
+
+    int ans = N > 100 ? N - 100 : 100 - N;
+    for (int delta = 0; delta < ans; delta++)
+    {
+        int number_to_make[2] = { N + delta, N - delta };
+        for (auto& num : number_to_make)
+            if (num >= 0 && can_make_num(num, is_broken))
+                ans = min(ans, (int)to_string(num).length() + delta);
+    }
+    printf("%d\n", ans);
+    return 0;
+}

Part1_강의자료/Part1_연습문제_풀이/1107_리모컨/1107.py

@@ -0,0 +1,23 @@
+N = int(input())
+M = int(input())
+broken = [] if M == 0 else list(map(int,input().split()))
+is_broken = [1 if i in broken else 0 for i in range(10)]
+
+def can_make_num(x):
+    if x == 0:
+        return not(is_broken[0])
+    while x > 0:
+        if is_broken[x % 10]:
+            return 0
+        x //= 10
+    return 1
+
+
+ans = N - 100 if N > 100 else 100 - N
+for delta in range(ans):
+    num_to_make = [N + delta, N - delta]
+    for num in num_to_make:
+        if num >= 0 and can_make_num(num):
+            ans = min(ans, len(str(num)) + delta)
+
+print(ans)

Part1_강의자료/Part1_연습문제_풀이/1184_귀농/1184.cpp

@@ -0,0 +1,60 @@
+#include <algorithm>
+#include <map>
+#include <stdio.h>
+#include <vector>
+using namespace std;
+
+int get_sum(int top, int left, int bottom, int right, int acc[52][52])
+{
+    return (acc[bottom][right] - acc[bottom][left - 1] - acc[top - 1][right] + acc[top - 1][left - 1]);
+}
+
+int main()
+{
+    int N, acc[52][52];
+    scanf("%d", &N);
+
+    for (int i = 1; i <= N; i++)
+    {
+        for (int j = 1; j <= N; j++)
+        {
+            int num;
+            scanf("%d", &num);
+            acc[i][j] = acc[i][j - 1] + acc[i - 1][j] - acc[i - 1][j - 1] + num;
+        }
+    }
+
+    int ans = 0;
+    for (int r1 = 1; r1 < N; r1++)
+    {
+        for (int c1 = 1; c1 < N; c1++)
+        {
+            vector<int> lt_vertex, lb_vertex;
+            map<int, int> rt_vertex, rb_vertex;
+
+            for (int r2 = 1; r2 <= r1; r2++)
+            {
+                for (int c2 = 1; c2 <= c1; c2++)
+                    lt_vertex.push_back(get_sum(r2, c2, r1, c1, acc));
+                for (int c2 = c1 + 1; c2 <= N; c2++)
+                    lb_vertex.push_back(get_sum(r2, c1 + 1, r1, c2, acc));
+            }
+
+            for (int r2 = r1 + 1; r2 <= N; r2++)
+            {
+                for (int c2 = 1; c2 <= c1; c2++)
+                    rt_vertex[get_sum(r1 + 1, c2, r2, c1, acc)]++;
+                for (int c2 = c1 + 1; c2 <= N; c2++)
+                    rb_vertex[get_sum(r1 + 1, c1 + 1, r2, c2, acc)]++;
+            }
+
+            for (auto& score : lt_vertex)
+                ans += rb_vertex[score];
+            for (auto& score : lb_vertex)
+                ans += rt_vertex[score];
+        }
+    }
+
+    printf("%d\n", ans);
+    return 0;
+}

Part1_강의자료/Part1_연습문제_풀이/1184_귀농/1184.py

@@ -0,0 +1,31 @@
+from collections import defaultdict
+
+N = int(input())
+acc = [[0] * (N + 1) for _ in range(N + 1)]
+
+def get_sum(top, left, bottom, right):
+    return acc[bottom][right] - acc[bottom][left - 1] - acc[top - 1][right] + acc[top - 1][left - 1]
+
+for i in range(1, N + 1):
+    row = list(map(int, input().split()))
+    for j in range(1, N + 1):
+        acc[i][j] = acc[i][j - 1] + acc[i - 1][j] - acc[i - 1][j - 1] + row[j - 1]
+
+ans = 0
+for r1 in range(1, N):
+    for c1 in range(1, N):
+        lt_vertex = defaultdict(int)
+        lb_vertex = defaultdict(int)
+        for r2 in range(1, r1 + 1):
+            for c2 in range(1, c1 + 1):
+                lt_vertex[get_sum(r2, c2, r1, c1)] += 1
+            for c2 in range(c1 + 1, N + 1):
+                lb_vertex[get_sum(r2, c1 + 1, r1, c2)] += 1
+
+        for r2 in range(r1 + 1, N + 1):
+            for c2 in range(1, c1 + 1):
+                ans += lb_vertex[get_sum(r1 + 1, c2, r2, c1)]
+            for c2 in range(c1 + 1, N + 1):
+                ans += lt_vertex[get_sum(r1 + 1, c1 + 1, r2, c2)]
+
+print(ans)

Part1_강의자료/Part1_연습문제_풀이/1764_듣보잡/1764_set.cpp

@@ -0,0 +1,36 @@
+#include <algorithm>
+#include <iostream>
+#include <set>
+#include <vector>
+using namespace std;
+
+int main()
+{
+    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
+
+    int N, M;
+    cin >> N >> M;
+
+    string name;
+    set<string> unhear;
+    for (int i = 0; i < N; i++)
+    {
+        cin >> name;
+        unhear.insert(name);
+    }
+
+    vector<string> ans;
+    for (int i = 0; i < M; i++)
+    {
+        cin >> name;
+        if (unhear.find(name) != unhear.end())
+            ans.push_back(name);
+    }
+
+    sort(ans.begin(), ans.end());
+    cout << ans.size() << '\n';
+    for (auto& name : ans)
+        cout << name << '\n';
+
+    return 0;
+}

Part1_강의자료/Part1_연습문제_풀이/1764_듣보잡/1764_set.py

@@ -0,0 +1,15 @@
+import sys
+input = sys.stdin.readline
+
+N, M = map(int, input().split())
+unhear = set(input().rstrip() for _ in range(N))
+
+ans = []
+for x in [input().rstrip() for _ in range(M)]:
+    if x in unhear:
+        ans.append(x)
+
+ans.sort()
+print(len(ans))
+for name in ans:
+    print(name)

Part1_강의자료/Part1_연습문제_풀이/1764_듣보잡/1764_two_pointer.cpp

@@ -0,0 +1,40 @@
+#include <algorithm>
+#include <iostream>
+#include <set>
+#include <vector>
+using namespace std;
+
+int main()
+{
+    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
+
+    int N, M;
+    cin >> N >> M;
+
+    vector<string> unhear(N);
+    for (int i = 0; i < N; i++)
+        cin >> unhear[i];
+
+    vector<string> unseen(M);
+    for (int i = 0; i < M; i++)
+        cin >> unseen[i];
+
+    sort(unhear.begin(), unhear.end());
+    sort(unseen.begin(), unseen.end());
+
+    int pair_idx = 0;
+    vector<string> ans;
+    for (int i = 0; i < N; i++)
+    {
+        while (pair_idx < M && unseen[pair_idx] < unhear[i])
+            pair_idx++;
+        if (pair_idx < M && unseen[pair_idx] == unhear[i])
+            ans.push_back(unhear[i]);
+    }
+
+    cout << ans.size() << '\n';
+    for (auto& name : ans)
+        cout << name << '\n';
+
+    return 0;
+}

Part1_강의자료/Part1_연습문제_풀이/1764_듣보잡/1764_two_pointer.py

@@ -0,0 +1,18 @@
+import sys
+input = sys.stdin.readline
+
+N, M = map(int, input().split())
+unhear = sorted([input().rstrip() for _ in range(N)])
+unseen = sorted([input().rstrip() for _ in range(M)])
+
+pair_idx = 0
+ans = []
+for x in unhear:
+    while pair_idx < M and unseen[pair_idx] < x:
+        pair_idx += 1
+    if pair_idx < M and unseen[pair_idx] == x:
+        ans.append(x)
+
+print(len(ans))
+for name in ans:
+    print(name)