登录
首页 » Visual C++ » ggg

ggg

于 2012-08-22 发布 文件大小:2372KB
0 249
下载积分: 1 下载次数: 8

代码说明:

  mfc 连接数据库 用mfc做的管理系统,戏中包括数据库连接(mfc connect to the database)

文件列表:

ggg
...\ADO.cpp,2720,2012-08-22
...\ADO.h,818,2012-08-22
...\Debug
...\.....\ADO.obj,61263,2012-08-22
...\.....\ggg.exe,118821,2012-08-22
...\.....\ggg.ilk,285432,2012-08-22
...\.....\ggg.obj,13661,2012-08-22
...\.....\ggg.pch,6939488,2012-08-22
...\.....\ggg.pdb,582656,2012-08-22
...\.....\ggg.res,2680,2012-08-22
...\.....\msado15.tlh,221974,2012-06-06
...\.....\msado15.tli,167277,2012-06-06
...\.....\pig.ldb,64,2012-08-22
...\.....\pig.mdb,139264,2012-08-22
...\.....\StdAfx.obj,132666,2012-08-22
...\.....\vc60.idb,238592,2012-08-22
...\.....\vc60.pdb,577536,2012-08-22
...\ggg.aps,20660,2012-08-22
...\ggg.clw,1252,2012-08-22
...\ggg.cpp,2021,2012-08-22
...\ggg.dsp,4223,2012-08-22
...\ggg.dsw,512,2012-08-22
...\ggg.h,1291,2012-08-22
...\ggg.ncb,254976,2012-08-22
...\ggg.opt,49664,2012-08-22
...\ggg.plg,1043,2012-08-22
...\ggg.rc,5498,2012-08-22
...\gggDlg.cpp,4929,2012-08-22
...\gggDlg.h,1320,2012-08-22
...\msado15.tlh,221961,2012-06-06
...\msado15.tli,167270,2012-06-06
...\pig.ldb,64,2012-08-22
...\pig.mdb,151552,2012-08-22
...\ReadMe.txt,3525,2012-08-22
...\res

...\...\ggg.rc2,395,2012-08-22
...\resource.h,865,2012-08-22
...\StdAfx.cpp,205,2012-08-22
...\StdAfx.h,1180,2012-08-22

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

发表评论

0 个回复

  • arrangement
    假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。) 对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
    2014-10-22 11:00:45下载
    积分:1
  • communication
    VC简易通讯录,加强C的编程,熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)
    2012-09-02 17:11:12下载
    积分:1
  • 2-3Library
    大二时做的一个数据结构的课程设计,用2-3树实现的图书馆管理系统,只是控制台程序,没有很好的图形界面。包括管理员、读者。管理员功能有:采编入库、查看图书、查看读者、删除读者。读者功能有:借书、还书、预约、查找等等。。功能全面。包括注册账号,登录需要账号密码。(Sophomore to do a data structure of the curriculum design, with 2-3 tree implementation of library management system, but the console program, not a good graphical interface. Including administrators, readers. Administrator functions include: editing storage, check books, check readers, delete readers. Reader functions: library, book, booking, search and so on. . Full-featured. Including the registration account, login account password required. )
    2020-10-28 01:10:00下载
    积分:1
  • link
    实现链表的一些操作,方便进行遍历,查找等程序(Operation, convenient linked list traversal, the search procedure)
    2013-05-01 11:49:22下载
    积分:1
  • zuiyouerfenjiansuozhu
    最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
    2013-10-10 18:48:17下载
    积分:1
  • BiTree
    二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)
    2008-01-11 10:19:38下载
    积分:1
  • point
    用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
    2012-12-16 13:14:04下载
    积分:1
  • shujujiegoukechengshiji
    数据结构课程设计时,所需的封面及任务书版面,希望对大家有点用!(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)
    2008-06-16 18:38:51下载
    积分:1
  • carpub
    一个简单的停车场管理程序,是初级学习数据结构时的一个十分重要的实验,了解这个对学习堆栈十分有用,基本题目是 设有一个可以停放[size=10.5pt]N[size=10.5pt]辆汽车的狭长的停车场,[size=10.5pt] [size=10.5pt]它们有一个大门可以供车辆进出。车辆按到达停车场时间的先后次序从停车场最里面向门口处停放(最先到达的第一辆车停在停车场的最里面)。如果停车场已放满[size=10.5pt]N[size=10.5pt]辆车,则后来的车辆只能在停车场大门外的便道上等待,一旦停车场内有车开走,则排在便道上的第一辆车就可进入停车场。停车场内如果有某辆车要开走,在它之后进入停车场的车辆都必须先退出停车场为它让路,待其开出停车场后,这些车辆再依原来的次序进入。每辆车在离开停车场时,根据它在停车场内停留时间的长短交费。如果停在便道上的车辆未进入停车场就要离去,允许其离去时不收停车费,并且仍然保持在便道上等待的车辆的次序()
    2007-09-05 20:25:00下载
    积分:1
  • 20070320list
    包括链表的各项操作,添加、删除、修改等。还包括单项连标和双向链表。(including the operation, add, delete, revise. Also including individual targets and even two-way linked list.)
    2007-03-20 10:39:42下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载