搜索资源列表
oocr_v2_07252004
- sdfa Open OCR (oocr) is a character recognition program used for automatic scanning of documents and forms. oocr is based on the idea of automatic form/document reading, which can create a batch process in recognizing areas of interest for forms or a
ccccccccccccccccccccc
- 《C语言程序设计教程(第二版)》-徐新华-案例源程序 《C语言程序设计教程(第二版)》-徐新华-案例源程序 -"C Programming Language Guide (2nd Edition)" - Xu Xin-source case "C Programming Language Guide (2nd Edition) "- Xu Xin-case source
InsideCSharp2ndEdition
- < Inside CSharp 2nd Edition> ,C#内幕,英文第二版,深入学习C#的可以看看.
InsideCSharp2ndEdition_src
- Archer, Tom Inside C# / Tom Archer, --2nd ed. 一书所带源代码。
CPlusPlus2nd
- C#高级编程第2版，练就c#高手不可多得的好书。-C# 2nd Edition， Simon Robinson；Burt Harvey
Pragmatic.Bookshelf.Pragmatic.Unit.Testing.in.C.S
- Pragmatic Bookshelf Pragmatic Unit Testing in C Sharp with NUnit 2nd Edition Aug 2007
Beginning_CSharp_2008
- Beginning C# 2008 From Novice to Professional (2nd Edition)
NetworkProgramming
- 此程序实现了服务器和客户端之间的通信，只需要简单修改IP，即能支持在广域网通信。服务端应用Socket，界面则用XAML构建，平台是net.framework 4.0.这个是网络编程的课程设计源代码。-This program implements the server and client communication between, simply modify the IP, that is able to support wide-area network communication. S
Thinking-in-CPP
- Thinking in C++, 2nd ed. Volume 1
CSharpInsideSrc2ndEd
- C#技術內幕源碼2nd版,C#重要學習資料-Inside C# source code 2nd Edition, C# major learning materials
cichuangti
- 磁性窗体演示，2号窗体可以随着1号窗体的移动而移动-The magnetic form shows on the 2nd form can be moved with the move of the form
examples-in-book-
- C#程序设计及应用教程（第2版）书上所有例题的代码程序，可直接运行，方便同学们学习研究书中的例题。-All examples of code in the C# programming and application tutorial (2nd edition) book program can be run directly facilitate students learning research in the book' s examples.
MyClockApp
- 该程序模拟实现电子石英钟的显示。电子石英钟是由两个方面构成，一是石英表部分，二是数字部分。它体现了GDI+图形库和时间事件激活。-This program realize the display of electric clock. It is combined with two parts: the 1st part is for the clock, the 2nd part is for the clock readings. It shows the GDI+graphic librar
little-bee
- 一只小蜜蜂在如下图所示的蜂窝上爬行。它爬行时，只能从一个格爬到相邻的大号格子中。例如，从 1 号格子可以爬到 2 号或者 3 号格子，从 2 号则可以爬到 3 号或者 4 号格子。 图 请问从一个格子 a 爬到一个格子 b 一共有多少种可行的路线。 输入： 分别是起始点 a 和终止点 b 的编号。（ a 和 b 在 1~100 之间，且 a<b 。） 输入： 用科学记数法表示的数据。即为符合C语言表示的科学记数法表示。