-
java2tuxedo
JAVA 通过JNI 调用 TUXEDO服务的代码，由于时间关系，没有能继续把他实现，希望有心人把他搞定。(Java through JNI call TUXEDO service code, because of the time constraint, not continue to realize his hope to get him off.)
- 2007-04-05 11:34:41下载
- 积分：1
-
通过客户端和服务器的连接实现通话，数据查询，中英文对照查询...
通过客户端和服务器的连接实现通话，数据查询，中英文对照查询-Through the client and server connections realize calls, data inquiries, in bilingual query
- 2022-03-17 00:25:00下载
- 积分：1
-
MinixOS-Installation
Mininx installation
- 2015-05-11 17:17:06下载
- 积分：1
-
checkIsRemoteSession
此demo演示了如何判断当前windows用户是否是远程用户还是本地用户(This demo demonstrates how to determine whether the current windows user remote users or local users)
- 2016-04-24 15:13:39下载
- 积分：1
-
chunk
chunk for dynamic memory management
- 2013-12-06 17:57:12下载
- 积分：1
-
Formulaire_CS_Schengen-2
Chengen describe technique
- 2013-11-25 18:04:49下载
- 积分：1
-
simply-calculate
这是我在学VC++时做的一个简单的计算器,类似于windows的(This is my school VC when doing a simple calculator, similar to the windows)
- 2007-06-14 14:59:58下载
- 积分：1
-
765487777
UITableViewCell 视图扩展，精选ios编程学习源码，很好的参考资料。(The UITableViewCell view, select learning IOS programming source code, a good reference.)
- 2013-12-07 12:53:08下载
- 积分：1
-
UVALive4849
uvalive4849的ac源码。算法：2-sat。题意：给n（n<=3000）个黑方块的坐标，保证黑方块没有公共边。对于每个黑方块选一个角作为结点，使得所选结点满足输入的一个无向图。其中距离为曼哈顿距离。输出是否有解。possible或impossible。(AC source of uvalive 4849. Algorithms: 2-sat. Meaning of the questions: to n (n <= 3000) coordinates a black box, to ensure that there is no common edge black squares. For each black box to choose a corner as nodes, such that the selected nodes meet a directed graph with no input. Where the distance is the Manhattan distance. Output is solvable. possible or impossible.)
- 2015-01-25 21:27:51下载
- 积分：1
-
NJ
说明： 实验停车场管理，用C++，在VC++6.0下运行(Parking management experiment with C++, running under VC++6.0)
- 2014-01-05 22:57:20下载
- 积分：1
|
联系客服（QQ：3324461878）
