~7.31

Author: hijunho0811

boj/gist_algomasters/31907

@@ -0,0 +1,45 @@
+#include <iostream>
+
+using namespace std;
+
+int main(){
+    int key;
+    cin >> key;
+    for(int i = 0; i < key; i++){
+        for(int j = 0; j < key; j++){
+            cout << "G";
+        }
+        for(int k = 0; k < key; k++){
+            cout << "...";
+        }
+        cout << "\n";
+    }
+    for(int i = 0; i < key; i++){
+        for(int j = 0; j < key; j++){
+            cout << ".";
+        }
+        for(int k = 0; k < key; k++){
+            cout << "I";
+        }
+        for(int l = 0; l < key; l++){
+            cout << ".";
+        }
+        for(int m = 0; m < key; m++){
+            cout << "T";
+        }
+        cout << "\n";
+    }
+    for(int i = 0; i < key; i++){
+        for(int j = 0; j < key; j++){
+            cout << "..";
+        }
+        for(int k = 0; k < key; k++){
+            cout << "S";
+        }
+        for(int l = 0; l < key; l++){
+            cout << ".";
+        }
+        cout << "\n";
+    }
+
+}

boj/gist_algomasters/31907.cpp

@@ -0,0 +1,40 @@
+#include <iostream>
+#include <string>
+#include <unordered_map>
+#include <vector>
+#include <utility>
+
+
+
+int main(){
+    int numberOfStudents;
+    std::cin >> numberOfStudents;
+
+    std::unordered_map<std::string, std::vector<std::string>> ringMap;
+    std::string name, ring;
+
+    for(int i = 0; i < numberOfStudents; i++){
+        std::cin >> name >> ring;
+        if(ring != "-")
+            ringMap[ring].push_back(name);
+    }
+
+    std::vector<std::pair<std::string, std::string>> couples;
+
+    for(const auto& pair : ringMap){
+        if (pair.second.size() == 2){
+            couples.emplace_back(pair.second[0], pair.second[1]);
+        }
+    }
+    
+    if(couples.empty()){
+        std::cout << "0";
+    } else {
+        std::cout << couples.size() << "\n";
+        for(const auto& couple : couples){
+            std::cout << couple.first << " " << couple.second << "\n";
+        }
+    }
+
+    return 0;
+}

boj/gist_algomasters/31908

@@ -0,0 +1,44 @@
+#include <iostream>
+#include <vector>
+
+int main(){
+    int numberOfCommands, deactivationKey;
+    int arr[7] = {1, 2, 3, 4, 5, 6, 7};
+    std::cin >> numberOfCommands;
+    int commands;
+    std::vector<int> powersOfTwo;
+
+    for(int i = 1; i <= 7; ++i){
+        int power = 1 << i;
+        powersOfTwo.push_back(power);
+    }
+
+    for(int i = 0; i < numberOfCommands; i++){
+        std::cin >> commands;
+        for(int i = 0; i < powersOfTwo.size(); ++i){
+            int a = powersOfTwo[i];
+            int b = commands - a;
+
+            if(b != a){
+                for(int j = 0; j < powersOfTwo.size(); ++j){
+                    if(powersOfTwo[j] == b){
+                        int index_a = i + 1;
+                        int index_b = j + 1;
+
+                        std::swap(arr[index_a], arr[index_b]);
+                        break;
+                    }
+                }
+            }
+        }
+    }
+
+    std::cin >> deactivationKey;
+    for(int i = 0; i < 7; i++){
+        if(arr[i] == deactivationKey){
+            std::cout << i+1;
+        }
+    }
+
+    return 0;
+}

boj/gist_algomasters/31908.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+int main(){
+    int N;
+    std::cin >> N;
+    std::vector<std::vector<int>> grid(N, std::vector<int>(N));
+    for(int i = 0; i < N; i++){
+        for(int j = 0; j < N; j++){
+            std::cin >> grid[i][j];
+        }
+    }
+
+    std::vector<std::vector<long long>> sum(N, std::vector<long long>(N));
+
+    sum[0][0] = grid[0][0];
+    
+    for(int j = 1; j < N; ++j){
+        sum[0][j] = (sum[0][j-1] << 1) + grid[0][j];
+    } 
+
+    for(int i = 1; i < N; ++i){
+        sum[i][0] = (sum[i-1][0] << 1) + grid[i][0];
+    }
+
+    for(int i = 1; i < N; ++i){
+        for(int j = 1; j < N; ++j){
+            sum[i][j] = std::max(sum[i-1][j], sum[i][j-1]) << 1 | grid[i][j]; 
+        }
+    }
+
+    std::cout << sum[N-1][N-1];
+    return 0;
+}

boj/gist_algomasters/31909

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <unordered_map>
+#include <vector>
+using namespace std;
+
+int main()
+{
+	ios_base::sync_with_stdio(false);
+	cin.tie(nullptr);
+
+	int N;
+	cin >> N;
+
+	unordered_map<string, vector<string>> um;
+
+	for (string p, s; cin >> p >> s;) {
+		if (s != "-")
+			um[s].emplace_back(p);
+	}
+
+	int count = 0;
+
+	for (const auto& p : um) {
+		if (p.second.size() == 2)
+			++count;
+	}
+
+	cout << count << '\n';
+
+	if (count) {
+		for (const auto& p : um) {
+			if (p.second.size() == 2)
+				cout << p.second[0] << ' ' << p.second[1] << '\n';
+		}
+	}
+}

boj/gist_algomasters/31909.cpp

@@ -0,0 +1,22 @@
+#include<stdio.h>
+typedef long long ll;
+ll d[31][31],i,j,k,n;
+bool a[31][31];
+int main(){
+    scanf("%lld",&n);
+    for(i=1;i<=n;++i){
+        for(j=1;j<=n;++j){
+            scanf("%lld",&k);
+            a[i][j]=k;
+        }
+    }
+    for(i=1;i<=n;++i){
+        for(j=1;j<=n;++j){
+            d[i][j]=d[i-1][j]>d[i][j-1]?d[i-1][j]:d[i][j-1];
+            k=a[i][j];
+            d[i][j]=(d[i][j]<<1)|k;
+        }
+    }
+    printf("%lld",d[n][n]);
+    return 0;
+}