cstdlib

poj1154

深搜 简单题 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-12 21:59

poj1064

二分 简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-12 21:57

poj1023

二进制相关问题，构造 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-12 21:55

poj1036

动态规划 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-12 21:55

poj1929

无算法，但有些麻烦 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-12 21:54

poj1274

匈牙利算法 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-12 21:53

poj1087

最大流 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-12 21:53

poj2015

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

poj1320

解一元二次方程 简单题 打表 View Code #include <iostream>#include <cstdio>#include <cstdlib
·2015-11-12 21:49

poj1642

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

poj1161

floyd 大约是n^3的效率，32ms View Code #include <iostream>#include <cstdio>#include <cstdlib
·2015-11-12 21:47

poj1555

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

poj2379

View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring
·2015-11-12 21:44

poj2472

最短路，bellman View Code #include <iostream>#include <cstdio>#include <cstdlib>#
·2015-11-12 21:43

poj2935

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

poj3366

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

poj1493

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

poj2041

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

poj2019

View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring
·2015-11-12 21:40

poj2369

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

poj2603

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

poj3032

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

poj3444

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

poj1010

View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring
·2015-11-12 21:35

poj2101

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

UVa 10131: Is Bigger Smarter?

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

regex

C++11 regex 这是codeforces 75B的代码 #include <cstdio> #include <cstdlib> #include <iostream
·2015-11-12 20:38

HDOJ 1754 I Hate It（线段树基本操作）

思路： 线段树的基本操作：单点替换，区间最值 #include <cstdio> #include <cstdlib> #include <cstring> #include
·2015-11-12 20:13

HDOJ 1166 敌兵布阵（线段树基本操作）

思路： 基本的线段树操作：单点更新，区间求和 #include <cstdio> #include <cstdlib> #include <cstring>
·2015-11-12 20:12

数据结构练习（28）输出1到最大的N位数

#include <cstdio> #include <cstring> #include <cstdlib> void Prin
·2015-11-12 20:58

数据结构练习（12）第一个只出现一次的字符

需要2次遍历字符串才能找到第一个只出现一次的字符 #include <cstdio> #include <cstdlib> #include <cstring>
·2015-11-12 20:46

数据结构练习（05）二元查找树的后序遍历结果

http://zhedahht.blog.163.com/blog/static/25411174200725319627/ #include <cstdio> #include <cstdlib
·2015-11-12 20:41

数据结构练习（06）翻转句子中单词的顺序

://zhedahht.blog.163.com/blog/static/254111742007289205219/ #include <cstdio> #include <cstdlib
·2015-11-12 20:41

UVa 10105 Polynomial Coefficients（排列组合）

#include <cstdio> #include <cstdlib> #include <cstring> const int MAXN = 20;
·2015-11-12 20:36

HDU 2087 剪花布条 KMP

2087 KMP匹配数—— AC代码：   #include <iostream> #include <cstdio> #include <cstdlib
·2015-11-12 20:57

c++ 字符間的轉換

 c++中string到int的转换 1) 在C标准库里面，使用atoi： #include <cstdlib> #include <string
·2015-11-12 20:19

Convert Sorted List to Binary Search Tree ------C++ 递归创建平衡二叉查找树

先找链表到中间的节点 2.中间节点的val创建一个新的树节点TreeNode 3.将链表断裂为2部分 4.递归创建左子树和右子树 #include<iostream> #include<cstdlib
·2015-11-12 20:20

排序二叉树

pid=2482&cid=1184 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring
·2015-11-12 20:24

生成任意区间的随机数

之间的随机数，可生成任意数之间的随机数 2 #inlcude <iostream> 3 #include <ctime> 4 #include <cstdlib
·2015-11-12 19:45

单链表排序--归并排序

#include <iostream> #include <cstdlib> using namespace std; struct ListNode //默认为public
·2015-11-12 18:07

[wc2013]糖果公园(70分)

#include <cstdio> #include <cstdlib> #include <cmath> #include <cstring>
·2015-11-12 18:59

HDU 4240

流量最大的路径的流量在dinic的dfs每次搜到终点的时候更新最大值 #include <cstdio> #include <cstring> #include <cstdlib
·2015-11-12 18:38

高精度模板

#include <cstdio> #include <cstring> #include <cstdlib> #include <iostream>
·2015-11-12 18:37

1242. Werewolf（ｄｆｓ）

2 #include<cstdio> 3 #include<cstring> 4 #include<algorithm> 5 #include<cstdlib
·2015-11-12 18:20

POJ3468 A Simple Problem with Integers

iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cstdlib
·2015-11-12 18:53

poj2549

排序题 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-12 17:59

poj2536

二分图匹配 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-12 17:58

poj2394

最短路，有重边 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-12 17:55

poj2436

位操作枚举 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-12 17:55

poj2376

排序+贪心 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-12 17:54
上一页 7 8 9 10 11 12 13 14 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他