cstdlib

POJ 2192 Zipper

0MS C++ 911B 2012-04-22 10:42:42 */ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-13 03:05

POJ 3264 Charm Bracelet

/*Accepted 240K 266MS C++ 563B 2012-04-22 09:13:42 */ #include<cstdio> #include<cstdlib>
·2015-11-13 03:04

COJ 1165(校赛F题) Nearest Numbers

  #include<cstdio> #include<cstring> #include<cstdlib> #define MAXD 1000005
·2015-11-13 03:03

一道关于DOTA的模拟题（CSU2012校赛）

#include<cstdio> #include<cstring> #include<cstdlib> const int bk[] = { 0, 200
·2015-11-13 03:02

COJ 1156 Switching bulbs

ms C++ 1013 B 2012-04-14 21:39:44 */ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-13 03:02

POJ 1258 Agri-Net

16MS C++ 987B 2012-07-23 23:03:38 */ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-13 03:00

POJ 1159 Palindrome

  #include<cstdio> #include<cstring> #include<cstdlib> #define MAXN 5005
·2015-11-13 03:59

POJ 2250 Compromise

0MS C++ 1186B 2012-04-11 11:19:14 */ #include<cstdio> #include<cstring> #include<cstdlib
·2015-11-13 03:58

POJ 1458 Common Subsequence

  /*Accepted 428K 0MS C++ 570B 2012-04-11 10:26:03 */ #include<cstdlib> #include<
·2015-11-13 03:58

POJ 1163 The Triangle

nbsp; /*Accepted 260K 16MS C++ 601B 2012-04-11 10:12:15 */ #include<cstring> #include<cstdlib
·2015-11-13 03:57

POJ 2081 Recaman's Sequence

  #include<cstdio> #include<cstring> #include<cstdlib> bool vis[4000000
·2015-11-13 03:56

POJ 1469 COURSES

#include<cstdio>#include<cstring>#include<cstdlib>#define MAX
·2015-11-13 03:50

hdu 1874 畅通工程续

#include<cstdio>#include<cstring>#include<cstdlib>
·2015-11-13 03:46

UVA 10803 - Thunder Mountain

#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>const int INF
·2015-11-13 03:44

Section 1.3 milk

/*ID:yucept21LANG:C++TASK:milk*/#include<cstdio>#include<cstdlib>#include<cstring>typedef
·2015-11-13 03:43

UVA 108 - Maximum Sum

#include<cstdio>#include<cstring>#include<cstdlib>#define MAXN 110int n, ans;int mat
·2015-11-13 03:41

UVA

#include<cstdio>#include<cstdlib>#include<cstring>int main(){ int a[10];
·2015-11-13 03:41

UVA 11054 - Wine trading in Gergovia

#include<cstdio>#include<cstdlib>#define MAXN 100010int a[MAXN];long long min, w;int n;int
·2015-11-13 03:40

UVA 10341 - Solve It

#include<cstdio>#include<cstdlib>#include<cmath>const double T = 10e-8;double p,
·2015-11-13 03:39

UVA 10878 - Decode the tape

#include<cstdio>#include<cstdlib>#include<cstring>const int exp[] = { 0, 128, 64, 32
·2015-11-13 03:37

UVA 10010 - Where's Waldorf?

#include<cstdio>#include<cstring>#include<cstdlib&g
·2015-11-13 03:36

UVA 644 - Immediate Decodability

#include<cstdio>#include<cstring>#include<cstdlib>#define
·2015-11-13 03:35

UVA 167 - The Sultan's Successors

#include<cstdio>#include<cstdlib&g
·2015-11-13 03:35

UVA 10815 - Andy's First Dictionary

#include<cstdio>#include<cstring>#include<cstdlib>#include<ctype.h>char word[
·2015-11-13 03:34

Section 1.2 dualpal

/*ID:yucept21LANG:C++TASK:dualpal*/#include<cstdio>#include<cstring>#include<cstdlib>
·2015-11-13 03:33

UVA 729 - The Hamming Distance Problem

#include<cstdio>#include<cstring>#include<cstdlib>#include<algorit
·2015-11-13 03:30

UVA 10167 - Birthday Cake

#include<cstdio>#include<cstring>#include<cstdlib>typedef struct coordinate
·2015-11-13 03:28

Section 1.1 ride

  /*ID:yucept21LANG:C++TASK:ride*/#include<cstdio>#include<cstring>#include<cstdlib
·2015-11-13 03:22

POJ 1017-Packets

#include<cstdio>#include<cstring>#include<cstdlib
·2015-11-13 03:21

D - 买糖果

1 #include <iostream> 2 #include <cstdio> 3 #include <cstdlib> 4 #include <
·2015-11-13 03:39

HDU 4417 Super Mario ( 离线树状数组 )

  #include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm
·2015-11-13 03:01

HDU 4027 Can you answer these queries（线段树 + 观察 ）

#include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm>
·2015-11-13 03:59

HDU 4460 Friend Chains ( BFS )

#include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm>
·2015-11-13 03:58

HDU 4474 Yet Another Multiple Problem ( BFS + 同余剪枝 )

#include <cstdio> #include <cstring> #include <cstdlib> const int MAXN = 10100
·2015-11-13 03:57

HDU 4472 Count (DP)

#include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm>
·2015-11-13 03:57

HDU 4346 The Beautiful Road ( 反向考虑 思路题 )

#include <cstdio> #include <cstring> #include <cstdlib> #define LL long long int
·2015-11-13 03:54

URAL 1732. Ministry of Truth ( KMP 多模式串匹配 )

#include <cstdio> #include <cstring> #include <cstdlib> usi
·2015-11-13 03:51

KMP与循环节相关题目

#include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm>
·2015-11-13 03:50

HDU 4747 Mex ( 线段树好题 + 思路 )

#include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm>
·2015-11-13 03:40

HDU 4741 Save Labman No.004 ( 三维计算几何 空间异面直线距离 )

2.两条直线可能相交   #include <cstdio> #include <cstdlib> #include <cstring> #include
·2015-11-13 03:39

HDU 3577 Fast Arrangement ( 线段树 成段更新 区间最值 区间最大覆盖次数 )

#include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm>
·2015-11-13 03:37

UVa 11806 - Cheerleaders (组合计数+容斥原理)

《训练指南》p.108 #include <cstdio> #include <cstring> #include <cstdlib> using namespace
·2015-11-13 03:35

UVa 1326 - Jurassic Remains(枚举子集+中途相遇法)

训练指南p.59 #include <cstdio> #include <cstring> #include <cstdlib> #include <
·2015-11-13 03:32

HDU 4699 Editor（双向链表）

  #include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm
·2015-11-13 03:30

UVa 11374 - Airport Express ( dijkstra预处理 )

min( d1[a] + cost(a, b) + d2[b] ); #include <cstdio> #include <cstring> #include <cstdlib
·2015-11-13 03:30

UVa 10870 - Recurrences 矩阵快速幂

#include <cstdio> #include <cstring> #include <cstdlib> #define LL long long int
·2015-11-13 03:28

HDU 3622 Bomb Game 二分+2-SAT

  #include <cstdio> #include <cstring> #include <cstdlib> #include <cmath
·2015-11-13 03:26

HDU 3856 Palindrome ( Manacher + RMQ + 二分 ) WA！！！

  #include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm
·2015-11-13 03:25

HDU 3874 Necklace 树状数组

  #include <cstdio> #include <cstring> #include <cstdlib> #include <algorith
·2015-11-13 03:22

HDU 3954 Level up （线段树特殊懒惰标记）

感觉最巧的是定义了min_dis……将区间内有无英雄升级分开处理   #include <cstdio> #include <cstring> #include <cstdlib
·2015-11-13 03:22
上一页 3 4 5 6 7 8 9 10 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他