kuet contest's file added

Author: MishkatIT

others/Replay of Ostad Presents Intra KUET Programming Contest 2023/.vscode/c_cpp_properties.json

@@ -0,0 +1,18 @@
+{
+  "configurations": [
+    {
+      "name": "windows-gcc-x86",
+      "includePath": [
+        "${workspaceFolder}/**"
+      ],
+      "compilerPath": "C:/MinGW/bin/gcc.exe",
+      "cStandard": "${default}",
+      "cppStandard": "${default}",
+      "intelliSenseMode": "windows-gcc-x86",
+      "compilerArgs": [
+        ""
+      ]
+    }
+  ],
+  "version": 4
+}

others/Replay of Ostad Presents Intra KUET Programming Contest 2023/.vscode/launch.json

@@ -0,0 +1,24 @@
+{
+  "version": "0.2.0",
+  "configurations": [
+    {
+      "name": "C/C++ Runner: Debug Session",
+      "type": "cppdbg",
+      "request": "launch",
+      "args": [],
+      "stopAtEntry": false,
+      "externalConsole": true,
+      "cwd": "d:/codeforces-atcoder-submissions/others/Replay of Ostad Presents Intra KUET Programming Contest 2023",
+      "program": "d:/codeforces-atcoder-submissions/others/Replay of Ostad Presents Intra KUET Programming Contest 2023/build/Debug/outDebug",
+      "MIMode": "gdb",
+      "miDebuggerPath": "gdb",
+      "setupCommands": [
+        {
+          "description": "Enable pretty-printing for gdb",
+          "text": "-enable-pretty-printing",
+          "ignoreFailures": true
+        }
+      ]
+    }
+  ]
+}

others/Replay of Ostad Presents Intra KUET Programming Contest 2023/.vscode/settings.json

@@ -0,0 +1,59 @@
+{
+  "C_Cpp_Runner.cCompilerPath": "gcc",
+  "C_Cpp_Runner.cppCompilerPath": "g++",
+  "C_Cpp_Runner.debuggerPath": "gdb",
+  "C_Cpp_Runner.cStandard": "",
+  "C_Cpp_Runner.cppStandard": "",
+  "C_Cpp_Runner.msvcBatchPath": "",
+  "C_Cpp_Runner.useMsvc": false,
+  "C_Cpp_Runner.warnings": [
+    "-Wall",
+    "-Wextra",
+    "-Wpedantic",
+    "-Wshadow",
+    "-Wformat=2",
+    "-Wcast-align",
+    "-Wconversion",
+    "-Wsign-conversion",
+    "-Wnull-dereference"
+  ],
+  "C_Cpp_Runner.msvcWarnings": [
+    "/W4",
+    "/permissive-",
+    "/w14242",
+    "/w14287",
+    "/w14296",
+    "/w14311",
+    "/w14826",
+    "/w44062",
+    "/w44242",
+    "/w14905",
+    "/w14906",
+    "/w14263",
+    "/w44265",
+    "/w14928"
+  ],
+  "C_Cpp_Runner.enableWarnings": true,
+  "C_Cpp_Runner.warningsAsError": false,
+  "C_Cpp_Runner.compilerArgs": [],
+  "C_Cpp_Runner.linkerArgs": [],
+  "C_Cpp_Runner.includePaths": [],
+  "C_Cpp_Runner.includeSearch": [
+    "*",
+    "**/*"
+  ],
+  "C_Cpp_Runner.excludeSearch": [
+    "**/build",
+    "**/build/**",
+    "**/.*",
+    "**/.*/**",
+    "**/.vscode",
+    "**/.vscode/**"
+  ],
+  "C_Cpp_Runner.useAddressSanitizer": false,
+  "C_Cpp_Runner.useUndefinedSanitizer": false,
+  "C_Cpp_Runner.useLeakSanitizer": false,
+  "C_Cpp_Runner.showCompilationTime": false,
+  "C_Cpp_Runner.useLinkTimeOptimization": false,
+  "C_Cpp_Runner.msvcSecureNoWarnings": false
+}

others/Replay of Ostad Presents Intra KUET Programming Contest 2023/B. Digit occurrence Sum.cpp

@@ -0,0 +1,80 @@
+/*
+    author    : MishkatIT
+    created   : Tuesday 2023-10-10-20.54.15
+*/
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+#define fio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
+#define debug(_) cout << #_ << " is " << _ << '\n';
+using namespace std;
+using namespace __gnu_pbds;
+using ll        = long long;
+using ld        = long double;
+const ll mod    = 1e9 + 7;
+const ll N      = 1e5 + 10;
+const ll inf    = 1e9;
+const ll linf   = 1e18;
+
+typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
+
+int main()
+{
+    fio;
+    int n, q;
+    cin >> n >> q;
+    ordered_set s;
+    vector<int> freq(11);
+    auto add = [&] (int x) {
+        while (x) {
+            freq[x % 10]++;
+            x /= 10;
+        }
+    };
+    auto rem = [&] (int x) {
+        while (x) {
+            freq[x % 10]--;
+            x /= 10;
+        }
+    };
+    for (int i = 0; i < n; i++) {
+        int x;
+        cin >> x;
+        s.insert(x);
+        add(x);
+    }
+    while (q--) {
+        char c;
+        int x;
+        cin >> c >> x;
+        if (c == '+') {
+            if (s.find(x) == s.end()) {
+                s.insert(x);
+                add(x);
+            } else {
+                s.erase(x);
+                rem(x);
+            }
+        } else if (c == '-') {
+            if (s.size() >= x) {
+                int val = *s.find_by_order(s.size() - x);
+                rem(val);
+                s.erase(val);
+            }
+        } else {
+            if (s.find(x) != s.end()) {
+                int sum = 0;
+                while (x) {
+                    sum += (freq[x % 10]);
+                    x /= 10;
+                }
+                cout << sum << '\n';
+            } else {
+                cout << -1 << '\n';
+            }
+        }
+    }
+
+    return 0;
+}

others/Replay of Ostad Presents Intra KUET Programming Contest 2023/G. Not So Easy.cpp

@@ -0,0 +1,21 @@
+/*
+    author    : MishkatIT
+    created   : Tuesday 2023-10-10-19.00.07
+*/
+#include<bits/stdc++.h>
+#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
+#define debug(_) cout << #_ << " is " << _ << '\n';
+using namespace std;
+using ll        = long long;
+using ld        = long double;
+const ll mod    = 1e9 + 7;
+const ll N      = 1e5 + 10;
+const ll inf    = 1e9;
+const ll linf   = 1e18;
+
+int main()
+{
+    fio;
+    cout << "KUET WOOD";
+    return 0;
+}

others/Replay of Ostad Presents Intra KUET Programming Contest 2023/L. Not-Incomplete.cpp

@@ -0,0 +1,39 @@
+/*
+    author    : MishkatIT
+    created   : Tuesday 2023-10-10-19.55.12
+*/
+#include<bits/stdc++.h>
+#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
+#define debug(_) cout << #_ << " is " << _ << '\n';
+using namespace std;
+using ll        = long long;
+using ld        = long double;
+const ll mod    = 1e9 + 7;
+const ll N      = 1e5 + 10;
+const ll inf    = 1e9;
+const ll linf   = 1e18;
+
+int main()
+{
+    fio;
+    ld x, y, z, n;
+    cin >> x >> y >> z >> n;
+    ld att = ceil(x * y * 6.0 / 10.0);
+    ld rem = (x - z) * y;
+    if(att - n - rem > 0) {
+        cout << "No" << '\n';
+    } else {
+        cout << "Yes" << '\n';
+        ld todo = att - n;
+        vector<int> v(x - z);
+        for (int i = 0; i < (x - z); i++) {
+            v[i] = max((ld)0, min(y, todo));
+            todo -= y;
+        }
+        sort(v.begin(), v.end());
+        for (int i = 0; i < v.size(); i++) {
+          cout << v[i] << " \n"[i == v.size() - 1];
+        }
+    }
+    return 0;
+}

others/Replay of Ostad Presents Intra KUET Programming Contest 2023/M. Banana Monitor.cpp

@@ -0,0 +1,49 @@
+/*
+    author    : MishkatIT
+    created   : Tuesday 2023-10-10-22.35.45
+*/
+#include<bits/stdc++.h>
+#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
+#define debug(_) cout << #_ << " is " << _ << '\n';
+using namespace std;
+using ll        = long long;
+using ld        = long double;
+const ll mod    = 1e9 + 7;
+const ll N      = 1e5 + 10;
+const ll inf    = 1e9;
+const ll linf   = 1e18;
+
+int main()
+{
+    fio;
+    int t;
+    cin >> t;
+    while(t--) {
+        int n, mx, a, c;
+        cin >> n >> mx >> a >> c;
+
+        vector<int> v(n);
+        for (auto& i : v) {
+            cin >> i;
+        }
+        int ans = 0;
+        int dec = c, inc = 0;
+        for (int i = 0; i < n; i++) {
+
+            if(v[i] <= mx) {
+                dec++;
+                if(dec >= c) inc = 0;
+                if(inc < a) inc = 0;
+            } else {
+                dec = 0;
+                inc++;
+            }
+            if(inc >= a) {
+                ans++;
+            }
+
+        }
+        cout << ans << '\n';
+    }
+    return 0;
+}