cstdio

HDU 1253 胜利大逃亡

pid=1253 宽度优先搜索：   #include <iostream> #include<cstdio> #include<queue> #define
·2015-11-13 01:05

NYOJ 456 邮票分你一半

; 价值与重量相等的01背包..背包的容量为邮票总和的一半   #include <iostream> #include<cmath> #include<cstdio
·2015-11-13 01:03

HDU 1879 继续畅通工程

并查集+优先队列...用cin会超时...TLE了好几次 #include <iostream> #include<queue> #include<cstdio
·2015-11-13 01:57

HDU 3371 Connect the Cities

注意有重边的情况 #include <iostream> #include<queue> #include<cstdio> #define MAX_N 505
·2015-11-13 01:54

poj 3252 Round Numbers

1 #include <cstdio> 2 #include <cstring> 3 #include
·2015-11-13 01:34

hdu 2079 选课时间(题目已修改,注意读题)

pid=2079 背包 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm&
·2015-11-13 01:33

poj 2955 Brackets

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4
·2015-11-13 01:32

hdu 4810 Wall Painting

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using
·2015-11-13 01:32

hdu 2476 String painter

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm&
·2015-11-13 01:31

hdu 4856 Tunnels

1 #include <cstdio> 2 #include <queue> 3 #include <cstring> 4
·2015-11-13 01:30

hdu 3001 Travelling

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #def
·2015-11-13 01:29

hdu 1171 Big Event in HDU

1 #include <cstdio> 2 #include <cstring> 3 #include <algor
·2015-11-13 01:28

hdu 1074 Doing Homework

1 #include <cstdio> 2 #include <cstring>
·2015-11-13 01:27

hdu 4544 湫湫系列故事——消灭兔子

1 #include <cstdio> 2 #include <queue> 3 #include <cstring> 4 #include <iostream
·2015-11-13 01:27

hdu 4541 Ten Googol

pid=4541 打表找规律 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 01:26

hdu 4540 威威猫系列故事——打地鼠

1 #include <cstdio> 2 #include <cstri
·2015-11-13 01:25

hdu 4535 吉哥系列故事——礼尚往来

pid=4535    错排公式：a[i]=(i-1)*(a[i-2]+a[i-1])； 1 #include <cstdio> 2 #include
·2015-11-13 01:25

uva 10036 Problem C: Divisibility

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn
·2015-11-13 01:24

uva 10034 Problem A: Freckles

1 #include <cstdio> 2 #include <cstring> 3 #include <cma
·2015-11-13 01:23

uva 10032 Problem F: Tug of War

option=com_onlinejudge&Itemid=8&page=show_problem&problem=973 1 #include <cstdio
·2015-11-13 01:22

uva 10026 Problem C: Edit Step Ladders

1 #include <cstdio>
·2015-11-13 01:22

uva 10026 Shoemaker's Problem

1 #include <cstdio> 2 #include <cstring> 3 #inclu
·2015-11-13 01:21

uva 10025 The ? 1 ? 2 ? ... ? n = k problem

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <
·2015-11-13 01:20

uva 10020 Minimal coverage

1 #include <cstdio> 2 #include <cstring> 3 #in
·2015-11-13 01:20

hdu 1050 Moving Tables

  1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-13 01:17

uva 10006 Carmichael Numbers

1 #include <cstdio> 2 #include <cstring> 3 #include &
·2015-11-13 01:16

Acdream Mengzhu

pid=1006 1 #include <cstdio> 2 #include <cmath> 3 #include <cstring> 4
·2015-11-13 01:15

Acdream a + b

pid=1007 两个 long long 相乘会超long long 1 #include <cstdio> 2 #include <cstring> 3
·2015-11-13 01:14

poj 3669 Meteor Shower

1 #include <cstdio> 2 #include <cstring> 3 #include <que
·2015-11-13 01:13

poj 3107 Godfather

id=3107 树形dp 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 01:13

poj 3232 Accelerator

1 #include <cstdio> 2 #include <cstring
·2015-11-13 01:12

poj 3628 Bookshelf 2

id=3628 01背包 1 #include <cstdio> 2 #include <iostream> 3 #include <cstring&
·2015-11-13 01:11

cf C. Maze

http://codeforces.com/problemset/problem/378/C 1 #include <cstdio> 2 #include <cstring
·2015-11-13 01:10

cf B. Fox Dividing Cheese

http://codeforces.com/contest/371/problem/B 1 #include <cstdio> 2 #include <iostream
·2015-11-13 01:09

hdu Children’s Queue

chapterid=3&sectionid=1&problemid=10 1 #include <cstdio> 2 #include <cstring
·2015-11-13 01:08

cf C. Mittens

1 #include <cstdio> 2 #include <cstring> 3 #inc
·2015-11-13 01:07

cf B. Berland Bingo

1 #include <cstdio> 2 #include <cstring> 3 #
·2015-11-13 01:06

ural 1353. Milliard Vasya's Function

space=1&num=1353 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 01:05

ural 1203. Scientific Conference

space=1&num=1203 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 01:05

ural 1146. Maximum Sum

space=1&num=1146 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 01:04

ural 1019 Line Painting

space=1&num=1019 1 #include <cstdio> 2 #include <cstring> 3 #include <
·2015-11-13 01:03

ural 1246. Tethered Dog

space=1&num=1246 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 01:03

ural 1119 Metro

space=1&num=1119 1 #include <cstdio> 2 #include <cstring> 3 #include <queue
·2015-11-13 01:02

ural 1215 Exactness of Projectile Hit

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

ural 1294 Mars Satellites

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

ural 1333 Genie Bomber 2

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn
·2015-11-13 01:00

ural 1090 In the Army Now

space=1&num=1090 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 01:59

ural 1180 Stone Game

space=1&num=1180 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 01:58

hdu 3435 A new Graph Game

pid=3435 1 #include <cstdio> 2 #include <iostream> 3 #include <cstring>
·2015-11-13 01:58

ural 1106 Two Teams

space=1&num=1106 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 01:57
上一页 31 32 33 34 35 36 37 38 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他