#include <iostream> #include <algorithm> #include <unordered_set> int main() { int k; long long int N; std::cin >> k; std::cin >> N; int primes[k]; for(int i = 0; i < k; i++) { std::cin >> primes[i]; } std::sort(primes, primes+k); long long int max = 1; std::unordered_set<long long int> composites; composites.insert(1); long long int divided; for (int i = 2; i <= N; i++) { for(int j = 0; j < k; j++) { divided = i/primes[j]; if (i%primes[j] == 0 && composites.find(divided) != composites.end()) { composites.insert(i); max = i; } } } std::cout << max; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 | #include <iostream> #include <algorithm> #include <unordered_set> int main() { int k; long long int N; std::cin >> k; std::cin >> N; int primes[k]; for(int i = 0; i < k; i++) { std::cin >> primes[i]; } std::sort(primes, primes+k); long long int max = 1; std::unordered_set<long long int> composites; composites.insert(1); long long int divided; for (int i = 2; i <= N; i++) { for(int j = 0; j < k; j++) { divided = i/primes[j]; if (i%primes[j] == 0 && composites.find(divided) != composites.end()) { composites.insert(i); max = i; } } } std::cout << max; return 0; } |