README.md

@@ -2,7 +2,7 @@
 
 [![Author](https://img.shields.io/badge/Author-Baoshuo-b68469.svg?style=flat-square)](https://baoshuo.ren) [![Stars](https://img.shields.io/github/stars/renbaoshuo/OI-codes?style=flat-square)](https://github.com/renbaoshuo/OI-codes/stargazers) [![GPL-3.0 License](https://img.shields.io/github/license/renbaoshuo/OI-codes?style=flat-square)](/LICENSE)
 
-本仓库的主仓库位于 [GitSB](https://git.sb/baoshuo/OI-codes) 上，并在 [GitHub](https://github.com/renbaoshuo/OI-codes)、[GitLab](https://gitlab.com/baoshuo/OI-codes) 和 [GitMac](https://git.m.ac/baoshuo/OI-codes) 上设立了镜像。
+本仓库的主仓库位于 [GitSB](https://git.sb/baoshuo/OI-codes) 上，并在 [GitHub](https://github.com/renbaoshuo/OI-codes) 和 [GitLab](https://gitlab.com/baoshuo/OI-codes) 上设立了镜像。
 
 ## 说明
 
@@ -41,7 +41,7 @@ git lfs clone https://git.sb/baoshuo/OI-codes.git
 如果克隆仓库时不需要拉取测试数据，可以使用以下命令：
 
 ```bash
-GIT_LFS_SKIP_SMUDGE=1 git clone https://git.sb/baoshuo/OI-codes.git
+git clone https://git.sb/baoshuo/OI-codes.git --skip-smudge
 ```
 
 后期如果希望再次拉取测试数据，可以使用以下命令：

S2OJ/1466/1466.cpp

@@ -1,50 +0,0 @@
-#include <iostream>
-#include <algorithm>
-#include <functional>
-#include <iomanip>
-
-using std::cin;
-using std::cout;
-const char endl = '\n';
-
-const int N = 55;
-const double eps = 1e-10;
-
-int n, c, k, a[N];
-
-bool check(double x) {
-    int t = std::lower_bound(a + 1, a + 1 + n, static_cast<int>(x), std::greater<int>()) - a;
-
-    if (n + c - (n - t + 1) < k) return false;  // 最坏情况时无法满足要求
-
-    int cnt = 0;
-    for (int i = 1; i <= t; i++) {
-        cnt += a[i] / x;  // 能拆成几个满足要求的
-    }
-
-    return cnt >= k;
-}
-
-int main() {
-    std::ios::sync_with_stdio(false);
-    cin.tie(nullptr);
-
-    cin >> n >> c >> k;
-
-    for (int i = 1; i <= n; i++) {
-        cin >> a[i];
-    }
-
-    std::sort(a + 1, a + 1 + n, std::greater<int>());
-
-    double l = 0, r = 1e9;
-    for (int i = 0; i < 1000; i++) {
-        double mid = (l + r) / 2;
-
-        (check(mid) ? l : r) = mid;
-    }
-
-    cout << std::fixed << std::setprecision(12) << l << endl;
-
-    return 0;
-}

UniversalOJ/734/734.cpp

@@ -1,69 +0,0 @@
-#include <cstdio>
-#include <iostream>
-#include <string>
-#include <unordered_map>
-#include <vector>
-
-using std::cin;
-using std::cout;
-const char endl = '\n';
-
-const int N = 105;
-
-int n;
-std::string s[N];
-std::unordered_map<std::string, std::pair<std::string, bool>> def;
-
-std::string dfs(std::string s) {
-    std::string r;
-
-    for (int i = 0, j; i < s.size(); i += j) {
-        for (j = 0; i + j < s.size() &&
-                    ('0' <= s[i + j] && s[i + j] <= '9' ||
-                     'a' <= s[i + j] && s[i + j] <= 'z' ||
-                     'A' <= s[i + j] && s[i + j] <= 'Z' || s[i + j] == '_');
-             j++)
-            ;
-        if (j) {
-            std::string tmp = s.substr(i, j), tmp2;
-
-            if (def.count(tmp) && !def[tmp].second) {
-                def[tmp].second = true;
-                r += dfs(def[tmp].first);
-                def[tmp].second = false;
-            } else {
-                r += tmp;
-            }
-        } else {
-            r += s[i++];
-        }
-    }
-
-    return r;
-}
-
-int main() {
-    cin >> n;
-    for (int i = 0; i <= n; i++) {
-        std::getline(cin, s[i]);
-    }
-
-    for (int i = 1; i <= n; i++) {
-        if (s[i][0] == '#') {
-            if (s[i].substr(1, 6) == "define") {
-                int p = s[i].find_first_of(' ', 8);
-                std::string name = s[i].substr(8, p - 8),
-                            content = s[i].substr(p + 1);
-                def[name] = std::make_pair(content, false);
-            } else {  // s[i].substr(1, 6) == "undef"
-                std::string name = s[i].substr(7);
-                def.erase(name);
-            }
-            cout << endl;
-        } else {
-            cout << dfs(s[i]) << endl;
-        }
-    }
-
-    return 0;
-}