《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;

}

相关推荐
qqxhb1 小时前
零基础数据结构与算法——第四章:基础算法-排序(上)
java·数据结构·算法·冒泡·插入·选择
FirstFrost --sy3 小时前
数据结构之二叉树
c语言·数据结构·c++·算法·链表·深度优先·广度优先
森焱森3 小时前
垂起固定翼无人机介绍
c语言·单片机·算法·架构·无人机
搂鱼1145143 小时前
(倍增)洛谷 P1613 跑路/P4155 国旗计划
算法
Yingye Zhu(HPXXZYY)3 小时前
Codeforces 2021 C Those Who Are With Us
数据结构·c++·算法
无聊的小坏坏4 小时前
三种方法详解最长回文子串问题
c++·算法·回文串
长路 ㅤ   5 小时前
Java后端技术博客汇总文档
分布式·算法·技术分享·编程学习·java后端
秋说5 小时前
【PTA数据结构 | C语言版】两枚硬币
c语言·数据结构·算法
qq_513970445 小时前
力扣 hot100 Day37
算法·leetcode
不見星空5 小时前
leetcode 每日一题 1865. 找出和为指定值的下标对
算法·leetcode