| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 8 MB (하단 참고) | 125 | 11 | 6 | 8.333% |
Warning: Pay attention to the unusual memory limit.
You are given $k$ prime numbers $p_1, p_2 \dots, p_k$ and an integer $N$. Your task is to find the largest integer not exceeding $N$ whose prime factorization contains only these prime numbers.
For example, if the prime numbers are 2,ドル 3, 7,ドル the set of numbers whose factorization contains only these primes is $\{1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 16, 18, 21, 24, 27, 28, 32, 36, 42, 48, 49, 54, 56, 63, 64, 72, 81, 84, 96, 98, \ldots \}$.
The first line of the input contains two integers $k, N$ ($k \ge 1,ドル 1ドル \le N \le 10^{18}$) described above. The second line contains $k$ distinct prime numbers $p_1, \dots, p_k$ (2ドル \le p_i \le 100$).
You should output a single positive integer -- the largest number not exceeding $N$ whose prime factorization contains only prime numbers $p_1, p_2, \dots, p_k$.
3 30 2 3 7
28
Camp > Petrozavodsk Programming Camp > Summer 2018 > Day 5: Warsaw U Contest, XVIII Open Cup named after E.V. Pankratiev Onsite B번
Contest > Algorithmic Engagements > PA 2017 2-1번
C++17, Java 8, C11, C99, C++98, C++11, C++14, Java 8 (OpenJDK), Java 11, C++20, Kotlin (JVM), C99 (Clang), C++98 (Clang), C++11 (Clang), C++14 (Clang), C11 (Clang), C++17 (Clang), C++20 (Clang)