C语言简易版flappy bird小游戏

小编 2026-06-05 阅读:1161 评论:0
假期在家无聊,想随便码点东西,故有此简陋的小游戏诞生。觉着可能对初学C语言的小伙伴练习有点帮助,故写此博客。游戏界面如下: 首先,先画出整个小游戏实现的流程图,如下: 思路很简单,整个游戏界面...

假期在家无聊,想随便码点东西,故有此简陋的小游戏诞生。觉着可能对初学C语言的小伙伴练习有点帮助,故写此博客。游戏界面如下:

\"\"

首先,先画出整个小游戏实现的流程图,如下:

\"\"

思路很简单,整个游戏界面是由一个大的char类型数组构成,更新数组的值然后不停的打印出来就形成了动态效果。

由上图看,大循环是保证游戏一直不断的进行下去,小循环是让小鸟的速度大于游戏界面里背景(由#构成的柱子)的速度(小鸟动四下柱子才动一下)。

下面是具体代码(水平有限大家多多见谅,但是效果还是有的!)

Bird.c文件

#include <stdio.h>
#include <windows.h>
#include \"Interface.h\"

int main(void)
{
 InitialInterface();
 for(;;)
 { 
  newinterface();
  scoring();//过一个柱子计一次分,所以和柱子更新速度一致
  for (int i = 0; i < 4; i++)//小鸟的速度是柱子的4倍
  {
   birdmove();
   draw();
   Sleep(50);
  } 
 }
 return 0;
}

Interface.h文件

#ifndef INTERFACE_H
#define INTERFACE_H

#define M 20
#define N 36

void InitialInterface(void);
void newinterface(void);
void birdmove(void);
void scoring(void);
void draw(void);

#endif

Interface.c文件

#include <stdio.h>
#include <stdlib.h>
#include<conio.h>
#include \"interface.h\"


char interf[M][N] = {{ 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,32,32 },
     { 32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,32,32 },
     { 38,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32 },
     { 32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 },
     { 32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35,32,32,32,32,32,32,32,32,32,32,35,35 }, };
//初始界面矩阵,ASCII码中“ ”是32,“&”是38表示小鸟,“#”是35用来画柱子

int num = 0;//用于计数输出并排两列黑柱子同一位置
int black;//黑方块位置
int p= M/2 ;//小鸟初始位置
int score = 0;//分数

/*初始化界面*/
void InitialInterface(void)
{
  printf(\"\\n   作者:xhyang,博客地址:http://blog.csdn.net/weixin_39449570\\n\");
  printf(\"   按\\\"w\\\"使小鸟跳起来,别落地,顺利穿过尽可能多的柱子!\\n\");
  for (int i = 0; i < M; i++)
  {
   printf(\"   \");
   for (int j = 0; j < N; j++)
   {
    printf(\"%c\", interf[i][j]);
   }
   printf(\"\\n\");
  }
}


/*更新界面各个柱子*/
void newinterface(void)
{

 if (interf[0][1] == 35 && num==0)//当矩阵第二列为黑色方块时,计算出下一次黑柱子上半部分的位置
 { 
  black = 5 + rand() % 5;
  num = 2;//黑柱子是两列#组成,第二列与第一列位置一样,用num保证两列位置一致
 }
 for (int i = 0; i < M; i++)
 {

  for (int j = 0; j < N - 1; j++)
  {
   interf[i][j] = interf[i][j + 1];
  }
  if (interf[0][0] == 35 && (i < black || i>(black + 5)))//此时上面的第二列变成了第一列,更新下一个黑柱子,有了黑柱子上半部分位置+5即是下半部分的起始位置
  {
   interf[i][N-1] = 35;
  }
  else
  {
   interf[i][N-1] = 32;
  }
 }
 if (num > 0)
  num--;
}


/*更新小鸟位置*/
void birdmove(void)
{
 for (int a = 0; a < 3; a++)
 {
  if (a == 2 && p > 0)//减缓鸟的速度,使按键上跳速度是下落的4倍
  {
   p = p + 1;
  }
  if (_kbhit())
  {
   if (_getch() == \'w\' || _getch() == \'W\')
   {
    p = p - 3;
   }
  }
 }
}

/*计分*/
void scoring(void)
{
 if (p > 20 || interf[p][0] == 35)
 {
  system(\"cls\");
  printf(\"\\n\\n   游戏结束!\\n\\n\");
  printf(\"   最终得分:%d\\n\\n\\n\", score);
  system(\"pause\");
 }

 if (interf[0][0] == 35 && interf[0][1] == 32 )
  score++;
}

/*重画界面*/
void draw(void)
{
 system(\"cls\");
 printf(\"\\n   作者:xhyang,博客地址:http://blog.csdn.net/weixin_39449570\\n\");
 printf(\"   按\\\"w\\\"使小鸟跳起来,别落地,顺利穿过尽可能多的柱子!\\n\");
 for (int i = 0; i < M; i++)
 {
  printf(\"   \");
  for (int j = 0; j < N; j++)
  {
   if (i == p && j == 0 && interf[p][0] != 35)
    printf(\"%c\", 38);
   else
    printf(\"%c\", interf[i][j]);
  }
  printf(\"\\n\");

 }
 printf(\"   得分:%d \\n\", score);
}

以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持脚本之家。

版权声明

本文仅代表作者观点,不代表百度立场。
本文系作者授权百度百家发表,未经许可,不得转载。

热门文章
  • 机房智能化温湿度解决方式之POE供电以太网温湿度传感器

    机房智能化温湿度解决方式之POE供电以太网温湿度传感器
    机房智能化温湿度解决方式之POE供电以太网温湿度传感器 北京盈创力和电子科技有限公司 智能型TCP网口温湿度记录仪 北京IP网络温湿度记录仪厂家,北京盈创力和 北京智能型TCP网口温湿度记录仪IP网络温湿度记录仪是一种新型的基于TCP/IP协议双绞线以太网标准温湿度采集模块,利用它可以实现现场温度值、相对湿度值的采集,同时利用其自身的RJ45通信接口可以方便地和机房监控主机或交换机集线器进行联网。 工作于-40℃~85℃工业级带...
  • Sequential Monte Carlo Methods (SMC) 序列蒙特卡洛/粒子滤波/Bootstrap Filtering

    Sequential Monte Carlo Methods (SMC) 序列蒙特卡洛/粒子滤波/Bootstrap Filtering
    Problem Statement 我们考虑一个具有马尔可夫性质、非线性、非高斯的状态空间模型(State Space Model):对于一个时间序列上的观测结果{yt,t∈N}\\{ y_t , t \\in N \\}{yt​,t∈N},我们认为每个观测结果yty_tyt​的生成依赖于一个无法直接观察的隐变量xt∈{xt,t∈N}x_t \\in \\{x_t , t \\in N \\}xt​∈{xt​,t∈N},即:p(...
  • HTTP状态保持的原理

    HTTP状态保持的原理
    a)在用户登录之后,浏览器返回响应的时候会在响应中添加上cookieb)浏览器接收到cookie之后会自动保存c)当用户再次请求同一服务器中的其他网页的时候,浏览器会自动带上之前保存的cookied)服务接收到请求之后可以请 request 对象中取到cookie 判断当前用户是否登录  Http是无状态的,就是连接时数据互通,关闭后...
  • Hive 系统函数及示例

    Hive 系统函数及示例
    查看所有系统函数 show functions; 函数分类 内置函数【系统函数】 数学函数: floor、round、ceil、cos、log2等 字符串函数: length、reverse、trim、lower、get_json_object、repeat等 收集函数: size 转换函数: cast 日期函数: year、month、datediff、date、date_add等 条件函数: coalesce、case…w...
  • CSRF的原理和防范措施

    CSRF的原理和防范措施
    a)攻击原理:i.用户C访问正常网站A时进行登录,浏览器保存A的cookieii.用户C再访问攻击网站B,网站B上有某个隐藏的链接或者图片标签会自动请求网站A的URL地址,例如表单提交,传指定的参数iii.而攻击网站B在访问网站A的时候,浏览器会自动带上网站A的cookieiv.所以网站A在接收到请求之后可判断当前用户是登录状态,所以...
标签列表