cmath

UVa 10791 Minimum Sum LCM（素因子分解）

#include <cstdio> #include <cstring> #include <cstring> #include <cmath>
·2015-11-12 20:30

HDU 2087 剪花布条 KMP

  #include <iostream> #include <cstdio> #include <cstdlib> #include <cmath
·2015-11-12 20:57

UVa10397_Connect the Campus(最小生成树)(小白书图论专题)

0，求最小生成树 #include <iostream> #include <cstdio> #include <cstring> #include <cmath
·2015-11-12 20:10

HDU 2178 猜数字

#include <cstdio> #include <cmath> int main() { int t; scanf("%d",
·2015-11-12 20:20

HDU 1597 find the nth digit

*(x)/2解出向下取整，再计算出n在该串中位置，模9输出即可： #include <iostream> #include <cstdio> #include <cmath
·2015-11-12 20:17

HDU 2289 Cup

如果知道水面的高度，则直接可以算出水的体积，我们知道水的高度必然在0到最大高度之间，于是在这个区间内进行二分检索即可： #include <cstdio> #include <cmath
·2015-11-12 20:15

HDU 2899 Strange fuction

还没学过导数，不会做…… #include <iostream> #include <cmath> using namespace std; //先求导函数,可知f
·2015-11-12 20:11

HDU 2199 Can you solve this equation?

题解：二分求解 #include <cstdio> #include <cmath> using namespace std; double f(double x)
·2015-11-12 20:10

HDU 1018 Big Number

+1=log10(1)+log10(2)+log10(3)+……+1； #include <cstdio> #include <cmath> int main(){
·2015-11-12 20:47

codeforces C. k-Tree

include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #include <cmath
·2015-11-12 20:14

codeforces C. Triangle

1 #include <cstdio> 2 #include <cmath> 3 #include <cstring> 4 #include <algorithm
·2015-11-12 20:04

Cylinder

1 #include <cstdio> 2 #include <cmath> 3 #include <cstring> 4 #include <algor
·2015-11-12 20:59

hdu 5120 Intersection

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <algorithm
·2015-11-12 20:39

hdu 5144 NPY and shot

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #inclu
·2015-11-12 20:30

Area

1 #include<cstdio> 2 #include<istream> 3 #include<algorithm> 4 #include<cmath
·2015-11-12 20:22

后缀数组模板

cstdio> #include <vector> #include <cstring> #include <string> #include <cmath
·2015-11-12 19:59

HDU 4620 Fruit Ninja Extreme(2013多校第二场 剪枝搜索)

如果当前连续切割数加上剩余的所有切割数没有现存的最优解多的话，不需要继续搜索了   #include <cstdio> #include <iostream> #include <cmath
·2015-11-12 19:45

[wc2013]糖果公园(70分)

#include <cstdio> #include <cstdlib> #include <cmath> #include <cstring>
·2015-11-12 18:59

HDU 4864

iostream> #include <cstdio> #include <cstring> #include <set> #include <cmath
·2015-11-12 18:40

HDU 4862

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

高斯消元

#include <iostream> #include <cmath> #include <cstdio> #include <cstring>
·2015-11-12 18:29

计算几何基本函数

#include <iostream> #include <cstdio> #include <cstring> #include <cmath>
·2015-11-12 18:22

lca

iostream> #include <cstdio> #include <cstring> #include <vector> #include <cmath
·2015-11-12 18:21

平面最近点对

> #include <cstring> #include <algorithm> #include <iostream> #include <cmath
·2015-11-12 18:20

HDU 1847 Good Luck in CET-4 Everybody!

j-A[i]是必败态，j就是必胜态，显然0必败，一个dp的过程 #include <iostream> #include <cstdio> #include <cmath
·2015-11-12 18:02

hust 1605 bfs

#include<map> #include<queue> #include<vector> #include<cmath> #include<
·2015-11-12 18:33

2013 ACMICPC 杭州现场赛 I题

#include<iostream> #include<cstring> #include<algorithm> #include<cmath>
·2015-11-12 18:32

2013年 ACMICPC 杭州赛区H题

  #include<cstdio> #include<cstring> #include<cmath> #include<iostream
·2015-11-12 18:31

hdu 2993 斜率dp

#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #
·2015-11-12 18:30

hdu 3717 二分+队列维护

#include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #include
·2015-11-12 18:29

hdu 3507 斜率dp

cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<cmath
·2015-11-12 18:28

ural 1993 This cheeseburger you don't need

iostream> #include <cstring> #include <string> #include <cstdio> #include <cmath
·2015-11-12 18:04

ural 1998 The old Padawan

iostream> #include <cstring> #include <string> #include <cstdio> #include <cmath
·2015-11-12 18:02

poj3273Monthly Expense

2 #include<cstdio> 3 #include<cstring> 4 #include<stdlib.h> 5 #include<cmath
·2015-11-12 18:08

poj3122Pie

2 #include<cstdio> 3 #include<cstring> 4 #include<stdlib.h> 5 #include<cmath
·2015-11-12 18:07

poj3258River Hopscotch

2 #include<cstdio> 3 #include<cstring> 4 #include<stdlib.h> 5 #include<cmath
·2015-11-12 18:07

poj2536

<iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <cmath
·2015-11-12 17:58

poj2007

<iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <cmath
·2015-11-12 17:52

poj3737

<iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath
·2015-11-12 17:38

hdu 4741 Save Labman No.004 [2013年杭州ACM网络赛]

// Time 234 ms; Memory 244 K #include<iostream> #include<cstdio> #include<cmath>
·2015-11-12 17:51

HDU 4740 The Donkey of Gui Zhou (模拟)

  #include <iostream> #include <algorithm> #include <cmath
·2015-11-12 17:29

poj 1328 Radar Installation_贪心

：给你n个点 m为圆的半径，问需要多少个圆能把全部点圈到 #include <iostream> #include <algorithm> #include <cmath
·2015-11-12 17:26

poj 1083 Moving Tables_dp

#include <iostream> #include<cstdio> #include<cmath> #inc
·2015-11-12 17:08

uva 10382 Watering Grass_贪心

后来发现可以把圆看做区间（能把矩形面积覆盖），然后这个问题就容易解决了 #include <iostream> #include<cstdio> #include<cmath
·2015-11-12 17:46

uva 10245 The Closest Pair Problem_枚举

题意：求任意两点之间的距离的最少一个距离 思路：枚举一下就可以了 #include <iostream> #include<cstdio> #include<cmath
·2015-11-12 17:45

uva 10041 Vito's Family_贪心

#include <iostream> #include<cstdio> #include<algorithm> #include<cmath> using
·2015-11-12 17:44

Hopcroft-Karp算法模版

<cstring> #include <vector> #include <queue> #include <stack> #include <cmath
·2015-11-12 17:33

{HDU}{4190}{Distributing Ballot Boxes}{二分答案}

cstring> #include <cstdio> #include <algorithm> #include <memory> #include <cmath
·2015-11-12 17:53

POJ 3988 Selecting Courses (Greedy)

#include <iostream> #include <string> #include <cmath> #include <
·2015-11-12 17:51

namespace解决名字冲突

1 //header_one.h 2 #include <string> 3 #include <cmath> 4 5 using namespace std; 6 7 namespace
·2015-11-12 17:57
上一页 13 14 15 16 17 18 19 20 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他