cstdlib

noip2014 小结

#include<iostream> #include<cstdio> #include<cstdlib> using namespace std; int
·2015-11-05 08:57

求命题真值表及主范式

1#include"iostream" 2#include"cstring" 3#include"cstdlib" 4#include"stack" 5#include"cmath" 6#definemaxsize100
隐藏者·2015-11-04 20:00

hdu 1622 Trees on the level

  1 #include<algorithm> 2 #include<iostream> 3 #include<cstdlib> 4
·2015-11-03 22:29

九度oj 1530 最长不重复子串

如下： 1 #include<algorithm> 2 #include<iostream> 3 #include<cstdlib> 4
·2015-11-03 22:28

九度oj 1184 二叉树遍历

如下：   1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring>
·2015-11-03 22:27

hdu 4585 Shaolin

id=46093 1 #include<algorithm> 2 #include<iostream> 3 #include<cstdlib>
·2015-11-03 22:25

bzoj 1269 [AHOI2006]文本编辑器editor

id=1269 伸展树的运用，如下：   1 #include<cstdio> 2 #include<cstdlib> 3 #include
·2015-11-03 22:24

hdu 1856 More is better

pid=1856 简单的并查集的运用，如下：   1 #include<cstdio> 2 #include<cstdlib> 3 #include
·2015-11-03 22:23

poj 1338 Ugly Numbers

id=1338 优先队列的应用，如下： 1 #include<cstdio> 2 #include<cstdlib> 3 #include<queue
·2015-11-03 22:22

uva 11922 Permutation Transforme/splay tree

如下： 1 #include<cstdio> 2 #include<cstdlib> 3 #include<iostream> 4 #
·2015-11-03 22:21

poj 1862 Stripies/优先队列

手打的heap： 1： 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cmath> 4
·2015-11-03 22:21

hdu 4006/AvlTree

由于没有删除操作故不带垃圾回收，具体如下：   1 #include<cstdio> 2 #include<cstdlib> 3 #in
·2015-11-03 22:20

bzoj 3223/tyvj 1729 文艺平衡树 splay tree

只涉及区间翻转，由于没有删除操作故不带垃圾回收，具体如下： 1 #include<cstdio> 2 #include<cstdlib> 3 #include
·2015-11-03 22:18

bzoj 3224/Tyvj 1728 普通平衡树

sb树的一些基本操作都在里面了带垃圾回收，具体如下： 1 #include<cstdio> 2 #include<cstdlib> 3 #include
·2015-11-03 22:17

zoj 2112 Dynamic Rankings

problemId=1112   1 #include<cstdio> 2 #include<cstdlib> 3 #include
·2015-11-03 22:16

bzoj 3196/tyvj p1730 二逼平衡树

如下：   1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring
·2015-11-03 22:15

nyist OJ 35 (表达式求值)

直接上代码： View Code 1 #include <cstdio> 2 #include <cstring> 3 #include <cstdlib
·2015-11-03 22:09

实现单链表逆置

#include <iostream> #include <cstdlib> using namespace std; typedef struct List {
·2015-11-03 22:44

网络流(二)----最大流Dinic算法

Pahom on Water 为例的 模板代码 #include <cstdio> #include <iostream> #include <cstdlib
·2015-11-03 21:08

ZOJ 3811 zoj 3811 Untrusted Patrol牡丹江网络赛C题

去年的比赛题目,今年才搞懂AC了＝＝＝|| 1 #include <cstdio> 2 #include <cstdlib> 3 #include <
·2015-11-03 21:07

网络流(一)----最大流Ford-Fulkerson算法

nbsp; 以HDU1532为例的Ford_Fulkerson算法 #include <cstdio> #include <iostream> #include <cstdlib
·2015-11-03 21:06

poj1046

简单题 View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-03 21:56

poj1120

模拟 View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-03 21:55

poj1111

Code #include <iostream> #include <cstdio> #include <cstring> #include <cstdlib
·2015-11-03 21:54

poj1106

极坐标排序+叉积判断夹角 View Code #include <iostream> #include <cstdio> #include <cstdlib
·2015-11-03 21:53

poj1450

简单题 View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-03 21:53

poj1083

线段覆盖，注意从右往左挪的情况 View Code #include <iostream> #include <cstdlib> #include <cstdio
·2015-11-03 21:52

poj1080

Code #include <iostream> #include <cstring> #include <cstdio> #include <cstdlib
·2015-11-03 21:51

poj1317

简单模拟 View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-03 21:49

poj1617

简单模拟 View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-03 21:48

poj1606

bfs View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-03 21:48

poj2395

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:44

poj2390

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:42

poj2387

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:40

poj2386

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:39

poj2377

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:39

poj2371

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:38

poj2363

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:37

poj2352

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:36

poj2328

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:35

poj2316

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:34

poj2318

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:33

poj2499

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:32

poj2498

< iostream > #include < cstdio > #include < cstdlib
·2015-11-03 21:31

HDU 2147 kiki's game 博弈

lonelycatcher * Problem:HDU 2147 * Type:组合博弈 */#include <iostream>#include<stdio.h>#include<cstdlib
·2015-11-03 21:32

树的基本操作(C语言)

  代码 #include < cstdio > #include < cstdlib
·2015-11-03 20:52

C++ STL：vector实现

半路md面试电话来了，赶紧存档，看Java大法 #include <iostream> #include <cstdlib> #include <vector>
·2015-11-02 19:07

PAT 1029. Median

数组偶数个数的时候取中位数是取中间两者中的前者，还tmd一直再算平均，卧槽 #include <iostream> #include <cstdio> #include <cstdlib
·2015-11-02 19:02

PAT 1017. Queueing at Bank

又是排队模拟 #include <iostream> #include <cstdlib> #include <vector> #include <list
·2015-11-02 19:02

PAT 1014. Waiting in Line

#include <iostream> #include <cstdlib> #include <cstdio> #includ
·2015-11-02 19:01
上一页 26 27 28 29 30 31 32 33 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他