登录
首页 » Visual C++ » WebS

WebS

于 2011-11-12 发布 文件大小:19KB
0 208
下载积分: 1 下载次数: 4

代码说明:

  Web站点架设。Package an Application for the Windows Web Application Gallery (Package an Application for the Windows Web Application Gallery )

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

发表评论

0 个回复

  • std4
    C++的课程设计,学生信息管理系统,控制台模式。演示了类的创建和使用,以及类的继承,文件的读写。(C++ in curriculum design, student information management system, the console mode. Demonstrated the creation and use of categories, as well as the type of inheritance, to read and write documents.)
    2009-06-13 11:32:55下载
    积分:1
  • nurbs
    关于nurbs曲线插补一个自由软件,希望有兴趣各位一起探讨(About the nurbs curve interpolation is a free software interest you to explore together)
    2012-08-31 11:30:26下载
    积分:1
  • UdpClient
    用Visual C++编写的UDP客户端程序。(Using Visual C++ Prepared UDP client program.)
    2007-07-17 10:16:03下载
    积分:1
  • ExocortexDSP_v1.2
    A C# open source library that provides fully featured (1) single and double precision complex number data types, (2) complex number math library, (3) 1D, 2D and 3D complex and real symmetric fast Fourier transforms, and (4) highly accurate statistical routines.
    2008-02-20 12:32:03下载
    积分:1
  • XTrace
    windows下很好的,计算时间的小工具。准确,使用方便。(windows under good, the computation time small tools. Accurate, and easy to use.)
    2006-11-20 21:06:36下载
    积分:1
  • LimitlessRemote
    手机无线控制电脑...............(my English is poor)
    2015-10-17 13:31:52下载
    积分:1
  • Boltzmann
    顶盖驱动流的格子Boltzmann模拟代(The top cover-driven to stream of the plaid Boltzmann simulation of on behalf of)
    2013-04-01 16:16:19下载
    积分:1
  • EULER1
    说明:  Euler 回路问题 .问题描述: 对于给定的图G 和G 中的2 个顶点v 和w,连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务: 对于给定的图G,编程计算图G 的一条Euler 回路。 .数据输入: 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m,表示给定的图G 有n 个 顶点和m 条边,顶点编号为1,2,…,n。接下来的m 行中,每行有2 个正整数u,v ,表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路,则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)
    2006-03-29 21:31:15下载
    积分:1
  • day
    openGl大作业,包含光源,移动物体,简易动画,纹理场,建筑等。(openGl large operations, including light, moving objects, simple animation, texture field, construction and so on.)
    2020-09-13 13:47:58下载
    积分:1
  • 23424RingggSDK-
    推荐一个界面库:RingSDK 相当漂亮的vc++ GUI库(Suggest an interface library: RingSDK pretty vc++ GUI library)
    2013-01-17 13:52:22下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载