心绪如泥

摘要： using System;using System.Collections.Generic;using System.ComponentModel;using System.Data;using System.Drawing;using System.Linq;using System.Text;using System.Windows.Forms;namespace WindowsFormsApplication1{ public partial class Form1 : Form { public Form1() { Init... 阅读全文

摘要： private void User_Form_Load(object sender, EventArgs e) { winPagesImage1.ShowWhat = ShowWhat; winPagesImage1.PageSize = Pagesize; int allcount = 0; winPagesImage1.NowPage = 1; dbu.SearchUsersCompleted += new Ha_Demo.DBUser.SearchUsersCo... 阅读全文

摘要： private void button1_Click(object sender, EventArgs e) { string dateDiff = ""; DateTime time2 =Convert.ToDateTime( "2014-01-15 00:00:00.000"); TimeSpan ts1 = new TimeSpan(DateTime.Now.Ticks); TimeSpan ts2 = new TimeSpan(time2.Ticks); Tim... 阅读全文

摘要： private void 拟办单excelToolStripMenuItem_Click(object sender, EventArgs e) { if (txtinfoid.Text.Trim() == "") { ... 阅读全文

摘要： The picture presented above is quite spectacular.It is symbolically illustrated in the picture that ( ). Such provoking scenes abound in our daily lives, which without the slightest question, has given rise to great concern in the public. Looking at all these, how can we stay aloof and easy? 上面的这幅漫画 阅读全文

摘要： private void toolStripLabel3_Click(object sender, EventArgs e) { saveFileDialog1.FileName = "测评表.xls"; if (saveFileDialog1.ShowDialog() == DialogResult.Cancel) { return; } try { FileInfo mode =... 阅读全文

摘要： 一: 触发器是一种特殊的存储过程 它不能被显式地调用﹐而是在往表中插入记录﹑更新记录或者删除记录时被自动地激活。所以触发器可以用来实现对表实施复杂的完整性约束。 二: SQL Server为每个触发器都创建了两个专用表:Inserted表和Deleted表。这两个表。 一: 触发器是一种特殊的存储过程﹐它不能被显式地调用﹐而是在往表中插入记录﹑更新记录或者删除记录时被自动地激活。所以触发器可以用来实现对表实施复杂的完整性约`束。 二: SQL Server为每个触发器都创建了两个专用表:Inserted表和Deleted表。... 阅读全文

摘要： #include #define N 8void quicksort(int a[],int m,int n);int quickpass(int a[],int left,int right);int main(){ int i,m,n; int a[N]={48,63,35,76,54,12,35,88}; m=0; n=N-1; quicksort(a,m,n); for(i=0;i= x) high--; //high从右向左找小于x的元素 if(low < high)//找到小于x的记录则进行交换。 {a... 阅读全文

摘要： 计算机程序设计艺术》编程珠玑》编程珠玑2》《计算机程序的构造和解释》《Unix编程艺术》《代码大全》《程序设计实践》《程序员修炼之道》《卓有成效的程序员》《怎样解题》《科学革命的结构》《哥德尔、爱舍尔、巴赫-集异璧之大成》《宇宙》 阅读全文

摘要： #include#include#define MAX 20typedef struct { int stack[MAX]; int top;}sqstack;void Initstack(sqstack *p) /*初始化*/{if(!p) printf("error"); p->top=-1; }void Push(sqstack *p,int x){ if(p->toptop=p->top+1; p->stack[p->top]=x; } else printf("overflow!\n");}int Pop(sqst 阅读全文