cstdlib

poj3543

< iostream > #include < cstdio > #include < cstdlib
·2015-11-12 09:34

poj3536

View Code #include < iostream > #include < cstdio > #include < cstdlib > #
·2015-11-12 09:33

poj3427

< iostream > #include < cstdio > #include < cstdlib
·2015-11-12 09:32

poj3386

< iostream > #include < cstdio > #include < cstdlib
·2015-11-12 09:32

poj2840

< iostream > #include < cstdio > #include < cstdlib
·2015-11-12 09:31

poj2080

< iostream > #include < cstdio > #include < cstdlib
·2015-11-12 09:30

poj3749

< iostream > #include < cstdio > #include < cstdlib
·2015-11-12 09:30

poj3589

< iostream > #include < cstdio > #include < cstdlib
·2015-11-12 09:29

C++基于模板顺序表的实现（带排序）

第一个带注释解释的代码不可复制，最下面的第二个代码可以正常复制 代码如下： #include <iostream> #include<cstdlib> //rand
·2015-11-12 09:06

Vijos 1193 扫雷(状态压缩DP)

3 #include <cmath> 4 #include <string> 5 #include <ctime> 6 #include <cstdlib
·2015-11-12 09:21

POJ 2418 Hardwood Species(trie 树）

1 #include <iostream> 2 #include <cstdio> 3 #include <cstdlib> 4 #include <
·2015-11-12 09:49

POJ 1840 Eqs(哈希表）

1 #include <iostream> 2 #include <cstdio> 3 #include <cstdlib> 4 #include <
·2015-11-12 09:46

HDU 4282 A very hard mathematic problem(二分查找）

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

SDUT 1505 GCD(欧拉函数）

#include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cstdlib
·2015-11-12 09:16

hdu 1594水题

hdu1594/win.cpp * Created on: 2012-7-23 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:21

hdu 1856并查集

hdu1856/win.cpp * Created on: 2012-7-18 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:21

hdu2152母函数

hdu2152/win.cpp * Created on: 2012-7-18 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:19

hdu 1210

#include <iostream> #include <cstdio> #include <cstring> #include <cstdlib>
·2015-11-12 09:19

hdu 1905 poj3641素数判定与快速幂取余

hdu1905/win.cpp * Created on: 2012-7-12 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:17

hdu1852快速幂取余

hdu1852/win.cpp * Created on: 2012-7-10 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:16

hdu1798几何公式

hdu1798/win.cpp * Created on: 2012-7-9 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:16

hdu1787赤裸裸的欧拉涵数

hdu1787/win.cpp * Created on: 2012-7-9 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:15

hdu1725大水题

hdu1725/win.cpp * Created on: 2012-7-6 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:14

hdu2669扩展欧几里得

hdu2669/win.cpp * Created on: 2012-7-6 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:13

hdu1724定积分

hdu1724/win.cpp * Created on: 2012-7-6 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-12 09:12

hdu 1596 最短路

* * hdu1596/win.cpp * Created on: 2011-12-5 * Author : ben */#include <cstdio>#include <cstdlib
·2015-11-12 09:07

hdu 1575 矩阵快速幂

* hdu1575/win.cpp * Created on: 2011-11-24 * Author : ben */#include <cstdio>#include <cstdlib
·2015-11-12 09:04

hdu 1576

* hdu1576/win.cpp * Created on: 2011-11-28 * Author : ben */#include <cstdio>#include <cstdlib
·2015-11-12 09:04

hdu 1541 简单题

* hdu1541/win.cpp * Created on: 2011-11-14 * Author : ben */#include <cstdio>#include <cstdlib
·2015-11-12 09:00

hdu 1525 博弈

* hdu1525/win.cpp * Created on: 2011-11-11 * Author : ben */#include <cstdio>#include <cstdlib
·2015-11-12 09:59

hdu 1556

* hdu1556/win.cpp * Created on: 2011-11-13 * Author : ben */#include <cstdio>#include <cstdlib
·2015-11-12 09:59

hdu1518 bjfuoj1042 zoj1909 poj2362 经典的搜索加剪枝

* * hdu1518/win.cpp * Created on: 2011-11-8 * Author : ben */#include <cstdio>#include <cstdlib
·2015-11-12 09:57

hdu 1213 简单并查集

* * hdu1213/win.cpp * Created on: 2011-11-5 * Author : ben */#include <cstdio>#include <cstdlib
·2015-11-12 09:56

hdu 1847

* hdu1847/win.cpp * Created on: 2011-10-27 * Author : ben */#include <cstdio>#include <cstdlib
·2015-11-12 09:54

写点C++ 学习记录 充数

#include "stdafx.h" #include <cstdlib> #include <iostream> using namespace
·2015-11-11 19:16

uva514(trail)(模拟栈)

1 //#define LOCAL 2 #include<cstdio> 3 #include<cstring> 4 #include<cstdlib>
·2015-11-11 19:13

hdu2089 不要62

3 #include<cmath> 4 #include<algorithm> 5 #include<cstring> 6 #include<cstdlib
·2015-11-11 18:25

UVA401 - Palindromes

algorithm> #include <string> #include <cstdio> #include <cstring> #include <cstdlib
·2015-11-11 18:27

排序算法之选择排序

5 #include <iostream> 6 #include <algorithm> 7 #include <ctime> 8 #include <cstdlib
·2015-11-11 18:09

poj 1181(大数判素数 ，分解)

1 //miller_rabin 判断一个大数是否是素数 2 //pollard_rho 大数因子分解 3 #include<cstdio> 4 #include<cstdlib
·2015-11-11 18:11

poj 2632 Crashing Robots

View Code #include <cstdio>#include <iostream>#include <algorithm>#include <cstdlib
·2015-11-11 17:02

OpenJudge Trans

include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<cstdlib
·2015-11-11 17:39

狗狗40题~ (Volume C)

1 #include <stdio.h> 2 #include <cstring> 3 #include <cstdlib> 4 #include <
·2015-11-11 17:31

SRM528 DIV2 解题报告

），如果两端只有一个问号，那么花费是确定的，根据对称的另一端累加最小花费 #include <iostream>#include <cstdio>#include <cstdlib
·2015-11-11 17:24

uva 10815 - Andy's First Dictionary

#include<iostream> #include<cctype> #include<cstdlib> #include<cstdio> #include
·2015-11-11 17:08

HDOJ 1251 -- 统计难题 Trie

ouyangyewei 4 LANG: C++ 5 */ 6 #include <string> 7 #include <cstdio> 8 #include <cstdlib
·2015-11-11 17:19

USACO 2.3.1 Longest Prefix --- Trie

4 LANG: C++ 5 */ 6 #include <string.h> 7 #include <cstdio> 8 #include <cstdlib
·2015-11-11 17:19

流随机访问

17.39 #include<iostream> #include<fstream> #include<string> #include<cstdlib
·2015-11-11 16:32

POJ 2001 Shortest Prefix

cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <cstdlib
·2015-11-11 16:54

判断一个二叉树是否为满二叉树

代码如下 /**< 判断一个二叉树是否为满二叉树 */ #include <cstdio> #include <cstdlib> struct BiTree
·2015-11-11 16:18
上一页 11 12 13 14 15 16 17 18 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他