cstdlib

hdu 2818 Building Block(并查集)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<cstring
·2015-10-31 09:17

nyoj 子串和

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<cstring
·2015-10-31 09:17

nyoj An problem about date(吉姆拉尔森公式)

  1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include
·2015-10-31 09:17

nyoj 三国志 (Dijkstra + 01背包)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<cstring
·2015-10-31 09:16

nyoj 月老的难题 (稳定婚姻问题)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<cstring
·2015-10-31 09:16

hdu 4081 Qin Shi Huang's National Road System

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #includ
·2015-10-31 09:16

hdu 3926 Hand in Hand

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<
·2015-10-31 09:16

nyoj 校园网络 (Tarjan求强连通分量)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<
·2015-10-31 09:16

nyoj 有趣的问题(最短路径)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<
·2015-10-31 09:16

nyoj 坦克大战 (优先队列)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<cstring
·2015-10-31 09:16

nyoj 游戏高手的烦恼 (二分图最小点覆盖)

二分图的匹配数  详细请看某周的hihocoder 1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib
·2015-10-31 09:16

nyoj 一笔画问题 (判断欧拉路径)

1.图为连通图(并查集处理) 2.奇数度为0或2 1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib
·2015-10-31 09:15

蓝桥杯 小朋友排队

#include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #
·2015-10-31 09:15

nyoj 吝啬的国度 图的遍历

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<cstring
·2015-10-31 09:15

nyoj 天下第一 (spfa)

  1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include
·2015-10-31 09:15

nyoj 网络的可靠性(。。。)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<cstring
·2015-10-31 09:15

nyoj 城市平乱(Dijkstra)

裸 1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include
·2015-10-31 09:15

nyoj 布线问题 (最小生成树)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<cstring
·2015-10-31 09:15

uestc 方老师抢银行

  1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #
·2015-10-31 09:15

11235 - Frequent values

iostream> #include <stack> #include <queue> #include <cstdio> #include <cstdlib
·2015-10-31 09:44

使用read(),write(),seekg(),seekp()实现二进制方式文件随机存取

file I/O #include <iostream> #include <fstream> #include <iomanip> #include <cstdlib
·2015-10-31 09:46

11235 - Frequent values

iostream> #include <stack> #include <queue> #include <cstdio> #include <cstdlib
·2015-10-31 09:02

[课程相关]homework-08

一、变量作用域和生命周期 1 #include <cstdlib> 2 #include <iostream> 3 4 using namespace std
·2015-10-31 09:26

用_makepath和_splitpath构造路径&分解路径

#include <iostream> #include <cstdlib> using namespace std; const int MAX_PATH_ =
·2015-10-31 09:42

uva10474 简单排序查找 一次AC

  #include<iostream> #include<cstdlib> using namespace std; int cmp(const void*
·2015-10-31 09:35

leetcode Maximum Product Subarray

#include <iostream> #include <cstdlib> using  namespace std; int
·2015-10-31 09:35

leetcode Reverse Words in a String

#include <iostream> #include <cstdlib> #include < string> #include
·2015-10-31 09:35

OpenCV2 椒盐噪声

#include <opencv2/core/core.hpp>#include <opencv2/highgui/highgui.hpp>#include <cstdlib
·2015-10-31 08:45

程序目的：实现c++整型和字符数组，字符串的相互转化

环境：dev-c++ 源代码： #include <iostream>#include <cstdlib>using namespace std;main(){ &
·2015-10-31 08:32

ural 1088 二叉树基本性质

和ep都是叶子节点，这棵树又是满二叉树，所以，可以直接往上找到最近公共祖先，然后加减运算一下就好了 View Code #include<cstdio>#include<cstdlib
·2015-10-31 08:10

poj2070

简单题 #include <cstdio> #include <cstdlib> #include <cstring> #include <string
·2015-10-31 08:18

poj1504

简单题 #include <iostream> #include <cstdlib> #include <cstdio> #include <cstring
·2015-10-31 08:17

poj1631

最长递增子序列 #include <iostream> #include <cstdlib> #include <cstdio> #include &
·2015-10-31 08:17

poj2263

string.assign(char*); #include <iostream> #include <cstdlib> #include <cstdio>
·2015-10-31 08:17

poj1384

dp #include <iostream> #include <cstdlib> #include <cstring> #include <cstdio
·2015-10-31 08:17

poj2533

最长递增子序列 #include <iostream> #include <cstdlib> #include <cstdio> #include &
·2015-10-31 08:17

poj2260

简单题 #include <iostream> #include <cstdlib> #include <cstdio> #include <cstring
·2015-10-31 08:16

poj2406

简单题 #include <iostream> #include <cstdlib> #include <cstdio> #include <cstring
·2015-10-31 08:16

poj2304

简单题 #include <iostream> #include <cstdlib> #include <cstring> #include <
·2015-10-31 08:16

poj2909

< iostream > #include < cstdio > #include < cstdlib
·2015-10-31 08:16

poj2350

简单题 #include <iostream> #include <cstdlib> #include <cstdio> #include <cstring
·2015-10-31 08:16

poj3085

< iostream > #include < cstdio > #include < cstdlib
·2015-10-31 08:15

poj3086

< iostream > #include < cstdio > #include < cstdlib
·2015-10-31 08:15

poj3098

< iostream > #include < cstdio > #include < cstdlib
·2015-10-31 08:15

poj3095

< iostream > #include < cstdio > #include < cstdlib
·2015-10-31 08:15

poj3096

< iostream > #include < cstdio > #include < cstdlib
·2015-10-31 08:15

poj3094

< iostream > #include < cstdio > #include < cstdlib
·2015-10-31 08:15

poj3083

View Code #include < iostream > #include < cstdlib
·2015-10-31 08:15

poj3080

看其他串是否也有 View Code #include < iostream > #include < cstdlib
·2015-10-31 08:14

poj3077

0.5) View Code #include < iostream > #include < cstdlib
·2015-10-31 08:14
上一页 37 38 39 40 41 42 43 44 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他