[송지민] 1주차 과제 제출

extra/10816.cpp

@@ -0,0 +1,52 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int N, M;
+map<int, int> m;
+vector<int> v;
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> N;
+    for (int i = 0; i < N; i++)
+    {
+        int num;
+        cin >> num;
+        if (m.find(num) != m.end())
+        {
+            m[num]++;
+        }
+        else
+        {
+            m.insert({num, 1});
+            v.push_back(num); // 중복없이 저장
+        }
+    }
+
+    sort(v.begin(), v.end());
+
+    cin >> M;
+    for (int i = 0; i < M; i++)
+    {
+        int num;
+        cin >> num;
+        if (binary_search(v.begin(), v.end(), num))
+        {
+            cout << m[num];
+        }
+        else
+        {
+            cout << 0;
+        }
+
+        if (i != M - 1)
+        {
+            cout << " ";
+        }
+    }
+}

extra/10870.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n;
+
+int F[21] = {
+    0,
+};
+
+void go()
+{
+    F[0] = 0;
+    F[1] = 1;
+    for (int i = 2; i <= n; i++)
+    {
+        F[i] = F[i - 1] + F[i - 2];
+    }
+}
+
+int main()
+{
+    cin >> n;
+    go();
+
+    cout << F[n];
+}

extra/1654.cpp

@@ -0,0 +1,60 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int K, N;
+vector<int> v;
+int max_len = 1;
+long long sum = 0;
+
+void b_search()
+{
+    long long low = 0;
+    long long high = sum / N;
+    // 다 합한 뒤 필요한 개수로 나눔  = 최대 길이
+    while (low <= high)
+    {
+        long long mid = (low + high) / 2;
+        if (mid == 0)
+        {
+            return;
+        }
+        // 각 랜선을 최대 길이로 나눈 몫의 합이 N과 같거나 클때 까지 연산
+        int cnt = 0;
+        for (int i = 0; i < K; i++)
+        {
+
+            cnt += v[i] / mid;
+        }
+
+        if (cnt >= N)
+        {
+            if (max_len < mid)
+                max_len = mid;
+            low = mid + 1;
+        }
+        else if (cnt < N)
+        {
+            high = mid - 1;
+        }
+    }
+}
+
+int main()
+{
+
+    cin >> K >> N;
+    for (int i = 0; i < K; i++)
+    {
+        int a;
+        cin >> a;
+        v.push_back(a);
+        sum += a;
+    }
+
+    b_search();
+
+    cout << max_len;
+
+    return 0;
+}

extra/17843.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    while (n--)
+    {
+        int h, m, s;
+        cin >> h >> m >> s;
+
+        // 시침: 1시간 30도 / 1분 0.5도 / 1초 0.008333
+        double a = 30 * h + m * (0.5) + s * 0.008333333;
+
+        // 분침: 1분 6도 / 1초 0.1도
+        double b = m * 6 + s * 0.1;
+
+        // 초침: 1초 6도
+        double c = 6 * s;
+
+        double temp1 = abs(a - b);
+        double temp2 = abs(a - c);
+        double temp3 = abs(b - c);
+
+        if (temp1 > 180)
+            temp1 = 360 - temp1;
+        if (temp2 > 180)
+            temp2 = 360 - temp2;
+        if (temp3 > 180)
+            temp3 = 360 - temp3;
+
+        double answer = min({temp1, temp2, temp3});
+
+        cout << fixed << setprecision(6) << answer << '\n';
+    }
+}

extra/181832.cpp

@@ -0,0 +1,55 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+int a[30][30] = {
+    0,
+};
+
+vector<vector<int>> solution(int n)
+{
+    int curr = 1;
+    for (int i = 0; i < n; i++)
+    {
+        for (int j = 0; j < n; j++)
+        {
+            if (!a[i][j])
+            {
+                a[i][j] = curr;
+                curr++;
+            }
+        }
+        for (int j = 0; j < n; j++)
+        {
+            if (!a[j][n - i - 1])
+            {
+                a[j][n - i - 1] = curr;
+                curr++;
+            }
+        }
+        for (int j = 0; j < n; j++)
+        {
+            if (!a[n - i - 1][n - 1 - j])
+            {
+                a[n - i - 1][n - 1 - j] = curr;
+                curr++;
+            }
+        }
+        for (int j = 0; j < n; j++)
+        {
+            if (!a[n - 1 - j][i])
+            {
+                a[n - 1 - j][i] = curr;
+                curr++;
+            }
+        }
+    }
+    vector<vector<int>> answer(n, vector<int>(n, 0));
+    for (int i = 0; i < n; i++)
+    {
+        for (int j = 0; j < n; j++)
+        {
+            answer[i][j] = a[i][j];
+        }
+    }
+    return answer;
+}

extra/1845.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+map<int, int> m;
+
+int solution(vector<int> nums)
+{
+    for (int num : nums)
+    {
+        if (m.find(num) != m.end())
+        {
+            m[num]++;
+        }
+        else
+        {
+            m.insert({num, 1});
+        }
+    }
+
+    // 가져갈 포켓몬 수
+    int total = nums.size() / 2;
+
+    int answer = m.size();
+    if (answer > total)
+        return total;
+    return answer;
+}

extra/1920.cpp

@@ -0,0 +1,52 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int N, M;
+vector<int> a;
+
+int b_search(int target, int low, int high)
+{
+    while (low <= high)
+    {
+        int mid = (low + high) / 2;
+        if (a[mid] == target)
+            return 1;
+
+        if (a[mid] > target)
+        {
+            high = mid - 1;
+        }
+        else if (a[mid] < target)
+        {
+            low = mid + 1;
+        }
+    }
+
+    return 0;
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+    cin >> N;
+    for (int i = 0; i < N; i++)
+    {
+        int num;
+        cin >> num;
+        a.push_back(num);
+    }
+
+    sort(a.begin(), a.end());
+
+    cin >> M;
+    for (int i = 0; i < M; i++)
+    {
+        int num;
+        cin >> num;
+        cout << b_search(num, 0, a.size() - 1) << '\n';
+    }
+    return 0;
+}