可以试试((
by Dimly_dust @ 2020-07-10 14:25:29
可以和UVA的丑数那道题结合起来看@[shimao](/user/312121)
by WanderingTrader @ 2020-07-10 14:46:48
<https://www.luogu.com.cn/problem/UVA136>
by WanderingTrader @ 2020-07-10 14:47:18
```
#include<bits/stdc++.h>
#include<queue>
using namespace std;
vector<int> v;
void bfs(int n)
{
queue<int> q;
q.push(1);
v.push_back(1);
while(!q.empty()){
int seed=q.front();q.pop();
n--;
q.push(seed*2);
v.push_back(seed*2);
q.push(seed*3);
v.push_back(seed*3);
q.push(seed*5);
v.push_back(seed*5);
q.push(seed*7);
v.push_back(seed*7);
if(n==0)return;
}
}
int main()
{
bfs(10000);
sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());
int n;
std::cin>>n;
cout<<v[n-1];
return 0;
}
```
结果：
[我的记录](https://www.luogu.com.cn/record/35008688)
咋回事
by shimao @ 2020-07-10 15:00:54
@[shimao](/user/312121) 你这个东西虽然搜了10000个数，但是有很多重复的，去重之后实际上不到10000个
by _5011_ @ 2020-07-10 15:03:09
因为有重复的，建议用set
by __Chtholly @ 2020-10-04 17:26:47