y

ksh-code · ksh-code · commit c085959f0739 · 2022-05-07T20:14:15.000+09:00
diff --git a/atcoder/a b/atcoder/a
diff --git a/atcoder/abc248_a.cpp b/atcoder/abc248_a.cpp
@@ -3,6 +3,17 @@ using namespace std;
 typedef long long ll;
 
 void solve(){
+    string str;
+    cin >> str;
+    set<char> s;
+    for (auto c : str) {
+        s.insert(c);
+    }
+    for (char i = '0'; i <= '9'; i++) {
+        if (!s.count(i)) {
+            cout << i;
+        }
+    }
 }
 
 int main()
diff --git a/atcoder/abc248_b.cpp b/atcoder/abc248_b.cpp
@@ -3,6 +3,13 @@ using namespace std;
 typedef long long ll;
 
 void solve(){
+    ll A,B,K; cin >> A >> B >>K;
+    int i = 0;
+    while (A < B) {
+        A*=K;
+        i++;
+    }
+    cout << i;
 }
 
 int main()
diff --git a/atcoder/abc248_c.cpp b/atcoder/abc248_c.cpp
@@ -2,7 +2,31 @@
 using namespace std;
 typedef long long ll;
 
+const ll MOD = 998244353;
+int M;
+
+ll dp[51][2501];
+
+ll dfs(int N, int remains) {
+    if (dp[N][remains]) return dp[N][remains];
+
+    if (N == 1) {
+        return dp[N][remains] = min(remains, M);
+    }
+
+    ll result = 0;
+    for (int i = 1; i <= M; i++) {
+        if (i >= remains) break;
+        result += dfs(N-1, remains-i);
+        result %= MOD;
+    }
+
+    return dp[N][remains] = result % MOD + MOD;
+}
+
 void solve(){
+    int N, K; cin >> N >> M >>K;
+    cout << dfs(N, K) % MOD;
 }
 
 int main()
diff --git a/atcoder/abc248_d.cpp b/atcoder/abc248_d.cpp
@@ -2,7 +2,47 @@
 using namespace std;
 typedef long long ll;
 
+const int MAX = 2e5;
+
+unordered_map<int, int> tree[MAX*4];
+
+void update(int s, int e, int node, int index, int f) {
+    if (s > index || e < index) return;
+
+    tree[node][f]++;
+    if (s == e) return;
+
+    int m = (s+e)/2;
+    update(s, m, node*2, index, f);
+    update(m+1, e, node*2+1, index, f);
+}
+
+int query(int s, int e, int node, int l, int r, int c) {
+    if (s > r || e < l) return 0;
+    if (l <= s && r >= e) {
+        if (tree[node].count(c)) return tree[node][c];
+        return 0;
+    }
+
+    int m = (s+e)/2;
+    return query(s, m, node*2, l, r, c) + query(m+1, e, node*2+1, l, r, c);
+}
+
 void solve(){
+    int N; cin >> N;
+    for (int i = 1; i <= N; i++) {
+        int a; cin >> a;
+        update(1, N, 1, i, a);
+    }
+
+    int M; cin >> M;
+    while (M--) {
+        int l, r, c;
+        cin >> l >> r >> c;
+        cout << query(1, N, 1, l, r, c);
+        cout << '\n';
+    }
+
 }
 
 int main()
diff --git a/atcoder/abc248_e.cpp b/atcoder/abc248_e.cpp
@@ -2,7 +2,53 @@
 using namespace std;
 typedef long long ll;
 
+pair<ll,ll> points[300];
+bool used[300][300];
+
+bool check(int a, int b, int c) {
+    auto [x1, y1] = points[a];
+    auto [x2, y2] = points[b];
+    auto [x3, y3] = points[c];
+
+    return (x2-x1)*(y3-y1) == (x3-x1)*(y2-y1);
+}
+
 void solve(){
+    int N, K; cin >> N >> K;
+    if (K == 1) {
+        cout << "Infinity";
+        return;
+    }
+
+    for (int i = 0; i < N; i++) {
+        cin >> points[i].first >> points[i].second;
+    }
+
+
+    int result = 0;
+    for (int i = 0; i < N; i++) {
+        for (int j = i + 1; j < N; j++) {
+            if (used[i][j]) continue;
+
+            vector<int> p;
+            p.push_back(i);
+            p.push_back(j);
+            for (int k = j + 1; k < N; k++) {
+                if (check(i,j,k)) {
+                    p.push_back(k);
+                }
+            }
+
+            for (int pi = 0; pi < p.size(); pi++) {
+                for (int pj = pi + 1; pj < p.size(); pj++) {
+                    used[p[pi]][p[pj]]=true;
+                }
+            }
+
+            if (p.size() >= K) result++;
+        }
+    }
+    cout << result;
 }
 
 int main()
