题目:彩票卡是一个常见的游戏。卡片上是带编号的原点,其中一些圆点被随机选中。编写一个lotto()函数,它接受两个参数,第一个参数是彩票卡上圆点的个数,第二个参数是随机选择圆点个数。该函数返回vector对象,其中包含(按排序后的顺序)随机选择的号码。例如,可以这样使用该函数:
vector< i n t >winners;
winners=Lotto(51,6);
这样将把一个矢量赋给winners,该矢量包含1~51中随机选定的6个数子,注意,仅仅使用rand()无法完成这项任务,因它会随机生成重复的值。
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<ctime>
std::vector<int>Lotto(int sum, int size);
std::vector<int>Lotto2(int sum, int size);
int main()
{
std::vector<int>winners;
int qujie;
int sum;
std::cout << "输入随机数区间; ";
std::cin >> qujie;
while (!std::cin)
{
std::cin.clear();
while (std::cin.get() != '\n')
continue;
std::cout << "请从新输入(输入值为(int)); ";
std::cin >> qujie;
}
std::cout << "输入随机值的数量; ";
std::cin >> sum;
while (!std::cin)
{
std::cin.clear();
while (std::cin.get() != '\n')
continue;
std::cout << "请从新输入(输入值为(int)); ";
std::cin >> sum;
}
winners = Lotto2(qujie, sum);
std::cout << "结果值为; ";
std::copy(winners.begin(), winners.end(), std::ostream_iterator<int, char>(std::cout, " "));
std::cout << std::endl;
std::cin.get();
return false;
}
std::vector<int>Lotto(int sum, int size)
{
std::vector<int>winners;
std::srand(time(0));
for (int i = 0; i < size; i++)
winners.push_back(rand() % sum);
std::sort(winners.begin(), winners.end());
auto last = std::unique(winners.begin(), winners.end());
winners.erase(last, winners.end());
while (winners.size() != size)
{
winners.push_back(rand() % sum);
std::sort(winners.begin(), winners.end());
auto last = std::unique(winners.begin(), winners.end());
winners.erase(last, winners.end());
}
return winners;
}
std::vector<int>Lotto2(int sum, int size)
{
std::set<int>rongqi;
std::vector<int>winners;
while (rongqi.size() != size)
rongqi.insert(rand() % sum);
for (auto pr = rongqi.begin(); pr != rongqi.end(); ++pr)
winners.push_back(*pr);
return winners;
}

使用了两个Lotto函数,分别是Lotto和Lotto2,他们处理的效果相同,但Lotto2处理方式胜于Lotto
Lotto
std::vector<int>Lotto(int sum, int size)
{
std::vector<int>winners;
std::srand(time(0));
for (int i = 0; i < size; i++)
winners.push_back(rand() % sum);
std::sort(winners.begin(), winners.end());
auto last = std::unique(winners.begin(), winners.end());
winners.erase(last, winners.end());
while (winners.size() != size)
{
winners.push_back(rand() % sum);
std::sort(winners.begin(), winners.end());
auto last = std::unique(winners.begin(), winners.end());
winners.erase(last, winners.end());
}
return winners;
}
Lotto2
std::vector<int>Lotto2(int sum, int size)
{
std::set<int>rongqi;
std::vector<int>winners;
while (rongqi.size() != size)
rongqi.insert(rand() % sum);
for (auto pr = rongqi.begin(); pr != rongqi.end(); ++pr)
winners.push_back(*pr);
return winners;
}

本文介绍了一种实现彩票卡游戏的算法,通过两个不同的函数Lotto和Lotto2生成不重复的随机数,用于模拟彩票卡上的中奖号码。Lotto2函数采用set容器避免重复,效率更优。
201

被折叠的 条评论
为什么被折叠?



