HNU程序设计训练——打牌

【问题描述】

牌只有1到9，手里拿着已经排好序的牌a，对方出牌b，用程序判断手中牌是否能够压过对方出牌。 
规则：出牌牌型有5种   
[1]一张 如4 则5…9可压过 
[2]两张 如44 则55，66，77，…，99可压过 
[3]三张 如444 规则如[2] 
[4]四张 如4444 规则如[2] 
[5]五张 牌型只有12345 23456 34567 45678 56789五个，后面的比前面的均大。

【输入形式】

输入有多行，第一行代表手中的牌，长度不超过200个数字。接下来的每一行代表每次对方出的牌。

【输出形式】

输出有多行，代表手中的牌是否能压过对方出的牌，压过输出YES， 并列出所有可选项，可选项之间用空格分隔。 否则输出NO。

【样例输入】

17624234556367
33
222
34567

【样例输出】

YES 44 55 66 77
YES 666
NO

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;

void printyes(vector<string> win)
{
	cout << "YES ";
	for (auto it = win.begin(); it != win.end(); it++)
		cout << *it << ' ';
	cout << endl;
}
void Find(bool& flag, vector<string>& win, string card, int tmp)
{
	string ss = to_string(tmp);
	int temp = card.find(ss);
	if (temp != -1)
	{
		flag = true;
		win.push_back(ss);
	}
}
void fun1(string card, string s)
{
	bool flag = false;
	vector<string> win;
	for (int i = s[0] - '0' + 1; i < 10; i++)
		Find(flag, win, card, i);
	if (flag)		printyes(win);
	else	cout << "NO" << endl;
}
void fun2(string card, string s)
{
	bool flag = false;
	vector<string> win;
	for (int i = s[0] - '0' + 1; i < 10; i++)
	{
		int tmp = i * 11;
		Find(flag, win, card, tmp);
	}
	if (flag)	printyes(win);
	else	cout << "NO" << endl;
}

void fun3(string card, string s)
{
	bool flag = false;
	vector<string> win;
	for (int i = s[0] - '0' + 1; i < 10; i++)
	{
		int tmp = i * 100 + i * 11;
		Find(flag, win, card, tmp);
	}
	if (flag)	printyes(win);
	else	cout << "NO" << endl;
}
void fun4(string card, string s)
{
	bool flag = false;
	vector<string> win;
	for (int i = s[0] - '0' + 1; i < 10; i++)
	{
		int tmp = i * 1000 + i * 100 + i * 11;
		Find(flag, win, card, tmp);
	}
	if (flag)	printyes(win);
	else	cout << "NO" << endl;
}
void fun5(string card, string s)
{
	bool flag = false;
	vector<string> win;
	for (int i = s[0] - '0' + 1; i < 6; i++)
	{
		int tmp = i * 10000 + (i + 1) * 1000 + (i + 2) * 100 + (i + 3) * 10 + (i + 4);
		string ss = to_string(tmp);
		string s1=to_string(i), s2=to_string(i+1), s3 = to_string(i + 2), s4 = to_string(i + 3), s5 = to_string(i + 4);
		int temp1 = card.find(s1), temp2 = card.find(s2), temp3 = card.find(s3), temp4 = card.find(s4), temp5 = card.find(s5);
		if (temp1 != -1 && temp2 != -1 && temp3 != -1 && temp4 != -1 && temp5 != -1)
		{
			flag = true;
			win.push_back(ss);
		}
	}//sort后优先排列为22333,不可直接查找"23"
	if (flag) printyes(win);
	else 	cout << "NO" << endl;
}
int main()
{
	string card, s;
	cin >> card;
	sort(card.begin(), card.end());
	while (cin >> s)
	{
		int n = s.length();
		if (n == 1) fun1(card, s);
		else if (n == 2) fun2(card, s);
		else if (n == 3) fun3(card, s);
		else if (n == 4) fun4(card, s);
		else if (n == 5) fun5(card, s);
	}
	return 0;
}