cstdlib

ZOJ 3717 Balloon ( TLE )

#include <cstdio> #include <cstring> #include <cstdlib> #include <cmath>
·2015-11-13 03:20

HDU 4671 Backup Plan 构造

#include <cstdio> #include <cstring> #include <cstdlib> using namespace std;
·2015-11-13 03:17

HDU 4669 Mutiples on a circle 动态规划

对于处理循环，官方给了一种很巧妙的方法：   #include <cstdio> #include <cstring> #include <cstdlib
·2015-11-13 03:15

HDU 4655 Cut Pieces 找规律+简单计数

//blog.csdn.net/a601025382s/article/details/9840125   #include <cstdio> #include <cstdlib
·2015-11-13 03:14

SPOJ 362 Ignore the Garbage 转7进制+简单大数除法

  #include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm
·2015-11-13 03:12

HDU 4665 Unshuffle DFS找一个可行解

参考了学弟的解法，果断觉得自己老了…… #include <cstdio> #include <cstring> #include <cstdlib>
·2015-11-13 03:11

ural1100 Final Standings

#include <cstdlib> #include <iostream> #include <cstdio> using namespace std;
·2015-11-13 03:49

poj 3468 A Simple Problem with Integers

#include<cstdio> #include<cstdlib> #include<cmath> #include<cs
·2015-11-13 02:52

hdu 1698 Just a Hook

left<=l&&right>=r直接返回，等到下次更新搜索到时候才向下更新，push_down; #include<cstdio> #include<cstdlib
·2015-11-13 02:51

poj 2886Who Gets the Most Candies?

我的代码如下： #include<cstdio> #include<cstdlib> #include<cmath> #include<memory.h
·2015-11-13 02:50

XMU-1349 xmu_1349

直接模拟： #include<cstdio> #include<cstdlib> #include<cmath> int a[40010]; int m
·2015-11-13 02:49

hdu 4619 最大匹配问题

#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #
·2015-11-13 02:17

poj1974

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

poj3602

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

poj3561

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

poj3505

二者只能一个动完另一个动 View Code #include <iostream>#include <cstdio>#include <cstdlib>
·2015-11-13 02:20

poj3458

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

poj3300

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

poj3158

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

poj3183

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

poj2864

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

poj2664

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

poj2579

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

poj2535

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

poj2501

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

poj2365

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

poj2163

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

poj1939

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

poj1877

注意要用c++，精度问题 注意有负数答案 View Code #include <iostream>#include <cstdio>#include <cstdlib
·2015-11-13 02:09

poj1750

简单题 注意有两个相同单词相邻的情况 View Code #include <iostream>#include <cstdio>#include <cstdlib
·2015-11-13 02:08

poj1575

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

poj1484

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

poj1248

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

poj1972

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

独木舟上的旅行

先排序然后，因 为限制条件比较多，一次最多两个，所以要么当前最大的配一个最小的一起，要么单独当前最大的自己 #include<iostream> #include<cstdlib
·2015-11-13 01:06

HDU Good Numbers （热身赛2）

0也是good number、这个把我坑惨了= =|||   #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-13 01:44

BNUOJ 1011 人工智能？

1011   简单题,..字符串查找 注意有有小数出现 #include <iostream> #include <string> #include <cstdlib
·2015-11-13 01:43

HDU 3346 Lucky Number

  #include <iostream> #include <cstdlib> #include <cstring> using namespace std
·2015-11-13 01:21

课程设计：学生管理系统(c++)

<iostream> #include <string> #include <set> #include <fstream> #include <cstdlib
·2015-11-13 01:59

uva 10012

include <iostream> 2 #include <algorithm> 3 #include <cstring> 4 #include <cstdlib
·2015-11-13 01:18

poj 1819 Disks

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <cstdlib
·2015-11-13 01:39

poj 1066 Treasure Hunt

#include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <cstdlib
·2015-11-13 01:38

LightOJ 1002 Country Roads

  #include<cstdio> #include<cstring> #include<cstdlib> #include<queue&
·2015-11-13 01:28

LightOJ 1019 Brush (V)

#include<cstdio> #include<cstring> #include<cstdlib> #include<queue> #include
·2015-11-13 01:27

POJ 1251 Jungle Roads

C++ 1594B 2012-07-27 15:57:47*/ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-13 01:25

POJ 2251 Dungeon Master

C++ 2362B 2012-07-23 17:48:55*/ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-13 01:14

RNQOJ 217 [NOIP1999]拦截导弹

http://www.rqnoj.cn/Problem_217.html #include<cstring> #include<cstdlib> #include<
·2015-11-13 01:11

COJ 1030 素数槽

  #include<cstdio> #include<cstring> #include<cstdlib> #define MAXN 1300000
·2015-11-13 01:08

POJ 2785 4 Values whose Sum is 0

3907MS C++ 1006B 2012-05-25 09:13:41 */ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-13 01:06

POJ 2785 4 Values whose Sum is 0

5188MS C++ 1146B 2012-05-04 23:56:30 */ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-13 01:04
上一页 4 5 6 7 8 9 10 11 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他