- 博客(6)
- 收藏
- 关注
RSS订阅原创 二叉堆维护优先队列
#include #include #include using namespace std; #define INF 0xfffffff int inline parent(int i){return i>>1;} int inline left(int i){return 2*i;} int inline right(int i){return 2*i+1;} template void i
2014-06-30 01:46:09
866
原创 The Problems of zoj By watashi
2902.Ten drops 2960.Re-rejudge 3051.Playing Poker 3058.Circle and Ring 3073.Bernstein Polynomial 3150.Dareda? 3227.Perfect Cherry Blossom
2014-06-29 23:57:57
983
原创 UVA 146 ID Codes（下一个排列）
C - ID Codes Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Appoint description: System Crawler (2014-05-12) Description ID Cod
2014-06-16 18:29:46
907
原创 UVA 11205 The broken pedometer（子集枚举）
Description The Broken Pedometer The Problem A marathon runner uses a pedometer with which he is having problems. In the pedometer the symbols are represented by seven s
2014-06-16 18:16:02
921
原创 UVA 10085(bfs+康拓展开）八数码问题
Description Problem A The Most Distant State Input: standard input Output: standard output The 8-puzzle is a square tray in which eight square tiles are placed. The remaining ninth square
2014-06-09 18:43:40
1634
原创 表达式计算（中缀表达式转后缀前缀表达式）
给出一个由加减乘除和括号构成的表达式计算表达式的值和表达式的前缀和后缀表达式 #include #include #define Inf 1e9 struct tree { double date; char ch; tree *l,*r; tree() { ch='\0'; date=0; l=r=NULL
2014-06-02 21:34:17
2679
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人