add: eth icpc and arc178

Author: Khanh Vu

.clang-format

@@ -0,0 +1,3 @@
+BasedOnStyle: Google
+IndentWidth: 4
+ColumnLimit: 120

.cph/.main.cpp_7693db1a211bf26f86735ba1bc5743c0.prob

@@ -1 +1 @@
-{"name":"Local: main","url":"/Users/kvu/github/competitiveprogramming/main.cpp","tests":[{"id":1712947544040,"input":"0","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/kvu/github/competitiveprogramming/main.cpp","group":"local","local":true}
+{"name":"Local: main","url":"/Users/kvu/github/competitiveprogramming/main.cpp","tests":[{"id":1716127682860,"input":"5 2\n2 4","output":"1 3 2 5 4"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/kvu/github/competitiveprogramming/main.cpp","group":"local","local":true}

.gitignore

@@ -1,2 +1,3 @@
-.DS_Store
+**/.DS_Store
+**/.cph
 main

.vscode/settings.json

@@ -0,0 +1,5 @@
+{
+    "files.associations": {
+        "vector": "cpp"
+    }
+}

atcoder/arc178/b.bin

@@ -0,0 +1,168 @@
+#include <bits/stdc++.h>
+
+#include <ranges>
+using namespace std;
+
+#ifdef LOCAL
+#include "../../debug.h"
+#else
+#define debug(...) 42
+#endif
+
+namespace utils {
+template <typename T, typename... Args>
+void setValues(const T& value, T& first, Args&... args) {
+    first = value;
+    if constexpr (sizeof...(args) > 0) {
+        setValues(value, args...);
+    }
+}
+
+template <typename T>
+void setMax(T& target, const T& value) {
+    if (value > target) {
+        target = value;
+    }
+}
+
+template <typename T>
+void setMin(T& target, const T& value) {
+    if (value < target) {
+        target = value;
+    }
+}
+}  // namespace utils
+using namespace utils;
+
+using ll = long long;
+using ld = long double;
+const char el = '\n';
+const bool is_multitest = true;
+
+template <int MOD_> struct modnum {
+	static constexpr int MOD = MOD_;
+	static_assert(MOD_ > 0, "MOD must be positive");
+ 
+private:
+	using ll = int64_t;
+ 
+	int v;
+ 
+	static int minv(int a, int m) {
+		a %= m;
+		assert(a);
+		return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a);
+	}
+ 
+public:
+ 
+	modnum() : v(0) {}
+	modnum(ll v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; }
+	explicit operator int() const { return v; }
+	friend std::ostream& operator << (std::ostream& out, const modnum& n) { return out << int(n); }
+	friend std::istream& operator >> (std::istream& in, modnum& n) { ll v_; in >> v_; n = modnum(v_); return in; }
+ 
+	friend bool operator == (const modnum& a, const modnum& b) { return a.v == b.v; }
+	friend bool operator != (const modnum& a, const modnum& b) { return a.v != b.v; }
+ 
+	modnum inv() const {
+		modnum res;
+		res.v = minv(v, MOD);
+		return res;
+	}
+	friend modnum inv(const modnum& m) { return m.inv(); }
+	modnum neg() const {
+		modnum res;
+		res.v = v ? MOD-v : 0;
+		return res;
+	}
+	friend modnum neg(const modnum& m) { return m.neg(); }
+ 
+	modnum operator- () const {
+		return neg();
+	}
+	modnum operator+ () const {
+		return modnum(*this);
+	}
+ 
+	modnum& operator ++ () {
+		v ++;
+		if (v == MOD) v = 0;
+		return *this;
+	}
+	modnum& operator -- () {
+		if (v == 0) v = MOD;
+		v --;
+		return *this;
+	}
+	modnum& operator += (const modnum& o) {
+		v += o.v;
+		if (v >= MOD) v -= MOD;
+		return *this;
+	}
+	modnum& operator -= (const modnum& o) {
+		v -= o.v;
+		if (v < 0) v += MOD;
+		return *this;
+	}
+	modnum& operator *= (const modnum& o) {
+		v = int(ll(v) * ll(o.v) % MOD);
+		return *this;
+	}
+	modnum& operator /= (const modnum& o) {
+		return *this *= o.inv();
+	}
+ 
+	friend modnum operator ++ (modnum& a, int) { modnum r = a; ++a; return r; }
+	friend modnum operator -- (modnum& a, int) { modnum r = a; --a; return r; }
+	friend modnum operator + (const modnum& a, const modnum& b) { return modnum(a) += b; }
+	friend modnum operator - (const modnum& a, const modnum& b) { return modnum(a) -= b; }
+	friend modnum operator * (const modnum& a, const modnum& b) { return modnum(a) *= b; }
+	friend modnum operator / (const modnum& a, const modnum& b) { return modnum(a) /= b; }
+};
+ 
+template <typename T> T pow(T a, long long b) {
+	assert(b >= 0);
+	T r = 1; while (b) { if (b & 1) r *= a; b >>= 1; a *= a; } return r;
+}
+
+using num = modnum<998244353>;
+
+
+void solve() {
+    ll a1, a2, a3;
+    cin >> a1 >> a2 >> a3;
+    if (a1 > a2) swap(a1, a2);
+    if (a3 < a2 || a3 > a2 + 1) {
+        cout << 0 << el;
+        return;
+    }
+
+    // Assume that a2 == a3
+    num res;
+    if (a1 == a2) {
+        num x = pow(num(10), a1) - num(2) * pow(num(10), a1 - 1) + num(1);
+        res = x * (x - num(1)) / num(2);
+    }
+    else if (a1 < a2) {
+        num x = pow(num(10), a2) - num(1) - pow(num(10), a1 - 1) - pow(num(10), a2 - 1) + num(1);
+        num y = pow(num(10), a2) - pow(num(10), a1) - pow(num(10), a2 - 1) + num(1);
+        res = (x + y) * (x - y + num(1)) / num(2);
+    }
+
+    // if a2 < a3, we take the complement 
+    if (a2 < a3) {
+        res = num(81) * pow(num(10), a1 + a2 - 2) - res;
+    }
+
+    cout << res << el;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0);
+    int t = 1;
+    if (is_multitest) cin >> t;
+    while (t--) solve();
+    return 0;
+}

atcoder/arc178/b.cpp

@@ -0,0 +1,30 @@
+MOD = 998244353
+
+# return 10 ^ a
+def powten(a):
+    return pow(10, a, MOD)
+
+def solve(a1, a2, a3):
+    # a1 <= a2
+    if a1 > a2:
+        a1, a2 = a2, a1
+    # impossible
+    if a2 != a3 and a2 + 1 != a3:
+        return 0
+    # a2 == a3
+    if a2 != a3:
+        return (81 * powten(a1 + a2 - 2) - solve(a1, a2, a2)) % MOD
+    # calc
+    if a1 == a2:
+        return 4 * powten(a1 - 1) * (8 * powten(a1 - 1) + 1) % MOD
+    else:
+        ans = (9 * powten(a2 - 1) - (11 * powten(a1 - 1) - 1) * pow(2, -1, MOD)) % MOD
+        ans = ans * 9 * powten(a1 - 1) % MOD
+        return ans
+    
+
+# I/O
+T = int(input())
+for _ in range(T):
+    a1, a2, a3 = map(int, input().split())
+    print(solve(a1, a2, a3))

atcoder/arc178/b_sol.py

@@ -0,0 +1,87 @@
+template <typename A, typename B>
+string to_string(pair<A, B> p);
+
+template <typename A, typename B, typename C>
+string to_string(tuple<A, B, C> p);
+
+template <typename A, typename B, typename C, typename D>
+string to_string(tuple<A, B, C, D> p);
+
+string to_string(const string& s) {
+  return '"' + s + '"';
+}
+
+string to_string(const char* s) {
+  return to_string((string) s);
+}
+
+string to_string(bool b) {
+  return (b ? "true" : "false");
+}
+
+string to_string(vector<bool> v) {
+  bool first = true;
+  string res = "{";
+  for (int i = 0; i < static_cast<int>(v.size()); i++) {
+    if (!first) {
+      res += ", ";
+    }
+    first = false;
+    res += to_string(v[i]);
+  }
+  res += "}";
+  return res;
+}
+
+template <size_t N>
+string to_string(bitset<N> v) {
+  string res = "";
+  for (size_t i = 0; i < N; i++) {
+    res += static_cast<char>('0' + v[i]);
+  }
+  return res;
+}
+
+template <typename A>
+string to_string(A v) {
+  bool first = true;
+  string res = "{";
+  for (const auto &x : v) {
+    if (!first) {
+      res += ", ";
+    }
+    first = false;
+    res += to_string(x);
+  }
+  res += "}";
+  return res;
+}
+
+template <typename A, typename B>
+string to_string(pair<A, B> p) {
+  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
+}
+
+template <typename A, typename B, typename C>
+string to_string(tuple<A, B, C> p) {
+  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
+}
+
+template <typename A, typename B, typename C, typename D>
+string to_string(tuple<A, B, C, D> p) {
+  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
+}
+
+void debug_out() { cerr << endl; }
+
+template <typename Head, typename... Tail>
+void debug_out(Head H, Tail... T) {
+  cerr << " " << to_string(H);
+  debug_out(T...);
+}
+
+#ifdef LOCAL
+#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
+#else
+#define debug(...) 42
+#endif