登录
首页 » 其他项目 » use of a Turbo C sheet prepared by the Russian game, the graphics library is Gra...

use of a Turbo C sheet prepared by the Russian game, the graphics library is Gra...

于 2022-01-25 发布 文件大小:652.69 kB
0 266
下载积分: 2 下载次数: 1

代码说明:

一个使用Turbo C编写的俄罗斯方块的游戏,使用的图形库是TC自带的Graphics图形库。内附详细开发文档、开发日志和使用说明。-use of a Turbo C sheet prepared by the Russian game, the graphics library is Graphics TC onboard graphics library. Contains detailed documentation, log and use.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • restoring除法器设计 经典算法了,可以仿真通过
    restoring除法器设计 经典算法了,可以仿真通过-divider restoring a classical algorithm design, simulation can be adopted
    2023-01-21 00:50:03下载
    积分:1
  • 用于电表RS485抄表,可进行标识自行调试,方便实用,
    用于电表RS485抄表,可进行标识自行调试,方便实用,-RS485 meter for meter reading, it can conduct its own logo debugging, convenient and practical,
    2022-03-19 14:11:24下载
    积分:1
  • 解压后 每个.cpp都有中文名很清楚。我是初学者,都是我的作业。会不断添加。...
    解压后 每个.cpp都有中文名很清楚。我是初学者,都是我的作业。会不断添加。- After the decompression each cpp all has Chinese name to be very clear. I am a beginner, all is my work. Can unceasingly increase.
    2022-03-19 11:57:16下载
    积分:1
  • 基于自适应遗传算法的电液弯辊模糊控制系统 很不错的文章 对自适应遗传算法模糊控制进行的详细的分析...
    基于自适应遗传算法的电液弯辊模糊控制系统 很不错的文章 对自适应遗传算法模糊控制进行的详细的分析-Based on adaptive genetic algorithm fuzzy bending electro-hydraulic control system is very good article on adaptive genetic algorithm for fuzzy control of a detailed analysis of
    2022-05-28 10:10:43下载
    积分:1
  • 一个VC++的课程设计,主要内容是运动在动态圆上的五角星。
    一个VC++的课程设计,主要内容是运动在动态圆上的五角星。-a curriculum design, and main contents of the circular movement of the dynamic on the five-pointed star.
    2022-01-30 18:55:19下载
    积分:1
  • 程序的: 输入一个任意大小的迷宫,用栈求出一条走出迷宫的路径,并 显示在屏幕上。 程序实现: 可以实现载入迷宫和保存迷宫,附带文件中有4个测试迷宫路径的 文件...
    程序目的: 输入一个任意大小的迷宫,用栈求出一条走出迷宫的路径,并 显示在屏幕上。 程序实现: 可以实现载入迷宫和保存迷宫,附带文件中有4个测试迷宫路径的 文件test1~4.dd。请将这些文件拷贝到TC当前目录下,或者在载 入时写明完全路径。由于屏幕大小的限制,当用户自己输入迷宫 时一定要注意:迷宫大小是有限制的,不小于4*3,不大于30*20。 否则会出现错误信息。输入开始时全是墙,用上下左右键移动, 用Del键删除墙,形成通路,用Enter键添加墙。输入结束时可以 将迷宫保存下来,以dd为扩展名。输入完毕时用F9键来得到结果, 找到路径时,屏幕下方会出现Path found,否则出现Path not found。 程序经Turbo C 2.0编译调试成功。运行时不用添加任何运行库。 不可以在VC上编译。-procedures purpose : to bring in a maze of arbitrary size, with a stack get out of the maze of trails and on the screen. Program : can achieve and preserve the printed maze maze, the accompanying documents were four test maze of trails to document test1 4.dd. I would be grateful if those files are copied to the TC current directory, or in the state when fully contained path. Due to restrictions on the size of the screen when the user input labyrinth must pay attention to : the size of the maze is a restriction, not less than 4* 3, not more than 30* 20. Otherwise there will be a wrong message. At the beginning of the importation of a
    2022-08-06 12:51:19下载
    积分:1
  • Delphi编写的一个支持语法高亮显示和很多语言的文本编辑器
    Delphi编写的一个支持语法高亮显示和很多语言的文本编辑器-Delphi support of a syntax highlighter and many language text editor
    2022-01-22 03:08:49下载
    积分:1
  • all the game of (kill boats) there are 7 parts, because I did this game with l...
    all the game of (kill boats) there are 7 parts, because I did this game with long time :D
    2022-09-14 17:40:04下载
    积分:1
  • 页面置换算法 包括fifo 先进现出,最近最早未使用,lru算法
    页面置换算法 包括fifo 先进现出,最近最早未使用,lru算法-Fifo page replacement algorithm, including advanced show, the first unused recently, lru algorithm
    2022-07-22 06:41:50下载
    积分:1
  • Find prime numbers prepared by screening the function: void sieve (bool isPrime...
    编写筛选查找素数函数: void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组,n为数组大小。由于2是第一个素数, 所以设置isPrime[0]和isPrime[1]的值为false,并设置其余的元素初值为true。 然后对从4到n-1的每一个i,判断i是否能够被2整除,如果i能够被2整除,则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理,当操作结束时,所有值为true的isPrime[i]所对应的i就是素数,它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.
    2023-03-02 04:45:03下载
    积分:1
  • 696518资源总数
  • 106164会员总数
  • 18今日下载