登录
首页 » Visual C++ » time

time

于 2009-01-05 发布 文件大小:5KB
0 448
下载积分: 1 下载次数: 3

代码说明:

  自己做的一个基于单片机的万年历的程序 用液晶显示(Own a calendar based on single-chip liquid crystal display using the procedures)

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

发表评论

0 个回复

  • 1
    计算一个整数的和的积德最大值,即最优整数的接的最大值(The Jide calculate an integer, and the maximum value, i.e. the optimal integer then the maximum)
    2013-05-17 00:15:26下载
    积分:1
  • MS_6
    这是C++Primer的书籍的源代码,包括课后习题的答案,是份很不错的代码,尤其针对初学者(This is the source code of C++Primer books, including after-school exercises, answers, were very good code, especially for beginners)
    2012-07-05 13:31:36下载
    积分:1
  • Thread3
    graph drower MFC with dynamic scaling y-axis
    2009-11-19 18:07:40下载
    积分:1
  • file_manage_system_VB
    一个兼具有excel一样的多文档功能,同时具有word的文档编辑和格式编辑功能(One and the same with excel multiple document features, but also has word document editing and formatting editing functions)
    2013-08-09 10:19:44下载
    积分:1
  • mm1
    implement mm1 queue system on customer process
    2012-05-06 15:20:35下载
    积分:1
  • VBgame
    一个用VB编写的抽奖软件,非常实用。很适合初学者看。(A lottery software written in VB, very practical. Very suitable for beginners to see.)
    2012-03-12 07:33:19下载
    积分:1
  • EXCEL_filedcheck
    检查EXCEL文档中某字段的重复值,打开文档,选择相应表格及字段(Check EXCEL document the value of a duplicate field, open the document, select the appropriate forms and fields)
    2010-08-03 11:05:39下载
    积分:1
  • vcdll
    VC++从DLL中获得资源的小实例源代码,从DLL中获得背景图像,可者是一个图标资源或是其它类型的文件,总之,学会了一种,就可以举一反三,灵活掌握了。(VC++ from the DLL resources, source code examples to get a background image from the DLL, can an icon resource, or other types of documents, in short, learned, you can learn by analogy, flexibility.)
    2012-05-19 02:34:41下载
    积分:1
  • caipiao
    用C实现的自己使用的双色球分析源码。自己一直在用,还是有一定的参考价值哦。(C achieved using two color analysis of their source. He has been in use, or have a certain reference value oh.)
    2013-07-26 16:49:53下载
    积分: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今日下载