From 05dba3689987444dd025584733bce05672d9d19e Mon Sep 17 00:00:00 2001
From: Ren Baoshuo <i@baoshuo.ren>
Date: Thu, 22 Oct 2020 21:38:50 +0800
Subject: [PATCH] CF14A Letter

R40309333
---
 problem/CF14A/CF14A.cpp | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 problem/CF14A/CF14A.cpp

diff --git a/problem/CF14A/CF14A.cpp b/problem/CF14A/CF14A.cpp
new file mode 100644
index 00000000..61147f60
--- /dev/null
+++ b/problem/CF14A/CF14A.cpp
@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+    int    n, m;
+    int    minx = 0x3f3f3f, miny = 0x3f3f3f;
+    int    maxx = 0x000000, maxy = 0x000000;
+    string s[55];
+    cin >> n >> m;
+    for (int i = 0; i < n; i++) {
+        cin >> s[i];
+        if (find(s[i].begin(), s[i].end(), '*') != s[i].end()) {
+            minx = min(minx, i);
+            miny = min(miny, (int)(s[i].find_first_of('*') == string::npos ? miny : s[i].find_first_of('*')));
+            maxy = max(maxy, (int)(s[i].find_last_of('*') == string::npos ? maxy : s[i].find_last_of('*')));
+        }
+    }
+    for (int i = n - 1; i >= 0; i--) {
+        if (s[i].find('*') != string::npos) {
+            maxx = i;
+            break;
+        }
+    }
+    for (int i = minx; i <= maxx; i++) {
+        for (int j = miny; j <= maxy; j++) {
+            cout << s[i][j];
+        }
+        cout << endl;
+    }
+    return 0;
+}