cmath

hdu 4614 线段树

iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath
·2015-11-13 02:18

poj 3164 最小树形图

就是裸的最小树形图~ #include<iostream> #include<cstdio> #include<cstring> #include<cmath
·2015-11-13 02:16

2013 南京理工大学邀请赛B题

iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath
·2015-11-13 02:08

poj 1716 差分约束

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

poj 3159 差分约束

iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath
·2015-11-13 02:01

hdu 1518 深搜

iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath
·2015-11-13 02:49

几道字典树题目

  #include <iostream> #include <algorithm> #include <cmath> #include <cstdio
·2015-11-13 02:04

hdu 2080

  #include <cstdio> #include <cstring> #include <algorithm> #include <cmath
·2015-11-13 02:10

poj2365

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

poj1877

<iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath
·2015-11-13 02:09

uva 11796 - Dog Distance

#include<iostream> #include<cstdio> #include<cmath> #define eps 1e-8 #define max
·2015-11-13 02:11

nyoj 216 A problem is easy

#include<iostream> #include<cmath> using namespace std; int main() { int T, N, t, count
·2015-11-13 01:30

UVA 1411 - Ants(二分图完美匹配）

这种话，相交肯定比不相交权值小，所以做一次完美匹配就能够了 代码： #include <cstdio> #include <cstring> #include <cmath
·2015-11-13 01:45

NYOJ 294 Bot Trust

把情况考虑全面： “Both robots know the full sequence in advance”   #include <iostream> #include<cmath
·2015-11-13 01:05

NYOJ 456 邮票分你一半

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

Acdream Mengzhu

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

ural 1119 Metro

1 #include <cstdio> 2 #include <cstring> 3 #include <queue> 4 #include <cmath
·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 1348 Goat in the Garden 2

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

ural 1207 Median on the Plane

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

ural 1640 Circle of Winter

至少有一个点在这个圆上，其他点不能在圆外，半径不定； 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath
·2015-11-13 01:52

ural 1874 Football Goal

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

ural 1572 Yekaterinozavodsk Great Well

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

ural 1084 Goat in the Garden

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

ural 1192 Ball in a Dream

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

ural 1020 Rope

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

poj 3277 Mountains

id=3227 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #
·2015-11-13 01:41

poj 3130 How I Mathematician Wonder What You Are!

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

poj 1819 Disks

id=1819 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #
·2015-11-13 01:39

poj 3335 Rotating Scoreboard

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

poj 1066 Treasure Hunt

id=1066 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath>
·2015-11-13 01:38

uva 10548 - Find the Right Changes(拓展欧几里得)

#include <cstdio> #include <cstring> #include <cmath> #include &l
·2015-11-13 00:45

hdu 4738 桥

#include <set> #include <map> #include <list> #include <cmath> #include &
·2015-11-13 00:30

uva 10763 Foreign Exchange

最後判斷是否a[i]==i   #include <set> #include <map> #include <cmath> #include
·2015-11-13 00:00

POJ2109+二分

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #define
·2015-11-13 00:09

poj3618

#include<iostream> #include<cmath> #include<algorithm> using namespace std; #define
·2015-11-13 00:49

HDU 1806

pid=1806 非常玄妙的rmq问题，这个st算法有点神 #include <iostream> #include <cmath> using namespace
·2015-11-13 00:55

HDU 1374

pid=1374 已知三点坐标，求三点确定的圆的周长 #include <iostream> #include <cmath> #include <algorithm
·2015-11-13 00:49

最长回文字符串

求最长回文字符串： #include<cstdio>#include<cstdlib>#include<cmath>#include<algorithm>
·2015-11-13 00:10

求组合

lt;cstring> #include<cstdio> #include<cstdlib> #include<string> #include<cmath
·2015-11-13 00:22

uva 12587 二分枚举

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:26

poj 1821 动态规划

#include<set> #include<map> #include<cmath&g
·2015-11-13 00:25

poj 3017 单调队列优化动态规划

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:23

hdu 3909 数独扩展

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:22

hdu 3594 仙人掌图

思路：利用它的几条性质 #include<set> #include<map> #include<cmath> #include<queue>
·2015-11-13 00:21

hdu 4744 最小费用流

#include <cstdio> #include <queue> #include <cstring> #include <cmath> #define
·2015-11-13 00:20

hdu 4745 动态规划

#include<set> #include<map> #include<cmath> #include<queue> #inclu
·2015-11-13 00:19

hdu 3966 树链剖分

linker, "/STACK:1024000000,1024000000") #include<set> #include<map> #include<cmath
·2015-11-13 00:18

2013 成都网络赛 1003 1004 1007 1008 1010

  思路： 1003是大水题 #include<set> #include<map> #include<cmath> #include&
·2015-11-13 00:18
上一页 10 11 12 13 14 15 16 17 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他