Done Codeforces Round#629 div3

Author: zh-plus

CMakeLists.txt

@@ -31,10 +31,9 @@ add_executable(hard LeetCode/hard/76_MinimumWindowSubstring.cpp)
 
 add_executable(random_test test/cin_test.cpp)
 
-add_executable(A Codeforces/Round627_div3/A.cpp)
-add_executable(solving Codeforces/Round627_div3/solving.cpp)
-
 add_executable(interviews Interviews/ShunFeng/NumOfStudyMachine.cpp)
 
 add_subdirectory(study)
-add_subdirectory(template)
+add_subdirectory(template)
+add_subdirectory(KickStart)
+add_subdirectory(Codeforces)

Codeforces/CMakeLists.txt

@@ -0,0 +1,6 @@
+set(FOLDER_NAME Round629_div3)
+
+add_executable(A ${FOLDER_NAME}/A.cpp)
+add_executable(B ${FOLDER_NAME}/B.cpp)
+add_executable(C ${FOLDER_NAME}/C.cpp)
+add_executable(solving ${FOLDER_NAME}/solving.cpp)

Codeforces/Round629_div3/A.cpp

@@ -0,0 +1,48 @@
+//
+// Created by 10578 on 3/12/2020.
+//
+
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <algorithm>
+
+#define BOOST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
+#define ALTER_IN(name) fstream _in(name); cin.rdbuf(_in.rdbuf());
+//#define LOCAL
+
+using namespace std;
+
+int solve(int a, int b) {
+    if (a < b) {
+        return b - a;
+    }
+
+    int temp = b;
+    while (a > temp) {
+        temp += b;
+    }
+
+    return temp - a;
+}
+
+
+int main() {
+    BOOST_IO;
+
+#ifdef LOCAL
+    ALTER_IN("../in.txt");
+#endif
+
+    int T;
+    cin >> T;
+    int a, b;
+    while (T--) {
+        cin >> a >> b;
+
+        cout << solve(a, b) << endl;
+    }
+
+    return 0;
+}

Codeforces/Round629_div3/B.cpp

@@ -0,0 +1,87 @@
+//
+// Created by 10578 on 3/12/2020.
+//
+
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <algorithm>
+#include <set>
+#include <cmath>
+
+#define BOOST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
+#define ALTER_IN(name) fstream _in(name); cin.rdbuf(_in.rdbuf());
+//#define LOCAL
+
+
+using namespace std;
+using ll = long long;
+
+double newton(int n, int k) {
+    double x0 = 0;
+    double y0 = pow(x0, 2) - x0 - 2 * k;
+    double dx;
+    double b;
+
+    for (int i = 0; i < 100; ++i) {
+        dx = 2 * k - 1;
+        b = y0 - dx * x0;
+        x0 = -b / dx;
+        y0 = pow(x0, 2) - x0 - 2 * k;
+    }
+
+    ll temp;
+    if (temp = floor(x0);  pow(temp, 2) - temp - 2 * k == 0) {
+        x0 = temp;
+    } else if (temp = ceil(x0);  pow(temp, 2) - temp - 2 * k == 0) {
+        x0 = temp;
+    }
+
+    return x0;
+}
+
+string solve(int n, int k) {
+    double root = newton(n, k);
+    ll first = floor(root);
+
+    ll pre = 0;
+    if (first % 2 == 0) {
+        pre = first / 2;
+        pre *= (first - 1);
+    } else {
+        pre = (first - 1) / 2;
+        pre *= first;
+    }
+
+    if (root > first) {
+        first++;
+    }
+
+    ll second = (k - pre) == 0 ? first - 1 : k - pre;
+    string result(n, 'a');
+    result[n - first] = 'b';
+    result[n - second] = 'b';
+
+    return result;
+}
+
+
+int main() {
+    BOOST_IO;
+
+#ifdef LOCAL
+    ALTER_IN("../in.txt");
+#endif
+
+    int T = 0;
+    cin >> T;
+    int n, k;
+    while (T--) {
+        cin >> n >> k;
+
+        cout << solve(n, k) << endl;
+    }
+
+    return 0;
+}

Codeforces/Round629_div3/C.cpp

@@ -0,0 +1,73 @@
+//
+// Created by 10578 on 3/12/2020.
+//
+
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <algorithm>
+#include <set>
+
+#define BOOST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
+#define ALTER_IN(name) fstream _in(name); cin.rdbuf(_in.rdbuf());
+//#define LOCAL
+
+using namespace std;
+
+pair<string, string> solve(int n, string &s) {
+    string first(s.size(), ' ');
+    string second(s.size(), ' ');
+
+    bool find_1 = false;
+    for (int i = 0; i < s.size(); ++i) {
+        if (s[i] == '0') {
+            first[i] = '0';
+            second[i] = '0';
+        }
+
+        if (!find_1) {
+            if (s[i] == '2') {
+                first[i] = '1';
+                second[i] = '1';
+            } else if (s[i] == '1') {
+                first[i] = '1';
+                second[i] = '0';
+                find_1 = true;
+            }
+        } else {
+            if (s[i] == '2') {
+                first[i] = '0';
+                second[i] = '2';
+            } else if (s[i] == '1') {
+                first[i] = '0';
+                second[i] = '1';
+            }
+        }
+    }
+
+    return make_pair(first, second);
+}
+
+
+int main() {
+    BOOST_IO;
+
+#ifdef LOCAL
+    ALTER_IN("../in.txt");
+#endif
+
+    int T = 0;
+    cin >> T;
+    int n;
+    string s{};
+    while (T--) {
+        cin >> n;
+        cin >> s;
+        auto result = solve(n, s);
+        cout << result.first << endl
+             << result.second << endl;
+    }
+
+    return 0;
+}

Codeforces/Round629_div3/D.cpp

@@ -0,0 +1,58 @@
+//
+// Created by 10578 on 3/12/2020.
+//
+
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <algorithm>
+
+#define BOOST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
+#define ALTER_IN(name) fstream _in(name); cin.rdbuf(_in.rdbuf());
+#define LOCAL
+
+using namespace std;
+
+int solve(vector<int> &A, vector<int> &B) {
+    for (int i = 0; i < B.size(); ++i) {
+        A[i] -= B[i];
+    }
+
+    int count = 0;
+    int sz = A.size();
+    for (int i = 0; i < sz; ++i) {
+        for (int j = i + 1; j < sz; ++j) {
+            if (A[i] + A[j] > 0) {
+                ++count;
+            }
+        }
+    }
+
+    return count;
+}
+
+
+int main() {
+    BOOST_IO;
+
+#ifdef LOCAL
+    ALTER_IN("../in.txt");
+#endif
+
+    int n = 0;
+    cin >> n;
+    vector<int> A(n);
+    vector<int> B(n);
+
+    for (int i = 0; i < n; ++i) {
+        cin >> A[i];
+    }
+
+    for (int i = 0; i < n; ++i) {
+        cin >> B[i];
+    }
+
+    cout << solve(A, B) << endl;
+
+    return 0;
+}

Codeforces/Round629_div3/solving.cpp

@@ -0,0 +1,58 @@
+//
+// Created by 10578 on 3/12/2020.
+//
+
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <algorithm>
+
+#define BOOST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
+#define ALTER_IN(name) fstream _in(name); cin.rdbuf(_in.rdbuf());
+#define LOCAL
+
+using namespace std;
+
+int solve(vector<int> &A, vector<int> &B) {
+    for (int i = 0; i < B.size(); ++i) {
+        A[i] -= B[i];
+    }
+
+    int count = 0;
+    int sz = A.size();
+    for (int i = 0; i < sz; ++i) {
+        for (int j = i + 1; j < sz; ++j) {
+            if (A[i] + A[j] > 0) {
+                ++count;
+            }
+        }
+    }
+
+    return count;
+}
+
+
+int main() {
+    BOOST_IO;
+
+#ifdef LOCAL
+    ALTER_IN("../in.txt");
+#endif
+
+    int n = 0;
+    cin >> n;
+    vector<int> A(n);
+    vector<int> B(n);
+
+    for (int i = 0; i < n; ++i) {
+        cin >> A[i];
+    }
+
+    for (int i = 0; i < n; ++i) {
+        cin >> B[i];
+    }
+
+    cout << solve(A, B) << endl;
+
+    return 0;
+}

in.txt

@@ -1,7 +1,6 @@
-3
-4 100
-20 90 40 90
-4 50
-30 30 10 10
-3 300
-999 999 999
+5
+10 4
+13 9
+100 13
+123 456
+92 46