2015年12月_oliver233

12月 11月 10月 09月

原创集合的交并差（链表）（未完）

#include #include #include #include using namespace std; int len1=0; int len2=0; typedef struct node{ int valum; struct node *next; }Node,*Linklist; void creat_list(Linklist &head,int n) {

2015-12-16 21:29:05 503

原创 HDU2602（简单背包问题）

Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 42688 Accepted Submission(s): 17774 Problem Description Many years ago ,

2015-12-13 20:25:24 362

原创 HDU5595

GTW likes math Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 251 Accepted Submission(s): 124 Problem Description After attending the c

2015-12-13 12:34:41 126

原创模式串匹配（KMP算法）

#include #include typedef struct { char string[100]; int length; }String; int next[100]; void getnext(String p) { int i,j; next[0]=-1; i=0; j=-1; while(i<p.length){ if(j==-1||p.string[i]=

2015-12-12 17:35:11 378

原创 prime ring problem（hdu 1016）

Prime Ring Problem Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 36885 Accepted Submission(s): 16252 Problem Description A ring is compo

2015-12-12 16:25:58 270

原创 shell编程批量创建用户（不需要文件操作）

#!/bin/bash read -p "qianzhui: " u_name read -p "weizhui: " nu_nu read -p "startnum: " nu_start read -p "weishu: " nu_amount nu_end=$(($nu_start+$nu_amount-1)) for (( i=$nu_start;i<=$nu_end;i=i+1)

2015-12-12 16:15:03 800

原创 shell编程Linux中批量创建用户

if [ -f "accountfile" ];then mv $accountfile "$accountfile"`date +%Y%m%d` fi touch "$accountfile" read -p "qianzhui: " username_start read -p "weizhui: " nu_nu read -p "start num:" nu_start read -p

2015-12-09 22:26:52 1827

原创最小生成树prim（普里姆）算法

#include #include #define Max 20 int visited[20]; typedef struct { char vex[Max]; int vexs[Max][Max]; int vexnum,arcnum; }MGraph; typedef struct { char adjvex; int lowcost; }closest; int L

2015-12-07 22:43:14 415

原创 LInux Shell编程初探

#!/bin/bash while [ "0" == "0" ] do read -p "please in put the number1 :" num1 read -p "please in put the number2 : " num2 read -p "please in put your wants : " flag

2015-12-05 21:14:51 393