首页下载资源操作系统c语言扫雷项目制作压缩包

ZIPc语言扫雷项目制作压缩包

zyh159108756632.49MB需要积分:1

资源文件列表:

扫雷.zip 大约有53个文件
  1. 扫雷/
  2. 扫雷/.vs/
  3. 扫雷/.vs/扫雷/
  4. 扫雷/.vs/扫雷/FileContentIndex/
  5. 扫雷/.vs/扫雷/FileContentIndex/236c5e4a-9527-4b77-9626-ec7338ba43e1.vsidx 7.76KB
  6. 扫雷/.vs/扫雷/FileContentIndex/57e9b46d-5a49-4435-ac6f-d438abf8ac8c.vsidx 3.29KB
  7. 扫雷/.vs/扫雷/FileContentIndex/8911410b-b2fd-437d-a9e2-f876cc745eec.vsidx 1.37KB
  8. 扫雷/.vs/扫雷/FileContentIndex/aac0f082-2dd0-4e9d-bbe7-1bf3889143f1.vsidx 107B
  9. 扫雷/.vs/扫雷/FileContentIndex/c7fd2ac7-cf29-4942-84ea-27da0fdb46b5.vsidx 3.39KB
  10. 扫雷/.vs/扫雷/v17/
  11. 扫雷/.vs/扫雷/v17/.suo 35KB
  12. 扫雷/.vs/扫雷/v17/Browse.VC.db 1.76MB
  13. 扫雷/.vs/扫雷/v17/DocumentLayout.json 3.69KB
  14. 扫雷/.vs/扫雷/v17/ipch/
  15. 扫雷/.vs/扫雷/v17/ipch/AutoPCH/
  16. 扫雷/.vs/扫雷/v17/ipch/AutoPCH/b9a0c35767622861/
  17. 扫雷/.vs/扫雷/v17/ipch/AutoPCH/c7778ed8f62c7297/
  18. 扫雷/.vs/扫雷/v17/ipch/AutoPCH/c7778ed8f62c7297/TEXT.ipch 4.06MB
  19. 扫雷/.vs/扫雷/v17/ipch/AutoPCH/e71f390e949f16f/
  20. 扫雷/.vs/扫雷/v17/ipch/AutoPCH/e71f390e949f16f/GAME.ipch 3.56MB
  21. 扫雷/.vs/扫雷/v17/ipch/AutoPCH/e71fc90e94a00ba/
  22. 扫雷/.vs/扫雷/v17/ipch/AutoPCH/e71fc90e94a00ba/GAME.ipch 4.06MB
  23. 扫雷/game.c 2.4KB
  24. 扫雷/game.h 198B
  25. 扫雷/text.c 1.44KB
  26. 扫雷/x64/
  27. 扫雷/x64/Debug/
  28. 扫雷/x64/Debug/扫雷.exe 65KB
  29. 扫雷/x64/Debug/扫雷.pdb 1.26MB
  30. 扫雷/扫雷/
  31. 扫雷/扫雷.sln 1.4KB
  32. 扫雷/扫雷.vcxproj 6.57KB
  33. 扫雷/扫雷.vcxproj.filters 1.14KB
  34. 扫雷/扫雷.vcxproj.user 168B
  35. 扫雷/扫雷/x64/
  36. 扫雷/扫雷/x64/Debug/
  37. 扫雷/扫雷/x64/Debug/game.obj 20.92KB
  38. 扫雷/扫雷/x64/Debug/text.obj 19.81KB
  39. 扫雷/扫雷/x64/Debug/vc143.idb 51KB
  40. 扫雷/扫雷/x64/Debug/vc143.pdb 76KB
  41. 扫雷/扫雷/x64/Debug/扫雷.exe.recipe 316B
  42. 扫雷/扫雷/x64/Debug/扫雷.ilk 2.19MB
  43. 扫雷/扫雷/x64/Debug/扫雷.log 235B
  44. 扫雷/扫雷/x64/Debug/扫雷.tlog/
  45. 扫雷/扫雷/x64/Debug/扫雷.tlog/CL.command.1.tlog 1.37KB
  46. 扫雷/扫雷/x64/Debug/扫雷.tlog/Cl.items.tlog 280B
  47. 扫雷/扫雷/x64/Debug/扫雷.tlog/CL.read.1.tlog 6.51KB
  48. 扫雷/扫雷/x64/Debug/扫雷.tlog/CL.write.1.tlog 1.49KB
  49. 扫雷/扫雷/x64/Debug/扫雷.tlog/link.command.1.tlog 1.33KB
  50. 扫雷/扫雷/x64/Debug/扫雷.tlog/link.read.1.tlog 3.26KB
  51. 扫雷/扫雷/x64/Debug/扫雷.tlog/link.secondary.1.tlog 242B
  52. 扫雷/扫雷/x64/Debug/扫雷.tlog/link.write.1.tlog 446B
  53. 扫雷/扫雷/x64/Debug/扫雷.tlog/扫雷.lastbuildstate 182B

资源介绍:

c语言扫雷项目制作压缩包
#include"game.h" void menu() { printf("**********************\n"); printf("****** 1.start *****\n"); printf("****** 0.exit *****\n"); printf("**********************\n"); } void build_dilei(char d[henghang][zonglie], int a, int b, char e) { int f, g; for (f = 0; f < b; f++) { for (g = 0; g < a; g++) { d[g][f] = e; } } } void print(char d[henghang][zonglie], int a, int b) { int f, g, h; printf("--------扫雷--------\n"); for (h = 0; h < b+1; h++) { printf("%d ", h); } printf("\n"); h = 1; for (f = 1; f < a+1; f++) { printf("%d ", h); h++; for (g = 1; g < b+1; g++) { printf("%c ", d[g][f]); } printf("\n"); } printf("--------扫雷--------\n"); } void mailei(char d[henghang][zonglie], int a, int b) { int lei, x, y; for (lei = 10; lei;) { x = rand() % 9 + 1; y = rand() % 9 + 1; if (d[x][y] != '1') { d[x][y] = '1'; lei--; } } } int serch(char d[henghang][zonglie], int a, int b, int e, int h) { int f, g; int c = 0; for (f = h-1; f <= h + 1; f++) { for (g = e-1; g <= e + 1; g++) { if (d[g][f] == '1') { c ++ ; } } } return c; } void combine(char d[henghang][zonglie], char c[henghang][zonglie], int a, int b, int e, int h) { int f, g, j, i; for (f = h - 1; f <= h + 1; f++) { for (g = e - 1; g <= e + 1; g++) { int k = 0; for (j = f - 1; j <= f + 1; j++) { for (i = g - 1; i <= g + 1; i++) { if (c[i][j] == '1') { k++; } } } if (k== 0) { d[g][f] = '0'; } } } } int count(char d[henghang][zonglie], int a, int b) { int f, g, h; h = 0; for (f = 1; f < a + 1; f++) { for (g = 1; g < b + 1; g++) { if (d[g][f] == '*') h++; } } if (h == 10) return 1; return 0; } void see(char d[henghang][zonglie], char c[henghang][zonglie], int a, int b) { int f, g, j,i,m,n; for (f = 1; f < a + 1; f++) { for (g = 1; g < b + 1; g++) { if (d[g][f] == '0') { for (j = f - 1; j <= f + 1; j++) { for (i = g - 1; i <= g + 1; i++) { int l = 0; for (m = j - 1; m <= j + 1; m++) { for (n = i - 1; n <= i + 1; n++) { if (c[n][m] == '1') { l++; } } } d[i][j] = (int)48 + l; } } } } } }
100+评论
captcha