cstdio

poj1127

View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio
·2015-11-12 09:52

poj1079

View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio
·2015-11-12 09:52

poj1053

View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio
·2015-11-12 09:50

poj3281

View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio
·2015-11-12 09:48

poj3187

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

poj3157

View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio
·2015-11-12 09:45

poj3125

View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio
·2015-11-12 09:45

poj3090

View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio
·2015-11-12 09:44

poj3087

View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio
·2015-11-12 09:43

poj2370

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:42

poj1941

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:42

poj1089

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:40

poj2853

< cstdlib > #include < cstring > #include < cstdio
·2015-11-12 09:39

poj3425

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:39

poj1178

View Code #include < iostream > #include < cstdio
·2015-11-12 09:36

poj1018

暴力就可以过 View Code #include < iostream > #include < cstdio
·2015-11-12 09:35

poj3543

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:34

poj3536

View Code #include < iostream > #include < cstdio > #include < cstdlib > #
·2015-11-12 09:33

poj3427

View Code #include < iostream > #include < cstdio
·2015-11-12 09:32

poj3386

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:32

poj2840

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:31

poj2080

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:30

poj3749

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:30

poj3589

简单题 View Code #include < iostream > #include < cstdio
·2015-11-12 09:29

POJ1042 Gone Fishing

code：   #include <cstdio> #include <cstring> #include <queue> #inclu
·2015-11-12 09:53

POJ 2774 Long Long Message&&HDU 1403 Longest Common Substring&&COJ 1203

  #include<iostream> #include<cstdio> #include<algori
·2015-11-12 09:31

POJ 2240题（Floyd）

#include <cstdio>#include <string>#include <map>using namespace std;map<string,int
·2015-11-12 09:06

[hdu][1890][Robotic Sort]

pid=1890 伸展树，按照题意模拟，把所求第i个节点旋转至根节点，reverse一下 View Code #include <iostream> #include <cstdio
·2015-11-12 09:54

[hdu][2203][亲和串]

View Code #include <iostream>#include <cstdio>#include <cstring>using na
·2015-11-12 09:48

HDU 2822 (BFS+优先队列)

#include "cstdio&q
·2015-11-12 09:11

poj 2342 Anniversary party_经典树状dp

思路：用树状dp，dp[i][0]为不参加会议，dp[i][1]为参加会议 #include<iostream> #include<cstdio> #in
·2015-11-12 09:10

hdu 1561 The more, The Better_树状dp

很明显是树状dp，遍历树时背包最优价值，dp[i][k]=max{dp[i][r]+dp[son[i]][k-r]} #include <iostream> #include<cstdio
·2015-11-12 09:08

hdu 4504 威威猫系列故事——篮球梦_简单dp

问超过对方分数有多少种打法 思路：因为情况太多要用__int64，很简单的dp，dp[n][m],n为第几次进攻，m为得分 #include <iostream> #include<cstdio
·2015-11-12 09:07

soj 1700 ping_简单dp

，我的dp有待提高啊 sp[i][k]=min(sp[j][k-1]+dp[j][i])//k为多少条边，j能到i #include <iostream> #include<cstdio
·2015-11-12 09:05

soj 1698 Hungry Cow_三角函数

被dp卡着这题没做成 1 #include <iostream> 2 #include<cstdio> 3 #include<cmath> 4 #include
·2015-11-12 09:04

Vijos 1193 扫雷(状态压缩DP)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <string
·2015-11-12 09:21

USACO 4.2 Job Processing(贪心)

  1 /* 2 ID: cuizhe 3 LANG: C++ 4 TASK: job 5 */ 6 #include <cstdio>
·2015-11-12 09:20

Codeforces Round #172 (Div. 2) C.Rectangle Puzzle(几何)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <string
·2015-11-12 09:19

Vijos 1100 加分二叉树(树形DP)

1 #include <cstdio> 2 #include <cstring> 3 #include <queue> 4 #include <string
·2015-11-12 09:18

POJ 1275 Cashier Employment(差分约束)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <
·2015-11-12 09:18

USACO 4.2 The Perfect Stall(匈牙利)

1 /* 2 ID: cuizhe 3 LANG: C++ 4 TASK: stall4 5 */ 6 #include <cstdio> 7 #include
·2015-11-12 09:16

USACO 4.1 Cryptcowgraphy(DFS)

View Code /* ID: cuizhe LANG: C++ TASK: cryptcow */ #include <cstdio
·2015-11-12 09:15

NYOJ 536 开心的mdd(区间DP)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <queue
·2015-11-12 09:14

SDUT 2410 Mine Number(DFS)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath&g
·2015-11-12 09:13

POJ 2516 Minimum Cost(最小费用最大流)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #in
·2015-11-12 09:12

POJ 2195 Going Home(最小费用最大流)

1 #include <cstdio> 2 #include <
·2015-11-12 09:11

EK模版（邻接表版本）

 EK邻接表版本 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath>
·2015-11-12 09:11

POJ 1364 King(差分约束)

#include <iostream> #include <cstdio> #include <cmath> #include <cstring>
·2015-11-12 09:10

POJ 3007 Organize Your Train part II(Trie树）

1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include
·2015-11-12 09:06

Codeforces Round #166 (Div. 2)

1 #include <cstdio> 2 #include <cstring>
·2015-11-12 09:04
上一页 61 62 63 64 65 66 67 68 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他