E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
cmath
POJ 3988 Selecting Courses (Greedy)
#include <iostream> #include <string> #include <
cmath
> #include <
·
2015-11-12 17:51
select
namespace解决名字冲突
1 //header_one.h 2 #include <string> 3 #include <
cmath
> 4 5 using namespace std; 6 7 namespace
·
2015-11-12 17:57
namespace
poj2864
1 #include<iostream> 2 #include<cstdio> 3 #include<
cmath
> 4 using namespace
·
2015-11-12 17:35
poj
HDU 5097 Page Rank (模拟)
#include<cstdio> #include<
cmath
> #include<cstring> #include<algorithm> const
·
2015-11-12 17:27
rank
UVA 12901 Refraction 折射 (物理姿势)
似乎精度要求很低,直接用角度算也可以 #include<cstdio> #include<
cmath
> int main() { int T;
·
2015-11-12 17:19
action
HDU 3746 Cyclic Nacklace KMP
#include <iostream> #include <cstdio> #include <cstdlib> #include <
cmath
·
2015-11-12 17:14
HDU
CF 191 div2
iostream> #include <cstdio> #include <algorithm> #include <string> #include <
cmath
·
2015-11-12 17:10
div
HDU 1358 Period KMP
#include <iostream> #include <cstdio> #include <cstdlib> #include <
cmath
·
2015-11-12 17:06
HDU
poj 3269 Building A New Barn
iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <
cmath
·
2015-11-12 16:12
Build
poj 1195 Mobile phones(二维树状数组)
#include <cstdio> 6 #include <cstdlib> 7 #include <iostream> 8 #include <
cmath
·
2015-11-12 16:39
mobile
hdu 4027 Can you answer these queries?
1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring> 4 #include<
cmath
·
2015-11-12 16:32
HDU
poj 2239 Selecting Courses
#include <cstdio> 6 #include <cstdlib> 7 #include <iostream> 8 #include <
cmath
·
2015-11-12 16:28
select
poj 3348 Cows
#include <cstdio> 6 #include <cstdlib> 7 #include <iostream> 8 #include <
cmath
·
2015-11-12 16:27
poj
poj 1113 Wall
#include <cstdio> 6 #include <cstdlib> 7 #include <iostream> 8 #include <
cmath
·
2015-11-12 16:27
poj
HDU 3571 N-dimensional Sphere
高斯消元,今天数学死了无数次…… #include <cstdio> #include <cstring> #include <
cmath
> #include
·
2015-11-12 16:21
HDU
HDU 2451 Simple Addition Expression
题解:排列组合分类讨论即可…… #include <cstdio> #include <
cmath
> #include <cstr
·
2015-11-12 16:20
express
HDU 3589 Jacobi symbol
彻底对数学绝望了 #include <cstdio> #include <
cmath
> int flag[1005],p[500],a; int d[100]; int
·
2015-11-12 16:19
jacob
HDU 3307 Description has only two Sentences
#include <cstring> #include <algorithm> #include <iostream> #include <
cmath
·
2015-11-12 16:18
script
HDU 1348 Wall
题解:计算凸包周长 #include <iostream> #include <
cmath
> #include <algorithm> const int
·
2015-11-12 16:13
HDU
HDU 2215 Maple trees
增量法的最小包围圈算法,不会…… #include <cstdio> #include <cstring> #include <iostream> #include <
cmath
·
2015-11-12 16:12
tree
HDU 2202 最大三角形
题解:先算出凸包,然后枚举凸包上的点计算即可 #include <cstdio> #include <
cmath
> #include <cstdlib> #include
·
2015-11-12 16:12
HDU
HDU 1392 Surround the Trees
#include <cstdio> #include <cstring> #include <algorithm> #include <
cmath
·
2015-11-12 16:10
round
HDU 1162 Eddy's picture
Prim算法 #include <iostream> #include <cstring> #include <
cmath
> int n; double map
·
2015-11-12 16:49
HDU
POJ 1584(计算几何初步——凸包判断,圆与多边形,点是否在多边形内)
View Code 1 #include<iostream> 2 #include<
cmath
>
·
2015-11-12 16:55
poj
计算几何初步——图论加线段相交。。。。
View Code 1 #include<iostream> 2 #include<
cmath
> 3 #define
·
2015-11-12 16:51
图论
POJ 3304(计算几何初步——判断线段和直线相交,加上枚举)
View Code 1 #include<iostream> 2 #include<
cmath
> 3 #define EPS 1e-8 4 #define MAXN 104
·
2015-11-12 16:46
poj
HDU5036 Explosion(期望&&bitset)
string> #include <vector> #include <cstdio> #include <algorithm> #include <
cmath
·
2015-11-12 16:19
bitset
HDU 2896 病毒侵袭 (AC自动机)
#include <cstdio> #include <iostream> #include <cstring> #include <
cmath
·
2015-11-12 16:57
AC自动机
hdu 4288 (成都赛区2012网络赛)
#include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <
cmath
·
2015-11-12 15:53
2012
TSP问题_遗传算法(STL大量使用)
include<vector> #include<algorithm>//random_shuffle();sort();lower_bound(); #include<
cmath
·
2015-11-12 15:26
STL
杭电 3400 Line belt 解题报告
看代码应该更清晰一点~ #include<iostream> #include<
cmath
> using namespace std; const double eps
·
2015-11-12 15:00
400
杭电 2438 Turn the corner 解题报告
直接暴力,代码如下: #include<iostream> #include<
cmath
&g
·
2015-11-12 15:58
杭电
FZU 2150 Fire Game --两点同步搜索
代码: #include <iostream> #include <cstdio> #include <cstring> #include <
cmath
·
2015-11-12 14:45
game
dancing link模板
include<iostream> 3 #include<cstring> 4 #include<algorithm> 5 #include<
cmath
·
2015-11-12 14:35
link
凸包---HDU 2202
注意精度:不然OJ上面会超时的 #include<iostream> #include<
cmath
> #include<cstdio> #include
·
2015-11-12 14:24
HDU
POJ 1062 昂贵的聘礼
id=1062 AC代码 #include<iostream> #include<algorithm> #include<
cmath
>
·
2015-11-12 14:03
poj
URAL1049. Brave Balloonists
#include<cstring> 4 #include<algorithm> 5 #include<stdlib.h> 6 #include<
cmath
·
2015-11-12 14:04
OO
hdu2795线段树
kevin_samuel(fenice) //以h离散化构建线段树 #include <iostream> #include <cstdio> #include <
cmath
·
2015-11-12 13:44
HDU
poj2959
<iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <
cmath
·
2015-11-12 13:01
poj
poj2610
<iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <
cmath
·
2015-11-12 13:52
poj
Poj 2187 Beauty Contest_旋转凸包卡壳
求最远的两点距离 思路:用凸包算法求处,各个定点,再用旋转凸包卡壳 #include <iostream> #include <cstdio> #include <
cmath
·
2015-11-12 13:21
test
hdu 2202 最大三角形_凸包模板
题意:略 思路:直接套用凸包模板 #include <iostream> #include <cstdio> #include <
cmath
> #include
·
2015-11-12 13:19
HDU
POJ 1094 Sorting It All Out(拓扑排序)
include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <
cmath
·
2015-11-12 13:41
sort
POJ 3687 Labeling Balls(拓扑排序)
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 using namespa
·
2015-11-12 13:41
label
USACO 3.3 Home on the Range(最大子矩阵问题)
#include <iostream> 7 #include <cstdio> 8 #include <cstring> 9 #include <
cmath
·
2015-11-12 13:39
USACO
POJ 3083 Children of the Candy Corn
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #include <
·
2015-11-12 13:37
children
POJ 1860 Currency Exchange(SPFA)
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #include <queue
·
2015-11-12 13:36
Exchange
POJ 1062 昂贵的聘礼
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #include <iostream
·
2015-11-12 13:36
poj
POJ 2996 Help Me with the Game(模拟)
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 using namespace
·
2015-11-12 13:33
with
POJ 2993 Emag eht htiw Em Pleh(模拟)
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 using namespace
·
2015-11-12 13:32
poj
上一页
14
15
16
17
18
19
20
21
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他