-
在这部分中提供了由谭浩强编著的《C++面向对象程序程序设计》(清华大学出版社出版)一书中各章的全部习题的参考解答。...
在这部分中提供了由谭浩强编著的《C++面向对象程序程序设计》(清华大学出版社出版)一书中各章的全部习题的参考解答。-In this section provided by the authoring Hao Qiang
- 2022-04-01 01:33:56下载
- 积分：1
-
基于QT的聊天室程序
QT网络聊天室账号注册登录；公共聊天室，一对一聊天；在线人数显示，在线人员列表；上下线提示。
- 2022-09-13 18:35:03下载
- 积分：1
-
hai have this signal processing code
hai have this signal processing code
- 2022-06-29 06:04:23下载
- 积分：1
-
xgjgvkugikgjhfhjgvmvnhcvmb，
aacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkaacvbdghjkv
- 2023-03-19 17:40:04下载
- 积分：1
-
网络对战版象棋，用vc开发，可继续进行移植至linux,嵌入式下
网络对战版象棋，用vc开发，可继续进行移植至linux,嵌入式下-Network version of chess against using vc development, can continue to transplant to linux, embedded under the
- 2022-01-25 15:44:24下载
- 积分：1
-
prepared by the small alarm clock procedures
一个用C++编写的小闹钟程序-prepared by the small alarm clock procedures
- 2022-08-24 09:09:39下载
- 积分：1
-
用vc++实现与usb通信
用vc++实现usb与设备通信，一个不错的入门资料，分享给大家，共同学习。
有想与usb通信的同学值得入手。c++源码。。。。。。。。。。。。。。。。。。。。。。。。
- 2022-12-22 20:05:03下载
- 积分：1
-
俄罗斯方块c代码，好玩简单，易懂，快快快快看
俄罗斯方块c代码，好玩简单，易懂，快快快快看-program
- 2022-05-09 10:38:28下载
- 积分：1
-
for：
Root of a Polynomial
for：
Root of a Polynomial
--- --- --- --- --
Time Limit: 1 Second Memory Limit: 32768 KB
--------------------------------------------------------------------------------
A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval.
Format of function
double Polynomial_Root(int n, double c[], double a, double b, double EPS)
where int n is the degree of the polynomial double c[] is an array of n +1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root.
The function must return the root.
Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0. -for: Root of a Polynomial---------------------- Time Limit: 1 Second Memory Limit: 32768 KB-------------------------------------------------------------------------------- A polynomi
- 2022-09-28 19:15:03下载
- 积分：1
-
这是一个实现方法的算法。
This is an implementation of prims algorithm.
- 2022-01-26 03:11:13下载
- 积分：1
|
联系客服（QQ：3324461878）
