《CF912E Prime Gift》

题目描述

Opposite to Grisha's nice behavior, Oleg, though he has an entire year at his disposal, didn't manage to learn how to solve number theory problems in the past year. That's why instead of Ded Moroz he was visited by his teammate Andrew, who solemnly presented him with a set of n distinct prime numbers alongside with a simple task: Oleg is to find the k -th smallest integer, such that all its prime divisors are in this set.

输入格式

The first line contains a single integer n ( 1<=n<=16 ).

The next line lists n distinct prime numbers p1​,p2​,...,pn​ ( 2<=pi​<=100 ) in ascending order.

The last line gives a single integer k ( 1<=k ). It is guaranteed that the k -th smallest integer such that all its prime divisors are in this set does not exceed 1018 .

输出格式

Print a single line featuring the k -th smallest integer. It's guaranteed that the answer doesn't exceed 1018 .

隐藏翻译

题意翻译

给你 n 个互不相同的素数 p1​,p2​,⋯,pn​,它们组成一个集合 P。

请你求出第 k 小的正整数,满足:

  • 该数字的所有素因子 ∈P

1≤n≤16,2≤pi​≤100, 保证答案不超过 1018。

输入输出样例

输入 #1复制

复制代码
3
2 3 5
7

输出 #1复制

复制代码
8

输入 #2复制

复制代码
5
3 7 11 13 31
17

输出 #2复制

复制代码
93

说明/提示

The list of numbers with all prime divisors inside 2,3,5 begins as follows:

(1,2,3,4,5,6,8,...)

The seventh number in this list ( 1 -indexed) is eight.

代码实现:

#include <iostream>

#include <queue>

#include <set>

#include <vector>

using namespace std;

int main() {

int n, k;

cin >> n;

vector<long long> primes(n);

for (int i = 0; i < n; i++) {

cin >> primes[i];

}

cin >> k;

priority_queue<long long, vector<long long>, greater<long long> > pq;

set<long long> generated;

pq.push(1);

generated.insert(1);

for (int i = 0; i < k; i++) {

long long current = pq.top();

pq.pop();

if (i == k - 1) {

cout << current << endl;

return 0;

}

// 使用迭代器遍历primes

for (vector<long long>::iterator it = primes.begin(); it != primes.end(); ++it) {

long long p = *it;

long long nextNum = current * p;

if (nextNum / p == current && generated.find(nextNum) == generated.end()) {

pq.push(nextNum);

generated.insert(nextNum);

}

}

}

return 0;

}

相关推荐
十八岁讨厌编程28 分钟前
【算法训练营Day17】二叉树part7
算法
YouQian7721 小时前
(AC)Playlist
算法
算法_小学生2 小时前
决策树(Decision Tree)完整解析:原理 + 数学推导 + 剪枝 + 实战
算法·决策树·剪枝
岁忧2 小时前
(LeetCode 面试经典 150 题 ) 155. 最小栈 (栈)
java·c++·算法·leetcode·面试·go
明明如月学长3 小时前
什么你不知道 Cherry Studio 有快捷助手?
算法
Vegetable_Dragon3 小时前
数论1.01
算法
Star在努力3 小时前
15-C语言:第15天笔记
c语言·笔记·算法
我有一计3334 小时前
【算法笔记】5.LeetCode-Hot100-矩阵专项
人工智能·算法·程序员
行然梦实4 小时前
KnEA(Knee-point-driven Evolutionary Algorithm)简介
人工智能·算法·机器学习
qq_513970444 小时前
力扣 hot100 Day58
算法·leetcode