cmath

【HDU1231】How Many Tables（并查集基础题）

3 #include <cstdlib> 4 #include <cstdio> 5 #include <cctype> 6 #include <cmath
·2015-11-11 12:49

TopCoder Training——How To Find a Solution

#include <cstdio>#include <cstring>#include <set>#include <map>#include <cmath
·2015-11-11 12:34

2013-5-3 NEERC 2012, Eastern subregional contest

View Code #include <iostream> #include <cmath> #include <cstring> #include <
·2015-11-11 11:49

whu 1473 - Check the Identity 乱搞

cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<cmath
·2015-11-11 11:35

HDU 4435

iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cmath
·2015-11-11 11:03

HDU 1230 火星A+B

1 #include<cmath> 2 #include<cstdio> 3 #include<cstring> 4 #include<iostream
·2015-11-11 11:16

HDU 4782 Beautiful Soup --模拟

iostream> #include <cstdio> #include <cstring> #include <cstdlib> #include <cmath
·2015-11-11 11:37

UESTC 1080 空心矩阵

代码借鉴了一位大牛的，如下： #include<iostream> #include<cstdio> #include<cmath>
·2015-11-11 11:35

UESTC 1237 质因子分解

#include<iostream> #include<cstdio> #include<cstring> #include<cmath
·2015-11-11 11:32

UESTC 1014 Shot

这题刚开始没想通，结果发现要解方程，代码如下：   #include<iostream> #include<cstdio> #include<cmath
·2015-11-11 11:31

ZOJ 3471 压缩状态DP

0代表未合并，但是我可以先合并前几个，就是说在压缩状态的过程中，状态转移的时候尽量是一个连续量的转化   #include <iostream> #include <cmath
·2015-11-11 11:04

hdu 4597 Play Game (记忆化搜索 区间dp)

    #include<cstdio> #include<cstring> #include<cmath> #include<
·2015-11-11 10:28

UVA - 10891 Game of Sum(记忆化搜索 区间dp)

    #include<cstdio> #include<cstring> #include<cmath> #include<
·2015-11-11 10:27

hdu 5233 Gunner II （stl vector map）

    #include<cstdio> #include<cstring> #include<cmath> #include<
·2015-11-11 10:26

poj 2001 Shortest Prefixes(Trie)

    #include<cstdio> #include<cstring> #include<cmath> #include<
·2015-11-11 10:26

CSU 1588 合并果子（贪心 优先队列）

    #include<cstdio> #include<cstring> #include<cmath> #include<
·2015-11-11 10:25

HDU 4221 Greedy?（贪心）

思路：   #include<cstdio> #include<iostream> #include<cstring> #include<cmath
·2015-11-11 10:24

ACdream 1735 输油管道（排序）

nbsp;   #include<cstdio> #include<iostream> #include<cstring> #include<cmath
·2015-11-11 10:24

HDU 4223 Dynamic Programming?(dp)

题意： 思路：   #include<cstdio> #include<cstring> #include<cmath> #include<
·2015-11-11 10:23

HDU 4584 Building bridges

思路：   #include<cstdio> #include<iostream> #include<cstring> #include<cmath
·2015-11-11 10:22

poj2787 算24

#include <iostream> #include <cmath> using namespace std; int ans=0; void dfs(double
·2015-11-11 10:43

poj2780

<iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath
·2015-11-11 10:27

poj2661

<iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <cmath
·2015-11-11 10:23

HDU 1181 变形课

    #include <iostream>#include <cmath>#include &
·2015-11-11 10:18

HDU 1312 Red and Black （第一道广搜）

求能踩到的.的个数（包括起始点@）   #include <set>#include <map>#include <list>#include <cmath
·2015-11-11 10:12

USACO section1.2 Transformations 方块转换

qiufeih1PROG: transformLANG: C++*/#include <set>#include <map>#include <list>#include <cmath
·2015-11-11 10:07

POJ 3277 City Horizon(扫描线+线段树)

include <cstdio> 2 #include <cstring> 3 #include <string> 4 #include <cmath
·2015-11-11 10:40

POJ 1177 Picture(求周长并)

include <cstdio> 2 #include <cstring> 3 #include <string> 4 #include <cmath
·2015-11-11 10:38

HDU 4618 Palindrome Sub-Array(DP)

; 3 #include <cstring> 4 #include <map> 5 #include <ctime> 6 #include <cmath
·2015-11-11 10:22

HDU 4604 Deque(最长上升子序)

include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:20

POJ 2891 Strange Way to Express Integers(中国剩余定理)

1 #include <cstdio> 2 #include <cstring> 3 #include <map> 4 #include <cmath
·2015-11-11 10:20

POJ 3440 Coin Toss(概率)

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:19

POJ 3071 Football(概率DP)

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:18

POJ 3270 Cow Sorting(置换群)

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:18

POJ 3140 Contestants Division

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:17

UVA 10325 - The Lottery(容斥)

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:16

POJ 1947 Rebuilding Roads(树形DP)

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:14

POJ 3034 Whac-a-Mole(DP)

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:13

POJ 1925 Spiderman(DP)

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:11

Vijos 1061 迎春舞会之三人组舞(DP)

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:10

POJ 1054 The Troublesome Frog

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:09

POJ 1191 棋盘分割(DP)

#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <cmath
·2015-11-11 10:08

poj1247 bjfu1239水题

ben */ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath
·2015-11-11 10:08

hdu 1544 水题

ben */ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath
·2015-11-11 10:59

hdu1792 水题

ben */ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath
·2015-11-11 10:58

hdu 1557暴力枚举

ben */ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath
·2015-11-11 10:57

hdu1113大水题

ben */ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath
·2015-11-11 10:56

hdu 1225大水题

ben */ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath
·2015-11-11 10:56

hdu 1240广搜

ben */ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath
·2015-11-11 10:50

hdu 4472动规水题

ben */ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath
·2015-11-11 10:49
上一页 21 22 23 24 25 26 27 28 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他