bai071006201的专栏

技术菜鸟

barn repair

#include using namespace std; int main() { int i,j,k,m,s,c,start=1,minlength=0; int number[201],sort[200]; ifstream fin ("barn1.in"); o...

2012-06-26 22:23:33

阅读数:204

评论数:0

milk

#include using namespace std; int main() { int n,m,i,j,k,q; ifstream fin ("milk.in"); ofstream fout ("milk.out"); fin>>...

2012-06-25 22:53:01

阅读数:693

评论数:0

dual palindromes

#include #include #include #include using namespace std; int main() { char a[]={'0','1','2','3','4','5','6','7','8','9'}; ifstream fin ("dualp...

2012-06-25 19:42:50

阅读数:115

评论数:0

palindromic squares

/* PROG:palsquare LANG:C++ */ #include #include #include #include using namespace std; int main() { ifstream fin ("palsquare.in"); ofstre...

2012-06-25 18:35:42

阅读数:160

评论数:0

name that number

/* ID:wsbqw1 PROG:namenum LANG:C++ */ #include #include #include using namespace std; int main() { int i,j=0; string s; ifstream fin ("dict.t...

2012-06-24 20:08:17

阅读数:108

评论数:0

beads

#include #include #include #define null NULL using namespace std; typedef struct stack { struct stack *prior; struct stack *next; char c; }stac...

2012-06-22 20:04:59

阅读数:96

评论数:0

Greedy Gift Givers

/* ID:wsbqw1 PROG:gift1 LANG:C++ */ #include #include #include #include using namespace std; int main() { ifstream fin ("gift1.in"); ofst...

2012-06-21 10:37:25

阅读数:202

评论数:0

your ride is here

#include #include #include using namespace std; int main() { ofstream fout ("ride.out"); ifstream fin ("ride.in"); string a,b;...

2012-06-20 16:46:55

阅读数:115

评论数:0

朴素字符串匹配

//朴素字符串匹配 #include #include using namespace std; void stringmatch(string t,string s) { int m=t.length(); int n=s.length(); int i,j; for(i=0;i<...

2012-06-19 20:37:58

阅读数:114

评论数:0

二叉查找树的创建,插入,搜索,查询后继

#include #include #define null NULL typedef struct t { int key; struct t *left; struct t *right; struct t *parent; }tree; tree* insert(tree *t,in...

2012-06-04 18:31:58

阅读数:153

评论数:0

快速查找数组中第几小的元素

#include int patition(int a[],int p,int r) { int x=a[r]; int i=p-1; int j; for(j=p;j<=r-1;j++) { if(a[j]<=x) { i++; int temp=a[j...

2012-06-02 21:08:42

阅读数:251

评论数:0

快排2

#include int patition(int a[],int p,int r) { int i=p-1; int x=a[r]; for(int j=p;j<=r-1;j++) { if(a[j]<=x) { i++; int temp; tem...

2012-06-02 16:53:07

阅读数:295

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭