cstdlib

UVA 10596 - Morning Walk

#include<cstdio>#include<cstring>#include<cstdlib>#define MAXN 205int d[MAXN], p[MAXN
·2015-11-13 01:03

POJ 1316 Self Numbers

16MS C++ 412B 2012-05-04 22:50:01 */ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-13 01:03

UVA 784 - Maze Exploration

#include<cstdio>#include<cstring>#include<cstdlib>char a[35][85];char b[100];const
·2015-11-13 01:02

CSUOJ 1010: Water Drinking

与池塘相连 #include<cstdio>#include<cstring>#include<cstdlib>#define MAXN 100005int
·2015-11-13 01:01

CSUOJ 1226: ACM小组的内战

#include<cstdio>#include<cstring>#include<cstdlib>#define SIZE 30
·2015-11-13 01:01

POJ -1753-Flip Game

#include<cstdio>#include<cstring>#include<cstdlib>int map[4][4];int dx[] = { 1, -1,
·2015-11-13 01:59

月赛两道能A的题

#include<cstdio>#include<cstring>#include<cstdlib>int n, m, x1, y1, x2, y2;int dx[]
·2015-11-13 01:58

POJ 1015 Jury Compromise (动态规划)

  #include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm
·2015-11-13 01:24

HDU 1698 Just a Hook（线段树区间覆盖）

线段树基本操作练习，防手生 #include <cstdio> #include <cstring> #include <cstdlib> #define
·2015-11-13 01:22

HDU 2222 Keywords Search (AC自动机模板题)

一组数据： 1 3 sss sss sss sss ans：3   #include <cstdio> #include <cstdlib> #
·2015-11-13 01:20

HDU3549+Ford-Fulkerson

Ford-Fulkerson算法 基本没什么技巧 View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib
·2015-11-13 00:17

HDU3549（2）+EK算法

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib> 4
·2015-11-13 00:17

POJ1386+欧拉回路

1 #include<cstdio> 2 #include<vector> 3 #include<iostream> 4 #include<cstdlib
·2015-11-13 00:15

POJ3616

View Code 1 #include<cstdio> 2 #include<cstdlib> 3 #include<algorithm> 4
·2015-11-13 00:11

POJ1664

View Code 1 #include<cstdio> 2 #include<cstdlib> 3 #define N 12 4 int f[N][N];
·2015-11-13 00:10

POJ3628

  01背包 View Code 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring
·2015-11-13 00:10

HDU1253

View Code 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring> 4 #include
·2015-11-13 00:06

POJ2251

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib> 4 #include
·2015-11-13 00:02

Poj2786

#include<cstdio> #include<queue> #include<iostream> #include<cstdlib> #include
·2015-11-13 00:00

POJ 1006 Biorhythms 数论-（孙子定理）

代码如下：   #include <iostream> #include <cstdio> #include <cstdlib> #i
·2015-11-13 00:27

HDU 1708 Fibonacci String

最后有空行 View Code #include <iostream> #include <cstdlib> #include <cstring>
·2015-11-13 00:28

HDU 1787 GCD Again

互质的数，减去N本身再减去和N互质的就好了，小于N且和N互质的数的个数就用欧拉函数算了 View Code #include <iostream> #include <cstdlib
·2015-11-13 00:27

HDU 2824 The Euler function

pid=2824 同上一题，裸欧拉函数 View Code #include <iostream> #include <cstdlib> #include <
·2015-11-13 00:26

HDU 1286 找新朋友

pid=1286 裸欧拉函数，欧拉函数是求比n小的数中有多少个与n互质 View Code #include <iostream> #include <cstdlib&
·2015-11-13 00:25

HDU 4163 Stock Prices

pid=4163 稳定排序 View Code #include <iostream> #include <cstdlib> #include <cstring
·2015-11-13 00:24

HDU 1872 稳定排序

pid=1872 稳定排序，用一个变量idx记录位置保持稳定 View Code #include <iostream> #include <cstdlib>
·2015-11-13 00:23

最长回文字符串

求最长回文字符串： #include<cstdio>#include<cstdlib>#include<cmath>#include<algorithm>
·2015-11-13 00:10

求组合

#include <iostream> #include<cstring> #include<cstdio> #include<cstdlib>
·2015-11-13 00:22

DFS Zoj 2110

stdio.h> #include<string.h> #include<math.h> #include<iostream> #include<cstdlib
·2015-11-13 00:04

hdu 3594 仙人掌图

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:21

hdu 2295 DLX

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:13

hdu 3656 DLX

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:09

hust 1017 DLX

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:09

poj 2498 动态规划

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:04

poj 2029 二维树状数组

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:04

hdu 2586 LCA

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:02

Tarjan 离线算法LCA

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:00

hdu 4055 动态规划

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:58

hdu 4144 状态压缩dp

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:56

hdu 3062 2-SAT问题

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:50

noi 97 积木游戏

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:48

poj 1695 动态规划

include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib
·2015-11-13 00:47

POJ 2966

View Code 1 #include<cstdlib> 2 #include<cmat
·2015-11-13 00:02

poj1806

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

poj1496

同1850 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:03

poj1244

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

poj1914

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

poj1835

向量运算 简单题 View Code #include <iostream>#include <cstdio>#include <cstdlib>#include
·2015-11-13 00:00

poj2295

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

poj1254

View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring
·2015-11-13 00:57
上一页 5 6 7 8 9 10 11 12 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他