cstdlib

poj1410

View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring
·2015-11-13 00:57

poj1281

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

poj2419

简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:55

poj1132

简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:55

poj1978

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

poj1970

简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:52

poj1918

简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:52

poj2014

简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:51

poj2183

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

poj2174

位操作 简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:50

poj2272

简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:49

poj2218

简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:48

poj1037

View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring
·2015-11-13 00:47

poj2339

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

poj1701

简单题，推公式 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:46

poj3641

简单题 快速幂 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:45

poj3625

最小生成树 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:44

poj2766

简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:43

poj1060

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

poj1107

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

poj1057

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

测试用

1 #include <iostream> 2 #include <cmath> 3 #include <cstdlib> 4 #include <
·2015-11-13 00:07

暑假集训0811

比如hdu3887 本质上是一个求子树和的问题 1 #include <cstdio> 2 #include <cstdlib> 3 #include
·2015-11-12 23:11

循环链表解决约瑟夫环问题

1 /** 2 * 循环链表求解约瑟夫环问题 3 **/ 4 #include <iostream> 5 #include <cstdlib> 6 using
·2015-11-12 23:46

poj 1113Wall

id=1113 1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib> 4 #include
·2015-11-12 23:07

poj 2187 Beauty Contest

id=2187 1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib> 4 #include
·2015-11-12 23:06

Curling 2.0

1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include<cstdlib
·2015-11-12 23:58

Dungeon Master

1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include<cstdlib
·2015-11-12 23:56

poj 2513Colored Sticks

id=2513 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring> 4 using
·2015-11-12 23:56

Gold Balanced Lineup

1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include <cstdlib
·2015-11-12 23:55

Currency Exchange

主要找正环： 1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib> 4
·2015-11-12 23:42

Wormholes

1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib> 4 #include<algorithm
·2015-11-12 23:40

Radar Installation

1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring> 4 #include<algorithm
·2015-11-12 23:40

HDU 1711 Number Sequence KMP

pid=1711 AC代码：   #include <iostream> #include <cstdio> #include <cstdlib&
·2015-11-12 23:43

POJ 1442 Black Box

C++ 906B 2012-07-30 17:18:34*/ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-12 22:02

c基础编程：八皇后问题（递归算法）

#include <stdio.h> #include <cstdlib> int eight_array[8] = {0}; int count = 0; void
·2015-11-12 22:07

HDU 4308 Saving Princess claire_（简单BFS）

点时起点到终点的最短距离， 起点到P的最短距离+终点到P的最短距离 ）   #include <cstdio> #include <cstring> #include <cstdlib
·2015-11-12 22:42

HDU 4300 Clairewd’s message (next函数的应用)

  #include <cstdio> #include <cstring> #include <cstdlib&g
·2015-11-12 22:39

树状数组_二分_POJ-2182

1 #include<cstdio> 2 #include<cstdlib> 3 #include
·2015-11-12 22:29

线段树_POJ-3468

用了两种方法写： 1.lazy，效率略低 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring
·2015-11-12 22:29

男人八题_POJ-1741

代码如下 1 #include<cstdio> 2 #include<cstdlib> 3 #include
·2015-11-12 22:28

传统_POJ-1442

搞一个大根堆和一个小根堆，其余YY一下就好 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring
·2015-11-12 22:27

传统_POJ-2528

id=2528 搞一个简单的映射就可以了，代码如下 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring
·2015-11-12 22:27

模板题_NOIp2012同余方程

题目链接：http://codevs.cn/problem/1200/ 扩展gcd的模板题，代码如下 1 #include<cstdio> 2 #include<cstdlib
·2015-11-12 22:26

C++ 中int，char，string，CString类型转换（一）

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

1067. Disk Tree（字符串）

1 #include <iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<cstdlib
·2015-11-12 21:48

1650. Billionaires(线段树）

#include<cstdio> 3 #include<cstring> 4 #include<algorithm> 5 #include<cstdlib
·2015-11-12 21:46

poj1195

二维树状数组 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-12 21:01

poj1152

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

poj1171

的组合只可能是3+3或者3+4 所以其余长度的单词无需记录 把记录后的单词n^2枚举pair View Code #include <iostream>#include <cstdlib
·2015-11-12 21:00
上一页 6 7 8 9 10 11 12 13 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他