C語言實(shí)現(xiàn)小貓釣魚游戲
本文實(shí)例為大家分享了C語言實(shí)現(xiàn)小貓釣魚游戲的具體代碼,供大家參考,具體內(nèi)容如下
#include<stdio.h> #include<time.h> #include<string.h> #include<stdlib.h> #include<windows.h> typedef struct { int data[3600]; int col[3600]; int top; } stack; typedef struct { int data[3600]; int col[3600]; int head; int tail; } queue; queue p1, p2; stack table; void printmenu(); void deal(); void printp1(); void printtable(); void printzzz(); void judge(int a, int player); void game(); void ask(); int main() { while(1) { char ch; printmenu(); scanf("%c",&ch); switch(ch) { case '1': game(); break; case '2': exit(0); default: system("cls"); break; } } return 0; } void printmenu() { printf("*****************************\n"); printf("* *\n"); printf("* *\n"); printf("* 金鉤釣魚 *\n"); printf("* *\n"); printf("* *\n"); printf("* *\n"); printf("*****************************\n"); printf("\n\n\n"); printf("游戲規(guī)則:\n"); printf("每人各拿一半的牌,然后你放1張牌,\n"); printf("他放一張牌,如跟上面的牌一樣,\n"); printf("即可把當(dāng)中的牌全部吃掉,\n"); printf("直至對(duì)手手上無牌為止。\n\n\n"); printf("輸入1開始游戲\n"); printf("輸入2退出程序\n"); } void deal() { p1.head = 1; p1.tail = 1; p2.head = 1; p2.tail = 1; table.top = 0; int i, card, book[60]; srand((unsigned)time(0)); memset(book, 0, sizeof(book)); for(i = 1; i <= 27;) { card = rand()%55; if(card == 0) continue; else if(card >= 1 && card <= 13 && book[card] == 0) { p1.data[p1.tail] = card; p1.col[p1.tail] = 1; p1.tail++; book[card]=1; i++; } else if(card >= 14 && card <= 26 && book[card] == 0) { p1.data[p1.tail] = card - 13; p1.col[p1.tail] = 2; p1.tail++; book[card]=1; i++; } else if(card >= 27 && card <= 39 && book[card] == 0) { p1.data[p1.tail] = card - 26; p1.col[p1.tail] = 3; p1.tail++; book[card]=1; i++; } else if(card >= 40 && card <= 52 && book[card] == 0) { p1.data[p1.tail] = card - 39; p1.col[p1.tail] = 4; p1.tail++; book[card]=1; i++; } else if(card == 53) { p1.data[p1.tail] = card; p1.col[p1.tail] = 5; p1.tail++; book[card]=1; i++; } else if(card == 54) { p1.data[p1.tail] = card; p1.col[p1.tail] = 5; p1.tail++; book[card]=1; i++; } } for(i = 1; i <= 27;) { card = rand()%55; if(card == 0) continue; else if(card >= 1 && card <= 13 && book[card] == 0) { p2.data[p2.tail] = card; p2.col[p2.tail] = 1; p2.tail++; book[card]=1; i++; } else if(card >= 14 && card <= 26 && book[card] == 0) { p2.data[p2.tail] = card - 13; p2.col[p2.tail] = 2; p2.tail++; book[card]=1; i++; } else if(card >= 27 && card <= 39 && book[card] == 0) { p2.data[p2.tail] = card - 26; p2.col[p2.tail] = 3; p2.tail++; book[card]=1; i++; } else if(card >= 40 && card <= 52 && book[card] == 0) { p2.data[p2.tail] = card - 39; p2.col[p2.tail] = 4; p2.tail++; book[card]=1; i++; } else if(card == 53 && book[card] == 0) { p2.data[p2.tail] = card; p2.col[p2.tail] = 5; p2.tail++; book[card]=1; i++; } else if(card == 54 && book[card] == 0) { p2.data[p2.tail] = card; p2.col[p2.tail] = 5; p2.tail++; book[card]=1; i++; } } return; } void printp1() { int i; printf("您的牌有: \n"); for(i = p1.tail-1; i >= p1.head; i--) { if(p1.col[i] == 1) { printf("方片"); } else if(p1.col[i] == 2) { printf("紅桃"); } else if(p1.col[i] == 3) { printf("黑桃"); } else if(p1.col[i] == 4) { printf("梅花"); } if(p1.data[i] == 11) { printf("J "); } else if(p1.data[i] == 12) { printf("Q "); } else if(p1.data[i] == 13) { printf("K "); } else if(p1.data[i] == 53) { printf("小王 "); } else if(p1.data[i] == 54) { printf("大王 "); } else printf("%d ", p1.data[i]); } printf("\n\n"); return; } void printtable() { int i; printf("桌上的牌有:\n"); if(table.top == 0) { printf("(無)\n"); } for(i = 1; i <= table.top; i++) { if(table.col[i] == 1) { printf("方片"); } else if(table.col[i] == 2) { printf("紅桃"); } else if(table.col[i] == 3) { printf("黑桃"); } else if(table.col[i] == 4) { printf("梅花"); } if(table.data[i] == 11) { printf("J "); } else if(table.data[i] == 12) { printf("Q "); } else if(table.data[i] == 13) { printf("K "); } else if(table.data[i] == 53) { printf("小王 "); } else if(table.data[i] == 54) { printf("大王 "); } else printf("%d ", table.data[i]); } printf("\n\n\n"); return; } void printzzz() { system("cls"); Sleep(400); printf("正 "); Sleep(400); printf("在 "); Sleep(400); printf("出 "); Sleep(400); printf("牌 "); Sleep(400); printf(". "); Sleep(400); printf(". "); Sleep(400); printf(". "); Sleep(800); judge(table.data[table.top], 1); system("cls"); printf("玩家2 開始回合?。n\n\n\n"); printtable(); table.top++; table.data[table.top] = p2.data[p2.head]; table.col[table.top] = p2.col[p2.head]; p2.head++; Sleep(600); printf("玩 "); Sleep(400); printf("家 "); Sleep(400); printf("2 "); Sleep(400); printf("正 "); Sleep(400); printf("在 "); Sleep(400); printf("出 "); Sleep(400); printf("牌 "); Sleep(400); printf(". "); Sleep(400); printf(". "); Sleep(400); printf(". "); Sleep(1000); judge(table.data[table.top], 2); return; } void judge(int a, int player) { int i, j, sum = 2; if(player == 1) { for(i = table.top-1; i >= 1; i--, sum++) { if(a == table.data[i] || ((a == 53 || a == 54) && (table.data[i] == 53 || table.data[i] == 54))) { for(j = table.top; j >= i; j--) { p1.data[p1.tail] = table.data[table.top]; p1.col[p1.tail] = table.col[table.top]; p1.tail++; table.top--; } break; } } if(i != 0) { system("cls"); Sleep(400); printf("玩 "); Sleep(400); printf("家 "); Sleep(400); printf("1 "); Sleep(400); printf("贏 "); Sleep(400); printf("了 "); Sleep(400); printf("%d ", sum); Sleep(400); printf("張"); Sleep(400); printf("牌 "); Sleep(400); printf("! "); Sleep(400); printf("! "); Sleep(400); printf("! "); Sleep(2000); system("cls"); } } else if(player == 2) { for(i = table.top-1; i >= 1; i--, sum++) { if(a == table.data[i] || ((a == 53 || a == 54) && (table.data[i] == 53 || table.data[i] == 54))) { for(j = table.top; j >= i; j--) { p2.data[p2.tail] = table.data[table.top]; p2.col[p2.tail] = table.col[table.top]; p2.tail++; table.top--; } break; } } if(i != 0) { system("cls"); Sleep(400); printf("玩 "); Sleep(400); printf("家 "); Sleep(400); printf("2 "); Sleep(400); printf("贏 "); Sleep(400); printf("了 "); Sleep(400); printf("%d ", sum); Sleep(400); printf("張"); Sleep(400); printf("牌 "); Sleep(400); printf("! "); Sleep(400); printf("! "); Sleep(400); printf("! "); Sleep(2000); system("cls"); } } return; } void game() { deal(); getchar(); while(p1.head != p1.tail && p2.head != p2.tail) { system("cls"); int i; printf("玩家1 開始回合??!\n\n\n\n"); printp1(); printtable(); printf("按回車來出牌\n"); getchar(); table.top++; table.data[table.top] = p1.data[p1.head]; table.col[table.top] = p1.col[p1.head]; p1.head++; printzzz(); } if(p1.head == p1.tail) { printf("恭喜您取得了勝利?。?!\n"); printf("感謝使用本程序\n"); system("pause"); } else { printf("你沒有牌了!"); printf("不好意思,您輸了。。。\n"); printf("不要灰心,可以再來一局?。n"); system("pause"); } return; } void ask() { char ch; system("cls"); printf("你確定要退出?\n"); printf("(輸入y確認(rèn)對(duì)出)\n"); printf("Y/N\n"); scanf("%c", &ch); if(ch == 'y' || ch == 'Y') { exit(0); } else { return; } }
以上就是本文的全部?jī)?nèi)容,希望對(duì)大家的學(xué)習(xí)有所幫助,也希望大家多多支持腳本之家。
- C語言實(shí)現(xiàn)學(xué)生成績(jī)管理系統(tǒng)實(shí)戰(zhàn)教學(xué)
- C語言實(shí)現(xiàn)紙牌游戲之小貓釣魚算法
- C語言如何在指針中隱藏?cái)?shù)據(jù)詳解
- C語言利用模板實(shí)現(xiàn)簡(jiǎn)單的棧類
- C語言數(shù)組棧實(shí)現(xiàn)模板
- C語言實(shí)現(xiàn)Flappy Bird小游戲
- C語言實(shí)現(xiàn)2048游戲(ege圖形庫版)
- C語言簡(jiǎn)易版flappy bird小游戲
- C語言結(jié)構(gòu)體數(shù)組同時(shí)賦值的另類用法
- 如何寫出優(yōu)美的C語言代碼
相關(guān)文章
C++中整形與浮點(diǎn)型如何在內(nèi)存中的存儲(chǔ)詳解
大家好!這期和大家分享整形和浮點(diǎn)型是如何在數(shù)據(jù)是如何在內(nèi)存中存儲(chǔ),下面文章具有一定的參考價(jià)值,需要的小伙伴可以參考一下2022-05-05C語言中實(shí)現(xiàn)itoa函數(shù)的實(shí)例
這篇文章主要介紹了C語言中實(shí)現(xiàn)itoa函數(shù)的實(shí)例的相關(guān)資料,希望通過本文能幫助到大家,讓大家實(shí)現(xiàn)這樣的功能,需要的朋友可以參考下2017-10-10使用c語言判斷100以內(nèi)素?cái)?shù)的示例(c語言求素?cái)?shù))
這篇文章主要介紹了使用c語言判斷100以內(nèi)素?cái)?shù)的示例(c語言求素?cái)?shù)),需要的朋友可以參考下2014-03-03淺談C++ Explicit Constructors(顯式構(gòu)造函數(shù))
下面小編就為大家?guī)硪黄獪\談C++ Explicit Constructors(顯式構(gòu)造函數(shù))。小編覺得挺不錯(cuò)的,現(xiàn)在就分享給大家,也給大家做個(gè)參考。一起跟隨小編過來看看吧2016-12-12visual?studio?2022一個(gè)不易發(fā)現(xiàn)的問題
本文主要介紹了visual?studio?2022一個(gè)不易發(fā)現(xiàn)的問題,文中通過示例代碼介紹的非常詳細(xì),對(duì)大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價(jià)值,需要的朋友們下面隨著小編來一起學(xué)習(xí)學(xué)習(xí)吧2022-07-07C C++算法題解LeetCode1408數(shù)組中的字符串匹配
這篇文章主要為大家介紹了C C++算法題解LeetCode1408數(shù)組中的字符串匹配示例詳解,有需要的朋友可以借鑒參考下,希望能夠有所幫助,祝大家多多進(jìn)步,早日升職加薪2022-10-10