登录
首页 » Visual C++ » MyMFC

MyMFC

于 2011-04-02 发布 文件大小:1913KB
0 369
下载积分: 1 下载次数: 0

代码说明:

说明:  在视图区画正弦函数曲线,并且在一个菜单下以对话框形式输入正弦图的起点和终点坐标。(In the view area sine curve drawing, and in the form of a menu in the dialog box enter the start and end the sine map coordinates.)

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

发表评论

0 个回复

  • Addressbook-
    通讯录管理系统,能够实现人员的信息录入、查询、修改、删除、保存、显示等操作(Address book management system, personnel information entry, query, modify, delete, save, display operations)
    2012-12-19 13:51:57下载
    积分:1
  • The-fireworks-display
    一个可以在自己的电脑屏幕上生成烟花的小程序,可以烟花没有设计成圆的(One can generate fireworks on their computer screen applet, you can not designed to circle fireworks)
    2014-02-25 17:31:18下载
    积分:1
  • XZB
    vb做的写字板小程序,对于初学VB的学生有一定用处。(WordPad applet vb do have some use for the beginner VB students.)
    2012-11-26 15:59:44下载
    积分:1
  • STSFX.
    计算机移动设备的管理,开启,禁用USB设备、U盘、软驱、光驱(Computer, mobile device management, open, disable the USB device, U disk, floppy, CD-ROM)
    2020-07-30 15:38:37下载
    积分:1
  • vector
    说明:  用c语言实现电机仿真-基于恒定磁链的转子磁链控制。(Using c language realize electrical simulation- based on a constant flux of the rotor flux control.)
    2008-09-22 16:00:20下载
    积分: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
  • RevSubStr
    长度为N(N很大)的字符串,求最长回文串(Length N (N large) strings, find the longest palindrome string)
    2013-09-29 11:52:47下载
    积分:1
  • 74_videocap
    VB简单的影音采集程序,有需要的就下载吧。(VB simple video capture program, there is a need to download it.)
    2013-08-17 10:16:53下载
    积分:1
  • sy7
    一些简单的小例子,书上的例题代码,简单易懂,谢谢(Some simple examples, the book s example code, easy to understand, thank you)
    2013-10-19 11:00:18下载
    积分: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今日下载