登录
首页 » Visual C++ » canvas

canvas

于 2012-04-21 发布 文件大小:22859KB
0 357
下载积分: 1 下载次数: 5

代码说明:

  两个小船在移动的代码,主要是计时器的使用,利用回调函数显示动画(The two boats in the mobile code, the use of the timer, the use of a callback function to display the animation)

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

发表评论

0 个回复

  • table
    一个桌子,可以对其进行移动旋转,并可设置长宽高。(A table, you can move the rotation, and can set the length and breadth.)
    2012-05-23 20:51:32下载
    积分:1
  • cifafenxi
    用于启动界面的制作,以及对于词法的分析,很实用的东西(Interface used to start production, as well as for lexical analysis, a very practical things)
    2008-08-11 17:19:25下载
    积分:1
  • ssks
    一个简单的四则运算考核小程序,采用VB开发。(A simple arithmetic evaluation applet development using VB.)
    2010-07-01 08:37:06下载
    积分:1
  • 73554574
    VB语音报数计算器源程序,有需要的就下载吧。(Talking Calculator VB source code, there is a need to download it.)
    2013-08-04 15:26:48下载
    积分:1
  • sy7
    一些简单的小例子,书上的例题代码,简单易懂,谢谢(Some simple examples, the book s example code, easy to understand, thank you)
    2013-10-19 11:00:18下载
    积分:1
  • XHUE
    我们在使用金山词霸时发现,在金山词霸已经运行了的情况下(When using powerword, we found that in the case of powerword has been running for)
    2017-06-25 06:06:14下载
    积分:1
  • CLOCK
    钟面上的时针和分针之间的夹角总是在 0 ~180之间 ( 包括 0 和180 ) 。举例来说,在十二点的时候两针之间的夹角为 0 ,而在六点的时候夹角为180 ,在三点的时候为90 。本题要解决的是计算 12:00 到 11:59 之间任意一个时间的夹角。(The angle between the hour and minute hands of the clock face is always between 0 to 180 (including 0 and 180). For example, twelve o' clock, when the angle between the two pin 0, in the six o' clock when the angle is 180, three points for 90. This question must be resolved are the angle of the calculation of 12:00 to 11:59 any one time.)
    2011-06-28 13:14:11下载
    积分:1
  • wenjiankunbanqi
    这是VC++实现的一个文件捆绑软件的源码(This is a file bundled software source code VC++ achieve)
    2012-07-12 06:07:40下载
    积分:1
  • TelBook
    能实现添加,删除,查找,拨号等基本功能。当然还用到了windows皮肤,很漂亮的哟(Able to add, delete, search, dial-up and other basic functions. Of course, also used the windows skin, very beautiful yo)
    2013-07-21 07:27:35下载
    积分:1
  • closest_pair
    分治法思想,求最邻近点对,考虑将所给的n个点的集合S分成2个子集S1和S2,每个子集中约有n/2个点,然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)
    2013-12-07 16:46:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载