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 2508
#include<cstdio> #include<cstring> #include<algorithm> #include<
cmath
> using
·
2015-11-13 04:02
poj
poj1920 Towers of Hanoi
,记住一个结论是,转移n个盘子至少需要2^n-1步 #include<iostream> #include<cstdio> #include<
cmath
·
2015-11-13 04:19
poj
UVA 10034 - Freckles
#include<iostream>#include<list>#include<
cmath
>#in
·
2015-11-13 04:17
uva
hdu 4310 Hero
iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<
cmath
·
2015-11-13 04:40
HDU
hdu1251(Trie树)
#include <iostream> #include <cstdio> #include <
cmath
> #include <cstdlib>
·
2015-11-13 04:35
trie
SCU 2009(数位dp)
#include <iostream> #include <cstdio> #include <
cmath
·
2015-11-13 04:34
dp
hdu1054(最小顶点覆盖)
#include <cstdio> #include <cstring> #include <string> #include <
cmath
> #
·
2015-11-13 04:01
HDU
hdu2063+hdu1083(最大匹配数)
nbsp; #include <cstdio> #include <cstring> #include <string> #include <
cmath
·
2015-11-13 04:00
HDU
uva796(求桥数目)
#include <cstdio> #include <cstring> #include <string> #include <
cmath
> #
·
2015-11-13 04:50
uva
uva315(求割点数目)
#include <cstdio> #include <cstring> #include <string> #include <
cmath
> #
·
2015-11-13 04:49
uva
hdu4223(dp)
#include <cstdio> #include <cstring> #include <
cmath
> #include <algorithm
·
2015-11-13 04:48
HDU
hdu 4736 This Is The Job The Bear Finds(2013年成都ACM网络赛)
// Time 1718 ms; Memory 1500 K #include<iostream> #include<cstdio> #include<
cmath
>
·
2015-11-13 04:18
find
POJ 2031 Building a Space Station
也是裸的最小生成树 注意距离不会小于0 就是两个空间站相交的时候 #include<cstdio> #include<cstring> #include<
cmath
·
2015-11-13 03:57
Build
hdu 畅通工程再续
pid=1875 1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4
·
2015-11-13 03:15
HDU
hdu 1162 Eddy's picture
#include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <
cmath
·
2015-11-13 03:10
HDU
hdu Examining the Rooms
j-1]+(i-1)*a[i-1][j]; 1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
·
2015-11-13 03:07
oom
hdu Big Number
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 using namespace
·
2015-11-13 03:06
number
hdu Fibonacci
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #include <algorithm
·
2015-11-13 03:05
fibonacci
hdu 2106 decimal system
include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #include <
cmath
·
2015-11-13 03:02
System
poj 3792 Area of Polycubes
id=3792 1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #
·
2015-11-13 03:59
cube
ural 1073. Square Country
space=1&num=1073 1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
·
2015-11-13 03:57
count
Poj 3246 Balanced Lineup(线段树基础)
继续理解基础线段树 #include <iostream> #include <algorithm> #include <
cmath
>
·
2015-11-13 03:42
poj
HDU 1060 Leftmost Digit
#include <iostream> #include <cstdio> #include <cstdlib> #include <
cmath
·
2015-11-13 03:24
left
POJ 1046 Color Me Less
22:34:22 */ #include<cstdio> #include<cstring> #include<cstdlib> #include<
cmath
·
2015-11-13 03:10
color
UVA 10803 - Thunder Mountain
#include<cstdio>#include<cstring>#include<cstdlib>#include<
cmath
>const int INF
·
2015-11-13 03:44
mountain
UVA 10341 - Solve It
#include<cstdio>#include<cstdlib>#include<
cmath
>const double T = 10e-8;double p,
·
2015-11-13 03:39
uva
UVA 10161 - Ant on a Chessboard
#include<cstdio>#include<
cmath
>int n ,s ,a;int x, y;int main(){ while( scanf( "%d
·
2015-11-13 03:22
ant
D - 买糖果
#include <cstdio> 3 #include <cstdlib> 4 #include <cstring> 5 #include <
cmath
·
2015-11-13 03:39
HDU 3622 Bomb Game 二分+2-SAT
#include <cstdio> #include <cstring> #include <cstdlib> #include <
cmath
·
2015-11-13 03:26
game
ZOJ 3717 Balloon ( TLE )
#include <cstdio> #include <cstring> #include <cstdlib> #include <
cmath
>
·
2015-11-13 03:20
ZOJ
CF 8D Two Friends 三分再三分
代碼如下 #include <set> #include <map> #include <
cmath
> #include <queue
·
2015-11-13 03:34
IE
hoj 1004 Prime Palindromes 回文素数
是回文素数以外,其他均可被11整除并且是合数, 然后就枚举1位3位5位7位9位数的数,然后判断是否为素数即可 */ #include <iostream> #include <
cmath
·
2015-11-13 03:12
Prim
HDU 4027 Can you answer these queries?
仿hh风格的线段树,真漂亮啊 View Code #include <iostream> #include <
cmath
> using namespace std
·
2015-11-13 02:46
HDU
poj 3468 A Simple Problem with Integers
#include<cstdio> #include<cstdlib> #include<
cmath
> #include<cs
·
2015-11-13 02:52
Integer
poj 2886Who Gets the Most Candies?
我的代码如下: #include<cstdio> #include<cstdlib> #include<
cmath
> #include<memory.h
·
2015-11-13 02:50
get
XMU-1349 xmu_1349
直接模拟: #include<cstdio> #include<cstdlib> #include<
cmath
> int a[40010]; int m
·
2015-11-13 02:49
poj 1987 树的分治
iostream> #include<cstring> #include<algorithm> #include<cstdio> #include<
cmath
·
2015-11-13 02:04
poj
poj 1741 树的分治
iostream> #include<cstring> #include<algorithm> #include<cstdio> #include<
cmath
·
2015-11-13 02:03
poj
hdu 4251 划分树
思路:裸的划分树 #include<iostream> #include<algorithm> #include<cstdio> #include<
cmath
·
2015-11-13 02:53
HDU
hdu 3473 裸的划分树
algorithm> #include<cstring> #include<cstdio> #include<algorithm> #include<
cmath
·
2015-11-13 02:52
HDU
hdu 2665 划分树
algorithm> #include<cstring> #include<cstdio> #include<algorithm> #include<
cmath
·
2015-11-13 02:52
HDU
hdu 4417 划分树
#include<iostream> #include<algorithm> #include<cstdio> #include<
cmath
> #
·
2015-11-13 02:51
HDU
hdu 3622 二分+2-SAT判定
iostream> #include<algorithm> #include<cstring> #include<cstdio> #include<
cmath
·
2015-11-13 02:42
HDU
poj 3264 RMQ
iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<
cmath
·
2015-11-13 02:26
poj
hdu 4009 最小树形图
iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<
cmath
·
2015-11-13 02:23
HDU
poj 3678 2-SAT问题
iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<
cmath
·
2015-11-13 02:20
poj
hdu 4614 线段树
iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<
cmath
·
2015-11-13 02:18
HDU
poj 3164 最小树形图
就是裸的最小树形图~ #include<iostream> #include<cstdio> #include<cstring> #include<
cmath
·
2015-11-13 02:16
poj
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
差分约束
上一页
9
10
11
12
13
14
15
16
下一页
按字母分类:
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
其他