commit 3cb52ff34e3dfecfce277a185b2e96c571769e7e
parent 684821dab63d29da84aaaef826d95a007076c84f
Author: Dimitrije Dobrota <mail@dimitrijedobrota.com>
Date: Mon, 11 Nov 2024 14:55:31 +0100
Daily Problem
Diffstat:
2 files changed, 26 insertions(+), 0 deletions(-)
diff --git a/Problems/2601.cpp b/Problems/2601.cpp
@@ -0,0 +1,25 @@
+class Solution {
+ static constexpr const std::array<int, 168> primes = {
+ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67,
+ 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163,
+ 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269,
+ 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383,
+ 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499,
+ 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619,
+ 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751,
+ 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881,
+ 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};
+
+ public:
+ bool primeSubOperation(vector<int> &nums) const {
+ for (int i = size(nums) - 2; i >= 0; i--) {
+ if (nums[i + 1] > nums[i]) continue;
+
+ const auto it = upper_bound(begin(primes), end(primes), nums[i] - nums[i + 1]);
+ if (it == end(primes)) return false;
+ if ((nums[i] -= *it) <= 0) return false;
+ }
+
+ return true;
+ }
+};
diff --git a/README.md b/README.md
@@ -1339,6 +1339,7 @@ reference and a base for solving problems.
| 2593 | Medium | [Find Score of an Array After Marking All Elements](Problems/2593.cpp) |
| 2596 | Medium | [Check Knight Tour Configuration](Problems/2596.cpp) |
| 2597 | Medium | [The Number of Beautiful Subsets](Problems/2597.cpp) |
+| 2601 | Medium | [Prime Subtraction Operation](Problems/2601.cpp) |
| 2606 | Medium | [Find the Substring With Maximum Cost](Problems/2606.cpp) |
| 2610 | Medium | [Convert an Array Into a 2D Array With Conditions](Problems/2610.cpp) |
| 2616 | Medium | [Minimize the Maximum Difference of Pairs](Problems/2616.cpp) |
