[BOJ 2870] 수학숙제

src/week2/BOJ2870/BOJ2870_V1.cpp

@@ -0,0 +1,90 @@
+#include <bits/stdc++.h>
+using namespace std;
+int N;
+string extract_number_string(string s) {
+    bool is_pre_degit = false;
+    string ret = "";
+    for (int i=0; i<s.length(); i++) {
+        if (isdigit(s[i])) {
+            if (is_pre_degit) {
+                ret += s[i];
+            } else {
+                ret = ret + " " + s[i];
+            }
+            is_pre_degit = true;
+        } else {
+            is_pre_degit = false;
+        }
+    }
+    return ret;
+}
+
+void split(string s, char delim, vector<string> &elems) {
+
+    auto st = 0;
+    auto end = s.find(delim);
+    string temp;
+    while (end != string::npos) {
+        temp = s.substr(st, end - st);
+        if (!temp.empty()) {
+            elems.push_back(temp);
+        }
+        st = end + 1;
+        end = s.find(delim, st);
+    }
+
+    temp = s.substr(st);
+    if (!temp.empty())
+        elems.push_back(temp);
+
+}
+
+bool cmp(string a, string b) {
+
+    if (a.length() != b.length())
+        return a.length() < b.length();
+
+    for (int i = 0; i < a.length(); i++) {
+        if (a[i] != b[i])
+            return a[i] < b[i];
+    }
+
+    return false;
+}
+
+void delete_zero(vector<string> &elems) {
+    if (elems.empty())
+        return;
+    for (int i=0; i<elems.size(); i++) {
+        while (elems[i].length() > 1 && elems[i][0] == '0') {
+            elems[i].erase(0, 1);
+        }
+    }
+}
+int main() {
+
+    ios_base::sync_with_stdio(false);
+
+    cin >> N;
+    vector<string> num_str;
+    vector<string> ret;
+    for (int i = 0; i < N; i++) {
+        string s;
+        cin >> s;
+        num_str.push_back(extract_number_string(s));
+    }
+
+    for (string s : num_str) {
+        split(s, ' ', ret);
+    }
+
+    delete_zero(ret);
+
+    sort(ret.begin(), ret.end(), cmp);
+
+    for (string s : ret) {
+        cout << s << endl;
+    }
+
+    return 0;
+}

src/week2/BOJ2870/BOJ2870_V2.cpp

@@ -0,0 +1,56 @@
+#include <bits/stdc++.h>
+using namespace std;
+int N;
+vector<string> output;
+string s, ret;
+void run() {
+    while(true) {
+        if(ret.size() && ret.front() == '0') {
+            ret.erase(ret.begin());
+        } else {
+            break;
+        }
+    }
+
+    if(ret.size() == 0)
+        ret="0";
+
+    output.push_back(ret);
+    ret = "";
+}
+
+bool cmp(string a, string b) {
+    if (a.size() != b.size())
+        return a.size() < b.size();
+    return a < b;
+}
+int main() {
+
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> N;
+
+    for (int i = 0; i < N; i++) {
+        cin >> s;
+        ret = "";
+        for (int j=0; j<s.length(); j++) {
+            if (s[j] >= '0' && s[j] <= '9') {
+                ret += s[j];
+            } else if (ret.size()){
+                run();
+            }
+        }
+        if (ret.size())
+            run();
+
+    }
+
+    sort(output.begin(), output.end(), cmp);
+
+    for (string s : output) {
+        cout << s << "\n";
+    }
+    return 0;
+}