cstdio 第75页

Codeforces Round #179 (Div. 2) B.Yaroslav and Two Strings(容斥原理)

1 #include <cstdio> 2 #include <cstring> 3 #include &

·2015-11-11 15:39

POJ 3177 Redundant Paths(Tarjan)

1 #include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include <

·2015-11-11 15:38

HDU 4532 湫秋系列故事——安排座位(组合DP)

1 #include <cstdio> 2 #include &l

·2015-11-11 15:38

POJ 2817 WordStack(状态压缩DP)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <iostream

·2015-11-11 15:36

POJ 2186 Popular Cows(Tarjan)

1 #include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include

·2015-11-11 15:36

POJ 1185 炮兵阵地(状态压缩DP)

1 #include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include

·2015-11-11 15:35

HDU 1269 迷宫城堡(Tarjan算法)

1 #include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include <

·2015-11-11 15:34

USACO 4.3 Street Race(DFS)

1 /* 2 ID:cuizhe 3 LANG: C++ 4 TASK: race3 5 */ 6 #include <cstdio>

·2015-11-11 15:32

USACO 4.2 Cowcycles(DFS)

1 /* 2 ID: cuizhe 3 LANG: C++ 4 TASK: cowcycle 5 */ 6 #include <cstdio> 7 #include

·2015-11-11 15:31

USACO 4.3 Buy Low, Buy Lower(dp)

1 /* 2 ID:cuizhe 3 LANG: C++ 4 TASK: buylow 5 */ 6 #include <cstdio> 7 #include

·2015-11-11 15:30

hdu 1273不会的题

改天问问老师去…… /* * hdu1273/win.cpp * Created on: 2012-10-23 * Author : ben */ #include <cstdio

·2015-11-11 15:23

hdu 1216简单的链表模拟

/* * hdu1216/win.cpp * Created on: 2012-10-24 * Author : ben */ #include <cstdio>

·2015-11-11 15:23

hdu 1110几何题

/* * hdu1110/win.cpp * Created on: 2012-10-24 * Author : ben */ #include <cstdio>

·2015-11-11 15:22

hdu 1275纯数学题

/* * hdu1275/win.cpp * Created on: 2012-10-23 * Author : ben */ #include <cstdio>

·2015-11-11 15:21

hdu 4407容斥原理

/* * A/win.cpp * Created on: 2012-9-8 * Author : ben */ #include <cstdio> #include

·2015-11-11 15:19

hdu1796容斥原理

/* * hdu1796/win.cpp * Created on: 2012-8-20 * Author : ben */ #include <cstdio> #

·2015-11-11 15:18

hdu1558计算几何加并查集

/* * hdu1558/win.cpp * Created on: 2012-8-16 * Author : ben */ #include <cstdio> #

·2015-11-11 15:17

hdu1498最小点集覆盖

/* * hdu1498/win.cpp * Created on: 2012-8-16 * Author : ben */ #include <cstdio> #

·2015-11-11 15:16

hdu1068最大独立集

/* * hdu1068/win.cpp * Created on: 2012-8-15 * Author : ben */ #include <cstdio> #

·2015-11-11 15:16

hdu 1504最小点集覆盖

/* * hdu1054/win.cpp * Created on: 2012-8-14 * Author : ben */ #include <cstdio> #

·2015-11-11 15:15

hdu1150最小点集覆盖

/* * hdu1150/win.cpp * Created on: 2012-8-14 * Author : ben */ #include <cstdio> #

·2015-11-11 15:14

hdu 2119最小点集覆盖

/* * hdu2119/win.cpp * Created on: 2012-8-13 * Author : ben */ #include <cstdio> #

·2015-11-11 15:13

hdu 2079母涵数

简单，直接上代码 /* * hdu2079/win.cpp * Created on: 2012-8-2 * Author : ben */ #include <cstdio

·2015-11-11 15:13

hdu 2112赤裸裸的最短路

/* * hdu2112/win.cpp * Created on: 2012-8-2 * Author : ben */ #include <cstdio> #include

·2015-11-11 15:12

hdu 2184模拟

/* * hdu2184/win.cpp * Created on: 2012-8-2 * Author : ben */ #include <cstdio> #include

·2015-11-11 15:11

hdu 3746KMP的应用

/* * hdu3746/win.cpp * Created on: 2012-8-2 * Author : ben */ #include <cstdio> #include

·2015-11-11 15:10

hdu 2175水题

/* * hdu2175/win.cpp * Created on: 2012-8-2 * Author : ben */ #include <cstdio> #include

·2015-11-11 15:10

hdu 4300KMP

/* * hdu4300/win.cpp * Created on: 2012-8-1 * Author : ben */ #include <cstdio> #include

·2015-11-11 15:09

hdu 1869赤裸裸的最短路

/* * hdu1869/win.cpp * Created on: 2012-7-31 * Author : ben */ #include <cstdio> #

·2015-11-11 15:08

hdu1238水题

/* * hdu1238/win.cpp * Created on: 2012-7-31 * Author : ben */ #include <cstdio> #

·2015-11-11 15:07

hdu1181暴搜

数据量很少，暴搜就可以过了 /* * hdu1181/win.cpp * Created on: 2012-7-30 * Author : ben */ #include <cstdio

·2015-11-11 15:06

hdu4310贪心

/* * hdu2001/win.cpp * Created on: 2012-7-28 * Author : ben */ #include <cstdio> #

·2015-11-11 15:05

hdu 4152暴搜

/* * hdu4152/win.cpp * Created on: 2012-7-28 * Author : ben */ #include <cstdio> #

·2015-11-11 15:05

hdu2203KMP

/* * hdu2203/win.cpp * Created on: 2012-7-28 * Author : ben */ #include <cstdio> #

·2015-11-11 15:04

hdu 1099通分

/* * hdu1099/win.cpp * Created on: 2012-7-27 * Author : ben */ #include <cstdio> #

·2015-11-11 15:03

hdu 1050水题

/* * hdu1050/win.cpp * Created on: 2012-7-27 * Author : ben */ #include <cstdio> #

·2015-11-11 15:02

hdu 4252单调栈

/* * hdu1008/win.cpp * Created on: 2012-7-24 * Author : ben */ #include <cstdio> #

·2015-11-11 15:01

hdu 1009贪心

水题，直接贴代码 /* * hdu1009/win.cpp * Created on: 2012-7-27 * Author : ben */ #include <cstdio

·2015-11-11 15:01

hdu 4256大水题

/* * hdu1012/win.cpp * Created on: 2012-7-24 * Author : ben */ #include <cstdio> #

·2015-11-11 15:59

hdu4247水题

边长肯定是最大的箱子的边长加上次大的箱子的边长 /* * hdu1003/win.cpp * Created on: 2012-7-24 * Author : ben */ #include <cstdio

·2015-11-11 15:58

hdu 1452 数论

/* * hdu1452/win.cpp * Created on: 2011-10-24 * Author : ben */#include <cstdio>#include <

·2015-11-11 15:57

hdu4245

/* * hdu1001/win.cpp * Created on: 2012-7-24 * Author : ben */ #include <cstdio> #