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
Mango Weekly Training Round #3 解题报告
#include <iostream> #include <cstdio> #include <cstring> #include <
cmath
>
·
2015-11-11 16:58
round
基础KMP两道
代码: #include <iostream> #include <cstdio> #include <cstring> #include <
cmath
·
2015-11-11 16:57
KMP
HDU 1251 统计难题
代码: #include <iostream> #include <cstdio> #include <cstring> #include <
cmath
·
2015-11-11 16:54
HDU
POJ 2001 Shortest Prefix
代码: #include <iostream> #include <cstdio> #include <cstring> #include <
cmath
·
2015-11-11 16:54
test
POJ 3321 Apple Tree
代码: #include <iostream> #include <cstdio> #include <cstring> #include <
cmath
·
2015-11-11 16:52
apple
HDU 1892 See you~
代码: #include <iostream> #include <cstdio> #include <cstring> #include <
cmath
·
2015-11-11 16:51
HDU
UESTC 1227 & POJ 3667 Hotel
代码: #include <iostream> #include <cstdio> #include <cstring> #include <
cmath
·
2015-11-11 16:34
poj
HDU 1007 Quoit Design
怎么还是错了辣么多次…… #include <cstdio> #include <iostream> #include <algorithm> #include <
cmath
·
2015-11-11 16:21
design
hdu_1007
1 // hdu 1007 2 // 3 // Dec.29 2014 4 5 #include <cstdio> 6 #include <
cmath
>
·
2015-11-11 16:40
HDU
HDU 4585 Shaolin (map)
思路: #include<cstdio> #include<iostream> #include<cstring> #include<
cmath
·
2015-11-11 16:09
map
HDU 4499 Cannon
题意: 思路: #include<cstdio> #include<iostream> #include<cstring> #include<
cmath
·
2015-11-11 16:08
HDU
hdu 4496 D-City(并查集)
cstdio> #include<iostream> #include<cstring> #include<cstdlib> #include<
cmath
·
2015-11-11 16:07
HDU
cf319b Psychos in a Line(单调队列 贪心)
cstdlib> #include<cstring> #include<iostream> #include<algorithm> #include<
cmath
·
2015-11-11 16:03
OS
csu 1584 Train Passengers
nbsp; #include<cstdio> #include<iostream> #include<cstring> #include<
cmath
·
2015-11-11 16:01
in
zoj 3860 Find the Spy(水)
#include<cstdio> #include<iostream> #include<cstring> #include<
cmath
> #include
·
2015-11-11 16:58
find
zoj 3867 Earthstone: Easy Version(模拟)
#include<cstdio> #include<iostream> #include<cstring> #include<
cmath
> #include
·
2015-11-11 16:57
version
zoj 3861 Valid Pattern Lock(全排列 next_permutation 模拟)
#include<cstdio> #include<iostream> #include<cstring> #include<
cmath
> #include
·
2015-11-11 16:57
Pattern
woj 1570 - G - April disease (数论)
cstdio> #include<iostream> #include<cstring> #include<cstdlib> #include<
cmath
·
2015-11-11 16:55
apr
woj 1569 - F - Subtract
#include<cstdio> #include<iostream> #include<cstring> #include<
cmath
> #include
·
2015-11-11 16:55
Trac
woj 1567 - D - Sloth's Angry(贪心)
思路: #include<cstdio> #include<iostream> #include<cstring> #include<
cmath
·
2015-11-11 16:54
贪心
woj 1571 - H - Things after school (数论)
cstdio> #include<iostream> #include<cstring> #include<cstdlib> #include<
cmath
·
2015-11-11 16:53
AFTER
woj 1566 Spanning Tree (KRU)
nbsp; #include<cstdio> #include<iostream> #include<cstring> #include<
cmath
·
2015-11-11 16:53
tree
woj 1565 - B - Magic (贪心+dp)
cstdio> #include<iostream> #include<cstring> #include<cstdlib> #include<
cmath
·
2015-11-11 16:52
dp
csu 1556: Jerry's trouble(大数取模)
直接套用模板 #include<cstdio> #include<iostream> #include<cstring> #include<
cmath
·
2015-11-11 16:46
tr
csu 1538: Shopping(贪心)
#include<iostream> #include<cstdio> #include<cstring> #include<
cmath
> #include
·
2015-11-11 16:42
ping
fzu 2148 Moon Game(计算几何)
cid=134&sortid=9 #include<cstdio> #include<
cmath
> #include<cstring>
·
2015-11-11 16:39
game
hdu 1421 搬寝室(dp)
#include<cstdio> #include<
cmath
> #include<cstring> #include<iostream> #include
·
2015-11-11 16:39
HDU
csu 1530: Gold Rush(贪心)
id=97234 #include<cstdio> #include<
cmath
> #include<cstring> #include<
·
2015-11-11 16:37
Go
hdu 2844 coins (多重背包)
#include<cstdio> #include<cstring> #include<
cmath
> #include<iostream> #include
·
2015-11-11 16:35
HDU
hdu 2102 A计划(bfs)
之前没有考虑到 两层都是 # 的情况 #include<cstdio> #include<
cmath
> #include<stdio.h
·
2015-11-11 16:31
HDU
HDU 1702 ACboy needs your help again!(栈 队列 基础)
#include<cstdio> #include<
cmath
> #include<queue> #include<stack> #include
·
2015-11-11 16:30
help
Codeforces Beta Round #98 (Div. 2)(A-E)
4 #include<algorithm> 5 #include<stdlib.h> 6 #include<vector> 7 #include<
cmath
·
2015-11-11 16:25
codeforces
poj2502
<iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <
cmath
·
2015-11-11 15:01
poj
poj1751
lt;cstdlib>#include <cstring>#include <cstdio>#include <algorithm>#include <
cmath
·
2015-11-11 15:52
poj
poj1650
<iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <
cmath
·
2015-11-11 15:48
poj
母函数模板
*/ #include <set> #include <map> #include <list> #include <
cmath
> #include
·
2015-11-11 15:07
函数
uva 11524 - InCircle (二分法)
#include<iostream> #include<iomanip> #include<algorithm> #include<
cmath
·
2015-11-11 15:06
二分法
POJ1083-Moving Tables
View Code #include <iostream> #include <
cmath
> #include <cstring> using namespace
·
2015-11-11 15:52
table
[poj][2600][Geometrical dreams]
View Code #include <cstdio> #include <
cmath
> #include <algorithm> #define dis
·
2015-11-11 15:05
poj
[poj][3301][Texas Trip]
id=3301 View Code #include <cstdio> #include <
cmath
> #include <cstring> #include
·
2015-11-11 15:03
poj
HDU 4267 A Simple Problem with Integers(树状数组)
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #include <algorithm
·
2015-11-11 15:05
Integer
HDU 3874 Necklace(离线算法+树状数组)
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #incl
·
2015-11-11 15:04
树状数组
USACO 5.1 Fencing the Cows(凸包)
: C++ 4 TASK: fc 5 */ 6 #include <cstdio> 7 #include <cstring> 8 #include <
cmath
·
2015-11-11 15:50
USACO
POJ 1151 Atlantis(离散化+暴力)
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #include <algorithm
·
2015-11-11 15:46
ant
POJ 3368 Frequent values(rmq)
1 #include <iostream> 2 #include <cstring> 3 #include <
cmath
> 4 #include <
·
2015-11-11 15:43
value
POJ 3264 Balanced Lineup(RMQ模版)
1 #include <iostream> 2 #include <cstring> 3 #include <
cmath
> 4 #include <
·
2015-11-11 15:42
poj
POJ 3308 Paratroopers(最小点权覆盖+dinic算法)
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #include <
·
2015-11-11 15:40
dinic
POJ 2817 WordStack(状态压缩DP)
1 #include <cstdio> 2 #include <cstring> 3 #include <
cmath
> 4 #include <iostream
·
2015-11-11 15:36
stack
USACO 4.2 Cowcycles(DFS)
TASK: cowcycle 5 */ 6 #include <cstdio> 7 #include <cstring> 8 #include <
cmath
·
2015-11-11 15:31
USACO
USACO 4.3 Buy Low, Buy Lower(dp)
2 ID:cuizhe 3 LANG: C++ 4 TASK: buylow 5 */ 6 #include <cstdio> 7 #include <
cmath
·
2015-11-11 15:30
USACO
上一页
18
19
20
21
22
23
24
25
下一页
按字母分类:
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
其他