這篇文章給大家分享的是有關C語言如何實現(xiàn)對對碰游戲的內(nèi)容。小編覺得挺實用的,因此分享給大家做個參考,一起跟隨小編過來看看吧。
創(chuàng)新互聯(lián)公司是一家集網(wǎng)站建設,常山企業(yè)網(wǎng)站建設,常山品牌網(wǎng)站建設,網(wǎng)站定制,常山網(wǎng)站建設報價,網(wǎng)絡營銷,網(wǎng)絡優(yōu)化,常山網(wǎng)站推廣為一體的創(chuàng)新建站企業(yè),幫助傳統(tǒng)企業(yè)提升企業(yè)形象加強企業(yè)競爭力??沙浞譂M足這一群體相比中小企業(yè)更為豐富、高端、多元的互聯(lián)網(wǎng)需求。同時我們時刻保持專業(yè)、時尚、前沿,時刻以成就客戶成長自我,堅持不斷學習、思考、沉淀、凈化自己,讓我們?yōu)楦嗟钠髽I(yè)打造出實用型網(wǎng)站。
本文實例為大家分享了C語言對對碰游戲的具體代碼,供大家參考,具體內(nèi)容如下
//////////////////////////////////////// //畫素材的x和y都是反的,因為x表示行,但是畫出來x表示列,y同 //////////////////////////////////////// #include#include #include #include #include #include #pragma comment(lib, "Winmm.lib") using namespace std; /***************定義枚舉類型*****************/ enum color{blank, red, yellow, blue, green, white, orange, purple, shizijia, zhadan, qicai, alarm}; /***************定義全局變量***************/ const int MaxT = 12; // 時間上限 const int T = 10 * MaxT;// 時間速度 const int V = 300; // 停留時間 clock_t start, now; // 控制時間 color gem[9][8]; // 地圖 // IMAGE對象 IMAGE img[12], music_img[2], exit_img, jindutiao; int Score, Time; // 成績 時間 bool Flag, Music = true;// 是否加載 音樂 /*******************函數(shù)聲明******************/ void load(void); // 加載IMAGE對象 void Blank(void); // 清空 bool soso(void); // 搜索空格 bool baidu(void); // 搜索解法 void New(void); // 更新 void print(void); // 輸出 bool judge(void); // 判斷是否可以消除 void fall(void); // 下落 void draw(void); // 消除 bool quit(void); // 是否重新開始 void play(void); // 游戲過程 /********************定義函數(shù)****************/ void load(void) { char c[20]; int i; // 加載IMAGE對象 for (i = 0; i < 12; i++) { ostrstream strout(c, 50); strout <<"圖片\\" <>Flag >>Music; if (Flag) { HWND wnd = GetHWnd(); SetWindowText(wnd, "對對碰"); if (MessageBox(wnd, "是否繼續(xù)上次游戲?", "游戲開始", MB_YESNO | MB_ICONQUESTION) == IDYES) { fin >>Score >>Time; for (i = 0; i < 9; i++) for (int j = 0; j < 8; j++) { int t; fin >>t; gem[i][j] = color(t); } } else Flag = false; } fin.close(); } void Blank(void) { for (int i = 1; i < 9; i++) for (int j = 0; j < 8; j++) gem[i][j] = blank; print(); fall(); } bool soso(void) { for (int i = 1; i < 9; i++) for (int j = 0; j < 8; j++) if (gem[i][j] == blank) return true; return false; } bool baidu(void) { int i, j; color t; bool flag = false; // 如果有一個道具則返回真 for (i = 1; i < 9; i++) for (j = 0; j < 8; j++) if (gem[i][j] >= shizijia) return true; // 搜索解法 for (i = 1; i < 9; i++) for (j = 0; j < 7; j++) { t = gem[i][j]; gem[i][j] = gem[i][j + 1]; gem[i][j + 1] = t; if (judge()) flag = true; t = gem[i][j]; gem[i][j] = gem[i][j + 1]; gem[i][j + 1] = t; if (flag) return true; } for (i = 1; i < 7; i++) for (j = 0; j < 8; j++) { t = gem[i][j]; gem[i][j] = gem[i + 1][j]; gem[i + 1][j] = t; if (judge()) flag = true; t = gem[i][j]; gem[i][j] = gem[i + 1][j]; gem[i + 1][j] = t; if (flag) return true; } return false; } void New(void) { static int old_score = -1, old_time = T; bool flag = false; if (Score != old_score) // 更新分數(shù) { if (Score > 999999999) { if (MessageBox(GetHWnd(), "恭喜你達到了最高分!\n是否重新開始?", "游戲結(jié)束", MB_YESNO | MB_ICONQUESTION) == IDYES) Score = 0; else exit(0); } char s[15]; ostrstream strout(s, 15); strout <<'$' < old_time) putimage(540, 140, &jindutiao); setcolor(BLACK); for (int i = 0; i < T - Time; i++) { line(540, 140 + 2 * i, 580, 140 + 2 * i); line(540, 140 + 2 * i + 1, 580, 140 + 2 * i + 1); } old_time = Time; flag = true; } if (flag) // 寫存檔 { ofstream fout("存檔.dat"); fout < = 1; i--) if (gem[i][j] == blank) { a[j] = i; sign = true; break; } if (sign == false) return; IMAGE im[8]; for (j = 0; j < 8; j++) if (a[j] > 1) getimage(&im[j], 60 * j, 0, 60, 60 * (a[j] - 1)); for (i = 0; i < 60 ; i += 2) for (j = 0; j < 8; j++) if (a[j] > 0) { if (a[j] > 1) putimage(60 * j, i + 2, &im[j]); putimage(60 * j, i + 2 - 60, &img[int(gem[0][j])]); Sleep(1); } for (j = 0; j < 8; j++) if (a[j] > 0) { for (i = a[j]; i > 0; i--) gem[i][j] = gem[i - 1][j]; if (rand() % 50 == 0) gem[0][j] = color(rand() % 4 + 8); else gem[0][j] = color(rand() % 7 + 1); } } // 加對大括號使遞歸時撤銷內(nèi)存空間 if (soso()) fall(); if (judge()) draw(); } void draw(void) { { int i, j; bool a[9][8] = {false}; for (i = 1; i < 9; i++) for (j = 0; j < 6; j++) if (gem[i][j] == gem[i][j + 1] && gem[i][j] == gem[i][j + 2]) a[i][j] = a[i][j + 1] = a[i][j + 2] = true; for (i = 1; i < 7; i++) for (j = 0; j < 8; j++) if (gem[i][j] == gem[i + 1][j] && gem[i][j] == gem[i + 2][j]) a[i][j] = a[i + 1][j] = a[i + 2][j] = true; for (i = 1; i < 9; i++) for (j = 0; j < 8; j++) if (a[i][j]) { gem[i][j] = blank; Score += 10; } Sleep(V); Time += T / MaxT; if (Time > T) Time = T; print(); } // 加對大括號使遞歸時撤銷內(nèi)存空間 fall(); } bool quit(void) { char str[50]; ostrstream strout(str, 50); strout <<"得分:" < T) Time = T; print(); Sleep(V); fall(); if (!baidu()) Blank(); break; case zhadan: if (x > 1) { gem[x - 1][y] = blank; Score += 10; if (y > 0) { gem[x - 1][y - 1] =blank; Score += 10; } } if (y > 0) { gem[x][y - 1] = blank; if (x < 8) { gem[x + 1][y - 1] =blank; Score += 10; } } if (x < 8) { gem[x + 1][y] = blank; if (y < 7) { gem[x + 1][y + 1] =blank; Score += 10; } } if (y < 7) { gem[x][y + 1] = blank; if (x > 1) { gem[x - 1][y + 1] =blank; Score += 10; } } gem[x][y] = blank; Time += T / MaxT; if (Time > T) Time = T; print(); Sleep(V); fall(); if (!baidu()) Blank(); break; case qicai: t = color(rand() % 7 + 1); putimage(60 * y, 60 * (x - 1), &img[int(t)]); Sleep(V); for (i = 1; i < 9; i++) for (j = 0; j < 8; j++) if (gem[i][j] == t) { gem[i][j] = blank; putimage(60 * j, 60 * (i - 1), &img[0]); Score += 10; } gem[x][y] = blank; Time += T / MaxT; if (Time > T) Time = T; print(); fall(); if (!baidu()) Blank(); break; case alarm: Time = T; gem[x][y] = blank; print(); fall(); if (!baidu()) Blank(); break; } break; } else if (x1 > 480 && x1 < 560 && y1 > 400 && y1 < 480) { if (Music) mciSendString("stop mymusic", NULL, 0, NULL); else mciSendString("play mymusic from 0 repeat", NULL, 0, NULL); Music = !Music; putimage(480, 400, &music_img[int(Music)]); } else if (x1 > 560 && x1 < 640 && y1 > 400 && y1 < 480) exit(0); } } now = clock(); if (now - start >= CLOCKS_PER_SEC * MaxT / T) { start = now; Time--; New(); if (Time <= 0) return; } } while (m.mkLButton && m.y < 480) { m = GetMouseMsg(); x = m.x; y = m.y; if (x - x1 > 30 || x1 - x > 30 || y - y1 > 30 || y1 - y > 30) { sign = false; break; } now = clock(); if (now - start >= CLOCKS_PER_SEC * MaxT / T) { start = now; Time--; New(); if (Time <= 0) return; } } if(sign) { putimage(x1 - x1 % 60, y1 - y1 % 60, &img[int(gem[y1 / 60 + 1][x1 / 60])], SRCPAINT); continue; } if (y1 - y > 30 && y1 / 60 > 0) fx = 'u'; if (y - y1 > 30 && y1 / 60 < 7) fx = 'd'; if (x1 - x > 30 && x1 / 60 > 0) fx = 'l'; if (x - x1 > 30 && x1 / 60 < 7) fx = 'r'; x = y1 / 60 + 1; y = x1 / 60; x1 = y1 = 0; switch (fx) { case 'u':x1 = -1; break; case 'd':x1 = 1; break; case 'l':y1 = -1; break; case 'r':y1 = 1; break; case '\0':continue; } for (i = 0; i < 60;) { putimage(60 * y, 60 * (x - 1), &img[0]); putimage(60 * y, 60 * (x - 1), &img[0]); i += 1; putimage(60 * (y + y1) - i * y1, 60 * (x - 1 + x1) - i * x1, &img[int(gem[x + x1][y + y1])]); putimage(60 * y + i * y1, 60 * (x - 1) + i * x1, &img[int(gem[x][y])]); Sleep(2); } t = gem[x][y]; gem[x][y] = gem[x + x1][y + y1]; gem[x + x1][y + y1] = t; if (judge()) { draw(); if (!baidu()) Blank(); } else { for (i = 0; i < 60;) { putimage(60 * y, 60 * (x - 1), &img[0]); putimage(60 * y, 60 * (x - 1), &img[0]); i += 1; putimage(60 * (y + y1) - i * y1, 60 * (x - 1 + x1) - i * x1, &img[int(gem[x + x1][y + y1])]); putimage(60 * y + i * y1, 60 * (x - 1) + i * x1, &img[int(gem[x][y])]); Sleep(2); } t = gem[x][y]; gem[x][y] = gem[x + x1][y + y1]; gem[x + x1][y + y1] = t; } now = clock(); if (now - start >= CLOCKS_PER_SEC * MaxT / T) { start = now; Time--; New(); if (Time <= 0) return; } }while (true); } /****************主函數(shù)******************/ int APIENTRY WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nCmdShow) { try { // 加載素材 load(); } catch (int) { ofstream fout("存檔.dat"); fout < 感謝各位的閱讀!關于“C語言如何實現(xiàn)對對碰游戲”這篇文章就分享到這里了,希望以上內(nèi)容可以對大家有一定的幫助,讓大家可以學到更多知識,如果覺得文章不錯,可以把它分享出去讓更多的人看到吧!
標題名稱:C語言如何實現(xiàn)對對碰游戲
瀏覽地址:http://weahome.cn/article/pdojsd.html