In 5-card draw poker, a player is dealt a hand of five cards (which may be looked at). The player may then discard between zero and five of his or her cards and have them replaced by the same number of cards from
the top of the deck (which is face down). The object is to maximize the value of the final hand. The different values of hands in poker are given at the end of this problem.
Normally the player cannot see the cards in the deck and so must use probability to decide which cards to discard. In this problem, we imagine that the poker player is psychic and knows which cards are on top of
the deck. Write a program which advises the player which cards to discard so as to maximize the value of the resulting hand.
Input and Output
Input will consist of a series of lines, each containing the initial five cards in the hand then the first five cards on top of the deck. Each card is represented as a two-character code. The first character is
the face-value (A=Ace, 2-9, T=10, J=Jack, Q=Queen, K=King) and the second character is the suit (C=Clubs, D=Diamonds, H=Hearts, S=Spades). Cards will be separated by single spaces. Each input line will be from a single valid deck, that is there will be no
duplicate cards in each hand and deck.
Each line of input should produce one line of output, consisting of the initial hand, the top five cards on the deck, and the best value of hand that is possible. Input is terminated by end of file.
Use the sample input and output as a guide. Note that the order of the cards in the player's hand is irrelevant, but the order of the cards in the deck is important because the discarded cards must be replaced from
the top of the deck. Also note that examples of all types of hands appear in the sample output, with the hands shown in decreasing order of value.
Sample Input
TH JH QC QD QS QH KH AH 2S 6S
2H 2S 3H 3S 3C 2D 3D 6C 9C TH
2H 2S 3H 3S 3C 2D 9C 3D 6C TH
2H AD 5H AC 7H AH 6H 9H 4H 3C
AC 2D 9C 3S KD 5S 4D KS AS 4C
KS AH 2H 3C 4H KC 2C TC 2D AS
AH 2C 9S AD 3C QH KS JS JD KD
6C 9C 8C 2D 7C 2H TC 4C 9S AH
3D 5S 2H QD TD 6S KH 9H AD QH
Sample Output
Hand: TH JH QC QD QS Deck: QH KH AH 2S 6S Best hand: straight-flush
Hand: 2H 2S 3H 3S 3C Deck: 2D 3D 6C 9C TH Best hand: four-of-a-kind
Hand: 2H 2S 3H 3S 3C Deck: 2D 9C 3D 6C TH Best hand: full-house
Hand: 2H AD 5H AC 7H Deck: AH 6H 9H 4H 3C Best hand: flush
Hand: AC 2D 9C 3S KD Deck: 5S 4D KS AS 4C Best hand: straight
Hand: KS AH 2H 3C 4H Deck: KC 2C TC 2D AS Best hand: three-of-a-kind
Hand: AH 2C 9S AD 3C Deck: QH KS JS JD KD Best hand: two-pairs
Hand: 6C 9C 8C 2D 7C Deck: 2H TC 4C 9S AH Best hand: one-pair
Hand: 3D 5S 2H QD TD Deck: 6S KH 9H AD QH Best hand: highest-card
下面是从网上找的扑克牌规则:
题意:从手上舍弃N张牌(0<=N<=5)从deck中顺序抽取N张牌,求所能达到的最大牌,我直接枚举模拟了。。。
太暴力了。。
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
string str[9]={"straight-flush","four-of-a-kind","full-house","flush","straight","three-of-a-kind","two-pairs","one-pair","highest-card"};
string str1[5],str2[5];
bool cmp(string s1,string s2)
{
return s1<s2;
}
bool straightflush(vector<string>st1)
{
int tag1=1,tag2=1,tag=0,i;
sort(st1.begin(),st1.end(),cmp);
for(i=1;i<st1.size();i++)
{
if(st1[i][1]!=st1[i-1][1]||st1[i][0]!=(st1[i-1][0]+1))
{
tag1=0;
break;
}
}
if(st1[4][0]=='N'&&tag1==0)
{
tag=1;
st1[4][0]='A';
sort(st1.begin(),st1.end(),cmp);
for(i=1;i<st1.size();i++)
{
if(st1[i][1]!=st1[i-1][1]||st1[i][0]!=(st1[i-1][0]+1))
{
tag2=0;
break;
}
}
}
if(tag==0&&tag2==1) tag2=0;
if(tag1||tag2) return true;
else return false;
}
bool FourKind(vector<string>st1)
{
int i,j;
for(i=0;i<st1.size();i++)
{
int k=0;
for(j=0;j<st1.size();j++)
{
if(st1[i][0]==st1[j][0])
{
k++;
}
}
if(k==4) return true;
}
return false;
}
bool Full(vector<string>st1)
{
int h[5],tag1=0,tag2=0;
int i,j;
for(i=0;i<st1.size();i++)
{
h[i]=0;
for(j=0;j<st1.size();j++)
{
if(st1[i][0]==st1[j][0])
{
h[i]++;
}
}
}
for(i=0;i<5;i++)
{
if(h[i]==3) tag1++;
else if(h[i]==2) tag2++;
}
if(tag1==3&&tag2==2) return true;
else return false;
}
bool Flush(vector<string> st1)
{
int tag=1,i;
for(i=1;i<st1.size();i++)
{
if(st1[i][1]!=st1[i-1][1])
{
tag=0;
}
}
if(tag) return true;
else return false;
}
bool Straight(vector<string> st1)
{
int tag1=1,tag2=1,tag=0,i;
sort(st1.begin(),st1.end(),cmp);
for(i=1;i<st1.size();i++)
{
if(st1[i][0]!=(st1[i-1][0]+1))
{
tag1=0;
break;
}
}
if(tag1==0&&st1[4][0]=='N')
{
tag=1;
st1[4][0]='A';
sort(st1.begin(),st1.end(),cmp);
for(i=1;i<st1.size();i++)
{
if(st1[i][0]!=(st1[i-1][0]+1))
{
tag2=0;
break;
}
}
}
if(tag==0&&tag2==1) tag2=0;
if(tag1||tag2) return true;
else return false;
}
bool Three(vector<string> st1)
{
int i,j;
for(i=0;i<st1.size();i++)
{
int k=0;
for(j=0;j<st1.size();j++)
{
if(st1[i][0]==st1[j][0])
{
k++;
}
}
if(k==3) return true;
}
return false;
}
bool twopair(vector<string> st1)
{
int tag=0,h[5];
int i,j;
for(i=0;i<st1.size();i++)
{
h[i]=0;
for(j=0;j<st1.size();j++)
{
if(st1[i][0]==st1[j][0])
{
h[i]++;
}
}
}
for(i=0;i<5;i++)
{
if(h[i]==2) tag++;
}
if(tag==4) return true;
else return false;
}
bool onepair(vector<string> st1)
{
int i,j;
for(i=0;i<st1.size();i++)
{
int k=0;
for(j=0;j<st1.size();j++)
{
if(st1[i][0]==st1[j][0])
{
k++;
}
}
if(k==2) return true;
}
return false;
}
int judge(vector<string> st1)
{
int i;
for(i=0;i<st1.size();i++)
{
if(st1[i][0]>='2'&&st1[i][0]<='9') st1[i][0]='A'+(st1[i][0]-'1');
else if(st1[i][0]=='T') st1[i][0]='J';
else if(st1[i][0]=='J') st1[i][0]='K';
else if(st1[i][0]=='Q') st1[i][0]='L';
else if(st1[i][0]=='K') st1[i][0]='M';
else if(st1[i][0]=='A') st1[i][0]='N';
}
if(straightflush(st1)) return 0;
else if(FourKind(st1)) return 1;
else if(Full(st1)) return 2;
else if(Flush(st1)) return 3;
else if(Straight(st1)) return 4;
else if(Three(st1)) return 5;
else if(twopair(st1)) return 6;
else if(onepair(st1)) return 7;
else return 8;
}
int main()
{
string s;
while(cin>>s)
{
str1[0]=s;
int i,j,k,l;
for(i=1;i<5;i++)
cin>>str1[i];
for(i=0;i<5;i++)
cin>>str2[i];
int t=9;
for(i=0;i<=5;i++)
{
vector<string> st;
string s1;
for(k=0;k<i;k++)
{
s1=s1+'0';
}
for(k=0;k<5-i;k++)
{
s1=s1+'1';
}
//cout<<s1<<endl;
for(j=0;j<i;j++)
{
st.push_back(str2[j]);
}
for(k=0;k<5;k++)
{
if(s1[k]=='1') st.push_back(str1[k]);
}
if(judge(st)<t) t=judge(st);
while(next_permutation(s1.begin(),s1.end()))
{
st.clear();
for(j=0;j<i;j++)
{
st.push_back(str2[j]);
}
for(k=0;k<5;k++)
{
if(s1[k]=='1') st.push_back(str1[k]);
}
if(judge(st)<t) t=judge(st);
//cout<<s1<<endl;
}
}
//cout<<t<<endl;
cout<<"Hand: ";
for(i=0;i<5;i++)
cout<<str1[i]<<" ";
cout<<"Deck: ";
for(i=0;i<5;i++)
cout<<str2[i]<<" ";
cout<<"Best hand: ";
cout<<str[t]<<endl;
}
return 0;
}
分享到:
相关推荐
通灵扑克玩家解决方法: :
基于PsyC的一些最常见的人工神经网络模型的C实现。
语言:English 进入令人兴奋的令人兴奋的全球调查世界和精神审查 随着互联网的增长,人们提出问题的人数也是如此。我们不再绑在等待书籍,以便获得我们正在寻找的答案。它已成为一个伟大的教育工具和一种启发别人的...
psychic-ui:OpenGL UI库
python库。 资源全名:psychic_disco-0.10.0.tar.gz
心理 소개 发布。 용법개발개발 编译 ./gradlew构建 插件= ./psychics-common/build/libs/Psychics.jar 能力= ./psychics-abilities/build/libs/GroupName.AbilityName.jar 依赖插件 ... 후PaperMC 1.16.3구동하세요...
测试 01.访问日志分析 运行环境: Linux(Ubuntu优先) 先决条件: 卷曲 q 操作说明: 从ftp://ita.ee.lbl.gov/traces/NASA_access_log_Aug95.gz下载日志文件 解压下载的文件并将其放入question1文件夹 ...
psychic-sniffle:https
通过Master Psychic Rachel在线获得免费或付费的心理阅读 与Internet排名最高的在线心理学家之一,Master Psychic Rachel一起获得免费或付费的心理学读物。 * MasterPsychicOnline.com是您免费心理阅读的第一来源。 ...
Psychic Messenger 3免费通灵问答 获得3个免费的心理答案,当您可以获得其他免费的心理答案时,会收到新优惠的通知。 如果您有需要心理答案的问题,或者想知道将来会发生什么,这是给您的! 关系答案爱情生活答案...
psychic_game
通灵游戏 猜猜计算机在想什么!
精神sharkey告诉我16岁的时候,如果我多呼吸,直到我头昏眼花,我就不再通灵了,这与他的生意有关。 因为他的生意全是通灵的,这就是他的心灵感应。 我想知道我想告诉中央情报局...帮助我。 这种鲨鱼是疯狂的。...
此Psychic Awakening软件使用模式识别(您的大脑功能)在100%随机静态范围内找到潜意识图像(在右侧启用Adobe Flash)。 有了开放思想,您也可以在此计算机屏幕和网站上看到“心理思想图像”。 显示“静态”后,您...
与Internet排名最高的在线心理学家之一,Master Psychic Rachel一起获得免费或付费的心理学读物。 * MasterPsychicOnline.com是您免费心理阅读的第一来源。 *首次客户可以每月支付1倍费用,并获得免费的答案。 * Vip...
答:这是一个JavaScript项目,其中包含一个名为Psychic Game的游戏。 它允许玩家尝试猜测通灵者在想什么字母。 问:为什么这个项目有用? 答:这个项目很有用,因为它可以帮助人们获得乐趣。 问:如何开始这个...
matlab距离矩阵代码精神 使用Hi-C数据查找推定的增强子的代码 用法 python htad-chain.py 要运行该示例,请使用repo目录中的python htad-chain.py examples/himr90.chr20.conf 。...Hi-C文件的res分辨率,以基为...
mongod 客户端 psychic-octo MonGOD 应用程序的客户端