Algo/2 3

BOJ_10189.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+#pragma GCC optimize("O3")
+#define ll long long
+#define ull unsigned long long
+#define  pii pair<int,int>
+#define MOD 1000000000
+const ll INF = 10e12 + 10;
+using namespace std;
+
+int main() {
+    ios_base::sync_with_stdio(false), cin.tie(0);
+    cout << "#  # #### #### #  #" << endl;
+    cout << "#### #  # #  # # #" << endl;
+    cout << "#### #  # #  # # #" << endl;
+    cout << "#  # #### #### #  #" << endl;
+}

BOJ_1080.cpp

@@ -0,0 +1,63 @@
+#include <bits/stdc++.h>
+#pragma GCC optimize("O3")
+#define ll long long
+#define ull unsigned long long
+#define  pii pair<int,int>
+#define MOD 1000000000
+const ll INF = 10e12 + 10;
+using namespace std;
+
+char A[55][55];
+char B[55][55];
+int n, m;
+
+void Checked(int a, int b) {
+    for (int i = a; i <= a + 2; i++) {
+        for (int j = b; j <= b + 2; j++) {
+            if (A[i][j] == '0')
+                A[i][j] = '1';
+            else
+                A[i][j] = '0';
+        }
+    }
+    // for (int i = 1; i <= n; i++) {
+    //     for (int j = 1; j <= m; j++) {
+    //         cout << A[i][j] << " ";
+    //     }
+    //     cout << '\n';
+    // }
+    // cout << '\n';
+}
+
+int main() {
+    ios_base::sync_with_stdio(false), cin.tie(0);
+
+    cin >> n >> m;
+
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < m; j++) {
+            cin >> A[i][j];
+        }
+    }
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < m; j++) {
+            cin >> B[i][j];
+        }
+    }
+    int cnt = 0;
+    for (int i = 0; i < n - 2; i++) {
+        for (int j = 0; j < m - 2; j++) {
+            // cout << i << " " << j << '\n';
+            if (A[i][j] != B[i][j]) {
+                // cout << i << " " << j << '\n';
+                Checked(i, j);
+                cnt++;
+            }
+        }
+    }
+    for (int i = 0; i < n; i++)
+        for (int j = 0; j < m; j++)
+            if (A[i][j] != B[i][j])
+                cnt = -1;
+    cout << cnt << '\n';
+}

BOJ_1132.cpp

@@ -0,0 +1,13 @@
+#include <bits/stdc++.h>
+#pragma GCC optimize("O3")
+#define ll long long
+#define ull unsigned long long
+#define  pii pair<int,int>
+#define MOD 1000000000
+const ll INF = 10e12 + 10;
+using namespace std;
+
+int main() {
+    ios_base::sync_with_stdio(false), cin.tie(0);
+
+}

BOJ_11758.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+#pragma GCC optimize("O3")
+#define ll long long
+#define ull unsigned long long
+#define  pii pair<int,int>
+#define MOD 1000000000
+const ll INF = 10e12 + 10;
+using namespace std;
+
+int main() {
+    ios_base::sync_with_stdio(false), cin.tie(0);
+    int x1, x2, x3, y1, y2, y3;
+    cin >> x1 >> y1;
+    cin >> x2 >> y2;
+    cin >> x3 >> y3;
+    int ccw = (x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1);
+    if (ccw > 0)
+        cout << 1;
+    else if (ccw < 0)
+        cout << -1;
+    else
+        cout << 0;
+}

BOJ_12849.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+#pragma GCC optimize("O3")
+#define ll long long
+#define ull unsigned long long
+#define  pii pair<int,int>
+#define MOD  1000000007
+const ll INF = 10e12 + 10;
+using namespace std;
+
+ll bon[8]; // 정보관을 idx= 0으로 시작하여 반시계방향으로 idx++
+ll dp[8];
+
+int main() {
+    ios_base::sync_with_stdio(false), cin.tie(0);
+    int d;
+    cin >> d;
+    dp[0] = 1;
+    for (int i = 0; i < d; i++) {
+        bon[0] = dp[1] + dp[7];
+        bon[1] = dp[0] + dp[2] + dp[7];
+        bon[2] = dp[1] + dp[3] + dp[6] + dp[7];
+        bon[3] = dp[2] + dp[4] + dp[6];
+        bon[4] = dp[3] + dp[5];
+        bon[5] = dp[4] + dp[6];
+        bon[6] = dp[2] + dp[3] + dp[5] + dp[7];
+        bon[7] = dp[0] + dp[1] + dp[2] + dp[6];
+
+        for (int j = 0; j < 8; j++)
+            dp[j] = bon[j] % MOD;
+    }
+    cout << dp[0];
+}

BOJ_12850.cpp

@@ -0,0 +1,60 @@
+#include <bits/stdc++.h>
+#pragma GCC optimize("O3")
+#define ll long long
+#define ull unsigned long long
+#define  pii pair<int,int>
+#define MOD 1000000007
+const ll INF = 10e12 + 10;
+using namespace std;
+
+typedef vector<vector<long long> > matrix;
+
+matrix operator *(const matrix &a, const matrix &b) {
+    int n = a.size();
+    matrix c(n, vector<long long>(n, 0));
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < n; j++) {
+            for (int k = 0; k < n; k++) {
+                c[i][j] += (a[i][k] * b[k][j]) % MOD;
+                c[i][j] %= MOD;
+            }
+        }
+    }
+    return c;
+}
+
+matrix A = {
+    {0, 1, 0, 0, 0, 1, 0, 0},
+    {1, 0, 1, 0, 0, 0, 1, 0},
+    {0, 1, 0, 1, 0, 0, 1, 1},
+    {0, 0, 1, 0, 1, 0, 0, 1},
+    {0, 0, 0, 1, 0, 0, 0, 1},
+    {1, 0, 0, 0, 0, 0, 1, 0},
+    {0, 1, 1, 0, 0, 1, 0, 1},
+    {0, 0, 1, 1, 1, 0, 1, 0}
+};
+
+matrix ans = {
+    {1, 0, 0, 0, 0, 0, 0, 0},
+    {0, 1, 0, 0, 0, 0, 0, 0},
+    {0, 0, 1, 0, 0, 0, 0, 0},
+    {0, 0, 0, 1, 0, 0, 0, 0},
+    {0, 0, 0, 0, 1, 0, 0, 0},
+    {0, 0, 0, 0, 0, 1, 0, 0},
+    {0, 0, 0, 0, 0, 0, 1, 0},
+    {0, 0, 0, 0, 0, 0, 0, 1}
+};
+
+int main() {
+    ios_base::sync_with_stdio(false), cin.tie(0);
+    int d;
+    cin >> d;
+    while (d > 0) {
+        if (d % 2) {
+            ans = ans * A;
+        }
+        A = A * A;
+        d /= 2;
+    }
+    cout << ans[4][4] << '\n';
+}

BOJ_1377.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+#pragma GCC optimize("O3")
+#define ll long long
+#define ull unsigned long long
+#define  pii pair<int,int>
+#define MOD 1000000000
+const ll INF = 10e12 + 10;
+using namespace std;
+
+pii A[505050];
+
+int main() {
+    ios_base::sync_with_stdio(false), cin.tie(0);
+    int n;
+    cin >> n;
+    for (int i = 0; i < n; i++) {
+        cin >> A[i].first;
+        A[i].second = i;
+    }
+    stable_sort(A, A + n);
+    int ans = 0;
+    for (int i = 0; i < n; i++) {
+        cout << A[i].second << " ";
+        // cout << A[i].second - i << " ";
+        ans = max(ans, abs(A[i].second - i));
+    }
+    // cout << ans + 1;
+}