2601.cpp (1390B)
1 class Solution { 2 static constexpr const std::array<int, 168> primes = { 3 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 4 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 5 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 6 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 7 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 8 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 9 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 10 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 11 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997}; 12 13 public: 14 bool primeSubOperation(vector<int> &nums) const { 15 for (int i = size(nums) - 2; i >= 0; i--) { 16 if (nums[i + 1] > nums[i]) continue; 17 18 const auto it = upper_bound(begin(primes), end(primes), nums[i] - nums[i + 1]); 19 if (it == end(primes)) return false; 20 if ((nums[i] -= *it) <= 0) return false; 21 } 22 23 return true; 24 } 25 };