「蓝桥」1102 第 21 场小白/强者赛

Author: gdut-yy

lanqiao/src/main/java/lq241102/LQ241102T1.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int decimalNum = 20241111;
+
+ string binaryStr;
+ while (decimalNum > 0) {
+ binaryStr += (decimalNum % 2) ? '1' : '0';
+ decimalNum /= 2;
+ }
+ std::reverse(binaryStr.begin(), binaryStr.end());
+
+ cout << (binaryStr.empty() ? 0 : binaryStr) << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+// cin >> t;
+ while (t--) solve();
+ return 0;
+}
+/*
+动态密码【算法赛】
+ */

lanqiao/src/main/java/lq241102/LQ241102T2.cpp

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int n;
+ cin >> n;
+
+ vector<int> a(n);
+ for (int i = 0; i < n; ++i) {
+ cin >> a[i];
+ }
+
+ int s = 0;
+ for (const auto &v: a) {
+ s ^= v;
+ }
+ cout << (s == 0 ? "YES" : "NO") << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+// cin >> t;
+ while (t--) {
+ solve();
+ }
+ return 0;
+}
+/*
+购物车里的宝贝【算法赛】
+ */

lanqiao/src/main/java/lq241102/LQ241102T3.cpp

@@ -0,0 +1,47 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ ll n, m;
+ cin >> n >> m;
+
+ ll ans = 10 * n;
+ int L = to_string(n).length();
+
+ for (int i = 1; i < 10; ++i) {
+ ll s = n + i * pow(10, L);
+ if (s % m == 0 && s < ans) {
+ ans = s;
+ }
+ }
+
+ for (int i = 0; i < 10; ++i) {
+ for (int j = 1; j < L; ++j) {
+ ll s1 = n / pow(10, j);
+ ll s2 = n % (ll) pow(10, j);
+ ll s = s1 * pow(10, j + 1) + i * pow(10, j) + s2;
+ if (s % m == 0 && s < ans) {
+ ans = s;
+ }
+ }
+ }
+
+ cout << ans << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+ cin >> t;
+ while (t--) {
+ solve();
+ }
+ return 0;
+}
+/*
+代金券【算法赛】
+ */

lanqiao/src/main/java/lq241102/LQ241102T4.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int n;
+ cin >> n;
+
+ vector<int> a(n);
+ for (int i = 0; i < n; ++i) {
+ cin >> a[i];
+ }
+
+ std::sort(a.begin(), a.end());
+ ll ans = std::accumulate(a.begin(), a.end(), 0LL);
+
+ if (a[n - 1] > (ans + 1) / 2) {
+ ll tg = a[n - 1] - (ans - a[n - 1]);
+ ans += tg - 1;
+ }
+ cout << ans << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+// cin >> t;
+ while (t--) {
+ solve();
+ }
+ return 0;
+}
+/*
+蓝桥商场【算法赛】
+ */

lanqiao/src/main/java/lq241102/LQ241102T5.cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int n, m;
+ cin >> n >> m;
+
+ vector<int> l(n), r(n);
+ for (int i = 0; i < n; ++i) {
+ cin >> l[i] >> r[i];
+ }
+
+ auto st = l, ed = r;
+ std::sort(st.begin(), st.end());
+ std::sort(ed.begin(), ed.end());
+
+ for (int i = 0; i < n; ++i) {
+ int x = n - (std::upper_bound(st.begin(), st.end(), r[i]) - st.begin());
+ int y = std::lower_bound(ed.begin(), ed.end(), l[i]) - ed.begin();
+ cout << (n - 1 - x - y) << endl;
+ }
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+// cin >> t;
+ while (t--) {
+ solve();
+ }
+ return 0;
+}
+/*
+蓝桥派对【算法赛】
+ */

lanqiao/src/main/java/lq241102/LQ241102T6.cpp

@@ -0,0 +1,42 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+const int mod = 1e9 + 7;
+
+ll ksm(ll x, ll k, ll mo = mod) {
+ ll ans = 1;
+ while (k) {
+ if (k & 1) ans = ans * x % mo;
+ x = x * x % mo;
+ k >>= 1;
+ }
+ return ans;
+}
+
+void solve() {
+ int l, r;
+ cin >> l >> r;
+
+ ll ans = 0;
+ for (int i = l + 1; i <= r; ++i) {
+ ans += ksm(i - 1, i - 1) * ksm(i, i) % mod;
+ ans %= mod;
+ }
+ cout << ans << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+// cin >> t;
+ while (t--) {
+ solve();
+ }
+ return 0;
+}
+/*
+薅羊毛【算法赛】
+ */

lanqiao/src/main/java/lq241102/LQ241102T7.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+const int mod = 1e9 + 7;
+
+ll ksm(ll x, ll k, ll mo = mod) {
+ ll ans = 1;
+ while (k) {
+ if (k & 1) ans = ans * x % mo;
+ x = x * x % mo;
+ k >>= 1;
+ }
+ return ans;
+}
+
+const int N = 2e5 + 7;
+ll inv2;
+ll p[N];
+
+void solve() {
+ ll n;
+ cin >> n;
+
+ ll ans = (ksm(2, n) - 2 + mod) % mod * inv2 % mod * p[n] % mod * 360 % mod;
+ cout << ans << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ inv2 = ksm(2, mod - 2);
+ p[1] = 1;
+ for (int i = 1; i <= 2e5; ++i) {
+ p[i] = p[i - 1] * 10 + 1;
+ p[i] %= mod;
+ }
+
+ int t = 1;
+ cin >> t;
+ while (t--) {
+ solve();
+ }
+ return 0;
+}
+/*
+中奖编号【算法赛】
+ */

lanqiao/src/main/java/lq241102/LQ241102T8.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+const int mod = 1e9 + 7;
+const int N = 1e5 + 7;
+
+int vis[N];
+
+void solve() {
+ int n;
+ cin >> n;
+
+ ll ans = 1;
+ for (int i = 2; i <= n; ++i) {
+ if (!vis[i]) {
+ int cnt = 0;
+ for (int j = i; j <= n; j *= i) {
+ cnt += n / j;
+ }
+ ans *= cnt + 1;
+ ans %= mod;
+ }
+ }
+ cout << ans << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ for (ll i = 2; i <= 1e5; ++i) {
+ if (!vis[i]) {
+ for (ll j = i * i; j <= 1e5; j += i) {
+ vis[j] = 1;
+ }
+ }
+ }
+
+ int t = 1;
+// cin >> t;
+ while (t--) {
+ solve();
+ }
+ return 0;
+}
+/*
+凑单返现【算法赛】
+ */