登录
首页 » C++ Builder » xrigger-tnteger-setter

xrigger-tnteger-setter

于 2018-12-25 发布
0 268
下载积分: 1 下载次数: 0

代码说明:

说明:  4 20 LCD source code text

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

发表评论

0 个回复

  • Chang_display
    改变屏幕分辨率,程序控制动态改变屏幕的分辨率。(change the screen resolution, dynamic programmed to change the screen resolution.)
    2006-07-06 09:28:09下载
    积分:1
  • BtnDownUp
    button按下后,edit控件内容连续变化,button抬起后edit内容停止变化。自己做的例子,只以int数据为例。(button is pressed, edit control content changes continuously, button lift stops changing after edit content. Own example, an int data as an example only.)
    2013-08-24 11:42:31下载
    积分:1
  • XIANXING
    线性表的建立与基本运算1.采用表尾挂入法建立一个以la为头的单链表2.采用表首插入法建立一个yilb为头指针的单链表3.就地逆转以lb为头指针的单链表。 还有矩阵的链式存贮及运算。以一个c函数创建任一稀疏矩阵的十字链表。以一个c函数从十字链表的头指针起按行序及三元组形式输出十字链表中各节点的值
    2009-06-17 12:49:15下载
    积分:1
  • 1000
    用VC编的一个计算器,有界面,适合研究生VC编程初期学习使用(VC series a calculator interface, suitable for graduate student VC program initially learning to use)
    2012-03-05 22:51:45下载
    积分:1
  • ch1
    实现一个可编程表达式的计算器,并判断输入的表达式是否正确。(Expression of the realization of a programmable calculator, and determine the expression entered is correct.)
    2009-05-25 18:50:16下载
    积分:1
  • WordCounting
    读取一个文本文件(英文,ASCII编码),对出现的单词次数进行统计,并按照出现次数从低到高排序,输出到一个文本文件中(每行一个单词信息,格式:单词 出现次数)。采用二叉树结构存储,中序遍历,快速排序。(Reads a text file (English, ASCII encoding), the number of occurrences of the word statistics, and in accordance with the number of occurrences of the sort low to high, output to a text file (one word per line message format: word occurrences). Binary tree structure stored in preorder, quick sort.)
    2021-03-14 10:29:23下载
    积分:1
  • vc914534534524
    完成键盘的各种等功能 完成键盘的各种等功能(Completed a variety of features such as a keyboard to complete a variety of features such as keyboard)
    2007-12-30 13:39:23下载
    积分:1
  • monkeyking
    猴子选大王,一个十分有趣的小型程序,判断谁是大王(Elected king of monkeys, a very interesting small-scale process to determine who is the king)
    2008-05-08 21:25:54下载
    积分: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
  • 红-工具
    说明:  红绿蓝小工具,截屏录屏取色的工具,如果你需要它就赶紧下载吧(Red green blue gadget, a tool for screen capture and color selection)
    2019-11-06 23:43:07下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载