資源簡介
c++游戲
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
代碼片段和文件信息
#include
#include
#include
#include?
using?namespace?std;
struct?pai
{
int?paifu;
int?huase;
int?yanse;
int?dianshu;
int?leixing;
int?changdu;
void?Kanpai()
{
if(paifu==0||paifu==1);
else
printf(“牌副參數錯誤!\n“);
switch(huase)
{
case?0:cout<<“黑桃“;break;
case?1:cout<<“紅桃“;break;
case?2:cout<<“草花“;break;
case?3:cout<<“方片“;break;
case?-1:cout<<“無色“;break;
default:printf(“花色錯誤!\n“);break;
}
switch(dianshu)
{
case?0:cout<<“A?“;break;
case?1:cout<<“2?“;break;
case?2:cout<<“3?“;break;
case?3:cout<<“4?“;break;
case?4:cout<<“5?“;break;
case?5:cout<<“6?“;break;
case?6:cout<<“7?“;break;
case?7:cout<<“8?“;break;
case?8:cout<<“9?“;break;
case?9:cout<<“10?“;break;
case?10:cout<<“J?“;break;
case?11:cout<<“Q?“;break;
case?12:cout<<“K?“;break;
case?-1:cout<<“無點數“;break;
default:printf(“點數錯誤!\n“);break;
}
switch(leixing)
{
case?101:cout<<“【殺】“< case?102:cout<<“【閃】“< case?103:cout<<“【桃】“< case?201:cout<<“【過河拆橋】“< case?202:cout<<“【順手牽羊】“< case?203:cout<<“【無中生有】“< case?204:cout<<“【決斗】“< case?205:cout<<“【借刀殺人】“< case?206:cout<<“【桃園結義】“< case?207:cout<<“【五谷豐登】“< case?208:cout<<“【南蠻入侵】“< case?209:cout<<“【萬箭齊發】“< case?210:cout<<“【無懈可擊】“< case?251:cout<<“【樂不思蜀】“< case?252:cout<<“【閃電】“< case?301:cout<<“【諸葛連弩(1)】“< case?302:cout<<“【雌雄雙股劍(2)】“< case?303:cout<<“【青釭劍(2)】“< case?304:cout<<“【青龍偃月刀(3)】“< case?305:cout<<“【丈八蛇矛(3)】“< case?306:cout<<“【貫石斧(3)】“< case?307:cout<<“【方天畫戟(4)】“< case?308:cout<<“【麒麟弓(5)】“< case?331:cout<<“【八卦陣】“< case?361:cout<<“【赤兔(-1)】“< case?362:cout<<“【大宛(-1)】“< case?363:cout<<“【紫辛(-1)】“< case?381:cout<<“【爪黃飛電(+1)】“< case?382:cout<<“【的盧(+1)】“< case?383:cout<<“【絕影(+1)】“< default:printf(“類型參數錯誤!“);break;
}
}
};
void?Qishixipai(pai?A[2][4][13]pai?paidui[104])
{
int?imxyza[104]={0};
srand((unsigned)time(NULL));
for(i=1;i<=104;i++)
{
while(a[m=rand()%104]);
a[m]=i;
}
for(i=0;i<=103;i++)
{
x=(a[i]-1)/52;
y=((a[i]-1)-52*x)/13;
z=(a[i]-1)%13;
paidui[i]=A[x][y][z];
}
}
void?Xipai(pai?paidui[104]int*paiduishupai?qipaidui[104]int*qipaishu)
{
int?ima[104]={0};
srand((unsigned)time(NULL));
for(i=1;i<=(*qipaishu);i++)
{
while(a[m=rand()%(*qipaishu)]);
a[m]=i;
}
for(i=0;i<=((*qipaishu)-1);i++)
{
paidui[i]=qipaidui[a[i]];
qipaidui[a[i]].leixing=-1;
(*paiduishu)++;
(*qipaishu)--;
}
for(i=(*paiduishu);i<=103;i++)paidui[i].leixing=-1;
}
pai?Mo1pai(pai?A[104]int?*xpai?B[104]int*yint?*b)
{
pai?p;
if((*x)==0)Xipai(AxBy);
else?if((*x)<0)printf(“摸牌參數錯誤!“);
else;
p=A[104-(*x)];
(*x)--;
(*b)++;
return(p);
}
struct?wujiang
{
char?name;
int?tili;
in
評論
共有 條評論