- 博客(66)
- 收藏
- 关注
RSS订阅转载 试验三 数据的更新
实验三 数据的更新 一、实验目的 1．掌握基本表的Insert，Update，Delete操作 2．掌握视图的Insert，Update，Delete操作 二、实验环境（实验的软件、硬件环境） 硬件：PC机 软件：SQL2000 三、实验说明 请复习相关的SQL语句insert,update,delete语法知识点并完成如下内容。 四、实...
2014-03-25 21:33:00
604
转载 试验二 数据库及数据库对象的创建和管理
实验二 数据库及数据库对象的创建和管理 一、实验目的 1．掌握用企业管理器(Enterprise Manager)对数据库的完整创建、修改和删除 2．掌握用企业管理器(Enterprise Manager)对常见的数据库对象如表、试图、索引等的创建、修改和删除 3．掌握用SQL语句进行创建和管理数据库、表、试图和索引 二、实验环境（实验的软件、硬件环境） 硬件...
2014-03-25 21:32:00
839
转载 SQL 获取外键信息，索引信息
--获取某表的所有索引，包括索引归属列名sp_statistics 'corpinfo'--获取索引与索引归属列以及描述信息sp_helpindex 'corpinfo'--获取某表的约束信息以及归属列sp_helpconstraint 'corpinfo' 转载于:https://www.cnblogs.com/LOB104-zhanglei/articles/3624186.htm...
2014-03-25 21:30:00
284
转载 remove_if删除vector中的数据
Remove_if的等效操作 template < class ForwardIterator, class Predicate > ForwardIterator remove_if ( ForwardIterator first, ForwardIterator last, Predicate...
2013-12-26 00:57:00
236
转载 set,map集合容器
首先来看看set集合容器： set集合容器实现了红黑树的平衡二叉树数据结构，在插入元素时它会自动调整二叉树的排列，把该元素放到适当的位置，并且 保证左右子树平衡。平衡二叉检索树采用中序遍历算法。 对于set，vector，map等等，它们的前向迭代器定义是这样的(以set为例)： set<int>::iterator it; for(it=s.be...
2013-12-26 00:17:00
112
转载 C# yes 邮箱问题
已有如下代码，按要求增加功能： static void Main(string[ ] args) { string email; // 电子邮件地址 Console.WriteLine("请输入你的邮箱："); email = Console.ReadLine(); Console.WriteLine("你的邮箱是 ...
2013-11-18 23:36:00
371
转载 队列的应用：电路布线问题
题目源自于C++数据结构第二版课本 7*7的迷宫 实现代码如下： Position类： #pragma once #include<iostream> using namespace std; class Position { public: int row;//矩阵 行 int col;//矩阵 列 public: Position(...
2013-10-24 16:27:00
425
转载 POJ 3468 线段树
Description You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The othe...
2013-07-18 01:12:00
143
转载 poj 1401 数学问题 分析出数学公式就能简单的拿下
Description The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular pho...
2013-07-18 01:01:00
109
转载 HDU 4445 暴力 简单枚举
Crazy Tank Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2574Accepted Submission(s): 441 Problem Description Crazy Tank was...
2013-07-18 00:38:00
153
转载 UVA 567 求最短路问题
Risk Risk is a board game in which several opposing players attempt to conquer the world. The gameboard consists of a world map broken up into hypothetical countries. During a player's turn, a...
2013-07-17 23:53:00
147
转载 UVA 439 DFS
Knight Moves A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n s...
2013-07-17 23:41:00
130
转载 UVA 11292
#include<stdio.h> #include<stdlib.h> int Dragon[20001],Knights[20001]; int cmp(const void *a,const void *b){ return *(int *)a - *(int *)b; } int main () { in...
2013-07-17 23:33:00
104
转载 POJ 1243 简单dp
Description In the game show "The Price is Right", a number of players (typically 4) compete to get on stage by guessing the price of an item. The winner is the person whose guess is the clo...
2013-07-17 23:29:00
114
转载 UVA 113
Power of Cryptography Background Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers modulo functions of these primes. Work in this ...
2013-07-17 23:23:00
113
转载 UVA 442
Matrix Chain Multiplication Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in...
2013-07-17 13:34:00
116
转载 UVA 673 栈 括号匹配
Parentheses Balance You are given a string consisting of parentheses()and[]. A string of this type is said to becorrect: (a)if it is the empty string(b)if A and B are corre...
2013-07-17 12:28:00
109
转载 UVA 133 环形队列
The Dole Queue In a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on the following strategy. Every day all dole...
2013-07-17 11:34:00
123
转载 HDU 1170
Balloon Comes! Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16637Accepted Submission(s): 6073 Problem Description The contest s...
2013-07-16 03:00:00
113
转载 HDU 1108
最小公倍数 Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26570Accepted Submission(s): 14634 Problem Description 给定两个正整数，计算这两个数的最小公倍数。...
2013-07-16 02:07:00
114
转载 HDU 1829
A Bug's Life Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 364 Accepted Submission(s): 140 Problem Descr...
2013-07-16 01:55:00
79
转载 HDU 2057
A + B Again Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11594Accepted Submission(s): 5049 Problem Description There must be ma...
2013-07-15 00:43:00
121
转载 HDU 2078 水题啊
复习时间 Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3382Accepted Submission(s): 2543 Problem Description 为了能过个好年，xhd开始复习了，于是每天晚上背...
2013-07-15 00:38:00
95
转载 HDU 2611 深搜
Sequence two Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 98 Accepted Submission(s): 46 Problem Descript...
2013-07-15 00:29:00
138
转载 深搜与广搜的模板代码
DFS: /*该DFS框架以2D坐标范围为例，来体现DFS算法的实现思想。*/ #include<cstdio>#include<cstring>#include<cstdlib>using namespace std; const int maxn=100; bool vst[maxn][maxn]; // 访问标记 int map[...
2013-07-15 00:03:00
198
转载 HDU 2200 做个水题睡觉了
Eddy's AC难题 Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2922Accepted Submission(s): 1371 Problem Description Eddy是个ACMer,他不仅喜欢...
2013-07-14 03:12:00
92
转载 HDU 3047 并查集
Zjnu Stadium Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 859Accepted Submission(s): 347 Problem Description In 12th Zhejiang C...
2013-07-14 02:29:00
89
转载 POJ 1226 字符串处理
Substrings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9527 Accepted: 3272 Description You are given a number of case-sensitive strings of alphabeti...
2013-07-14 01:54:00
108
转载 HDU 2734 字符串处理
Quicksum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 447 Accepted Submission(s): 339 Problem Descriptio...
2013-07-14 01:16:00
130
转载 HDU 2629 字符串处理
Identity Card Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 995 Accepted Submission(s): 310 Problem Descr...
2013-07-14 00:45:00
182
转载 HDU 2719 字符串处理
The Seven Percent Solution Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 466 Accepted Submission(s): 307 ...
2013-07-14 00:18:00
145
转载 HDU 1062 字符串处理
Text Reverse Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12864Accepted Submission(s): 4879 Problem Description Ignatius likes ...
2013-07-14 00:05:00
116
转载 POJ 2524 并查集
Ubiquitous Religions Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 17935 Accepted: 8748 Description There are so many different religions in the world...
2013-07-13 01:32:00
74
转载 HDU 4324 拓扑排序
Triangle LOVE Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1387Accepted Submission(s): 584 Problem Description Recently, scient...
2013-07-13 00:42:00
133
转载 下一个排列 又一个排列 排列至此 暴力
#include<cstdio> #include<iostream> #include<algorithm> using namespace std; int main() { int n,p[10]; cin>>n; for(int i=0;i<n;i++) cin>>p[i]; ...
2013-07-13 00:00:00
83
转载 生成可重集的排列 暴力 字典序 枚举
小白 7.2.2 输入数组p,并按字典序输出数组A各元素的所有全排列 #include<iostream> using namespace std; #define max 10000 int a[max]; int p[]={3,2,1}; void pailie(int n,int *p,int*a,int cur) { int i,j; ...
2013-07-12 23:55:00
145
转载 生成 1~n的排列 枚举 暴力
小白 7.2.1 分析:尝试用递归的思想解决:先输出所有以1开头的排列(这一步是递归调用),然后输出以2开头的排列(又是递归调用),接着是以3开头的排列.......最后才是以n开头的排列 并且以1开头的排列的特点是:第一位是1,后面是2~9的排列.根据字典序的定义,这些2~9的排列也必须按照字典序排列.换句话说,我们需要"按照字典序输出2~9的排列",不过需要注意的是,在输出时,每...
2013-07-12 23:51:00
174
转载 资料链接
大神链接:http://mindlee.net/2011/11/25/string-matching/ 转载于:https://www.cnblogs.com/LOB104-zhanglei/articles/3185344.html
2013-07-12 01:03:00
86
转载 UVA 11234 二叉树的层次遍历 广搜
题目大意： 一般情况下，都是中缀操作符， 如x+y。然后题目给出了一种后缀操作符的形式， 变成 x y +。 进行后缀操作可以用栈模拟，使用push,pop， 过程和经典的“括号匹配”差不多。 然后要求我们转换成队列的方式，用队列的push和pop(队列的和栈的区别). 解体思路： 题目的最关键部分是进行二叉树建树， 以及层次遍历逆序输出，还有利用栈的“括号匹配”思想。 二叉树的...
2013-07-12 00:50:00
109
转载 UVA 112 二叉树的应用
样例输入： 22 (5(4(11(7()())(2()()))()) (8(13()())(4()(1()())))) 20 (5(4(11(7()())(2()()))()) (8(13()())(4()(1()())))) 10 (3 (2 (4 () () ) (8 () () ) ) (1 (6 () () ) (4 () () ) ) ) 5 () 0 () 5 (...
2013-07-12 00:42:00
118
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人