测量程序

11.13 VC2003 编译 如何获得网上邻居(11.13 How to get the Network Neighborhood)

SD程序基于STM32，底层的驱动程序已被写入，并有notes.it值得初级开发者学习。(SD program based on STM32, the underlying driver has been written, and there is a notes.it worthy of the primary developers to learn.)

可直接在Linux下编译，同时支持Windows下完成，亲测可用(It can be compiled directly under Linux and supported under Windows. It is available for personal testing.)

一个基于MFC的多文档(MDI)程序编辑器的雏形框架，具有窗口分割、系统文件目录树形对话框、标签页view、代码编辑保存、语法高亮显示及查找、设置书签等系列基本功能，可以任意进行二次开发。(An MFC-based multi-document (MDI) program editor prototype frame having a separate window, the system file directory tree dialog tab view, code editing and saving, syntax highlighting and find, set bookmarks, and other basic functions, can be arbitrarily for secondary development.)

计算机图形学中最基本的翼边结构，本小程序采用vc实现了此中结构。(Computer Graphics basic winged edge structure, the small program using vc There is a realization of the structure.)

isp 相机底层驱动程序，适配多款sensor(ips bottom)

说明：  c语言课件，适合大一上学期c语言初学者使用。visualc++ 6.0软件环境下运行，c语言为编译语言(c language courseware for freshman last semester c language for beginners. visualc++ 6.0 software operating environment, c language is a compiled language)

poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)

LINQDEMO,帮助理解LINQ,LINQDEMO,帮助理解LINQ,(LINQDEMO, to help understand LINQ)

这是visual c ++ 下分割视图的好代码(this is splitterwnd code)