07 2015 档案

atan与atan2的区别
摘要：相比较ATan，ATan2究竟有什么不同？本篇介绍一下ATan2的用法及使用条件。对于tan(θ) =y/x:θ=ATan(y/x)求出的θ取值范围是[-PI/2, PI/2]。θ=ATan2(y, x)求出的θ取值范围是[-PI, PI]。当 (x,y) 在第一象限, 0 <θ<PI/2.当(x,... 阅读全文
posted @ 2015-07-31 20:12 柳下_MBX 阅读(2608) 评论(0) 推荐(0)
UVALive 6324 Archery （求射箭覆盖的期望）
摘要：#include#include#include#includeconst double pi=3.141592653;int main(){ int t; scanf("%d",&t); while(t--){ int n; scanf("%d",&n); double a... 阅读全文
posted @ 2015-07-31 20:08 柳下_MBX 阅读(395) 评论(0) 推荐(0)
哈希UVALive 6326 Contest Hall Preparation
摘要：Encrypting passwords is one of the most important problems nowadays, and you trust only the encryp- tion algorithms which you invented, and you have j 阅读全文
posted @ 2015-07-31 18:50 柳下_MBX 阅读(207) 评论(0) 推荐(1)
HDU 2489 Minimal Ratio Tree (DFS枚举+最小生成树Prim)
摘要：Problem Description For a tree, which nodes and edges are all weighted, the ratio of it is calculated according to the following equation. Given a com 阅读全文
posted @ 2015-07-31 09:33 柳下_MBX 阅读(165) 评论(0) 推荐(0)
SPOJ AMR10I Dividing Stones
摘要：Time limit: 7s Source limit: 50000B Memory limit: 256MBThe first line contains the number of test cases T. T lines follow, one corresponding to each t... 阅读全文
posted @ 2015-07-30 18:42 柳下_MBX 阅读(266) 评论(0) 推荐(0)
URAL 1942 Attack at the Orbit
摘要：B - Attack at the Orbit Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice URAL 1942 B - Attack at the Orbit 阅读全文
posted @ 2015-07-30 08:36 柳下_MBX 阅读(342) 评论(0) 推荐(0)
URAL 1944 大水题模拟
摘要：D - Record of the Attack at the Orbit Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice URAL 1944DescriptionT... 阅读全文
posted @ 2015-07-29 19:26 柳下_MBX 阅读(392) 评论(0) 推荐(0)
哈希URAL 1941 - Scary Martian Word
摘要：A - Scary Martian Word Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice URAL 1941 A - Scary Martian Word Su 阅读全文
posted @ 2015-07-29 19:21 柳下_MBX 阅读(222) 评论(0) 推荐(0)
URAL 1934 spfa算法
摘要：D - Black Spot Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice URAL 1934Description Bootstrap: Jones's terr... 阅读全文
posted @ 2015-07-29 10:44 柳下_MBX 阅读(254) 评论(0) 推荐(0)
HDU 2487 Ugly Windows
摘要：欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励） Ugly WindowsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1481A... 阅读全文
posted @ 2015-07-27 19:59 柳下_MBX 阅读(199) 评论(0) 推荐(0)
HDU 2491
摘要：欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励） Priest John's Busiest Day Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submi 阅读全文
posted @ 2015-07-27 18:56 柳下_MBX 阅读(241) 评论(0) 推荐(0)
hdu 2492 树状数组 Ping pong
摘要：欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励） Ping pong Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4589 A 阅读全文
posted @ 2015-07-27 18:54 柳下_MBX 阅读(722) 评论(0) 推荐(2)
HDU 1532 基础EK Drainage Ditches
摘要：Drainage Ditches Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11744 Accepted Submission(s): 55 阅读全文
posted @ 2015-07-27 10:39 柳下_MBX 阅读(233) 评论(0) 推荐(0)
EK算法模板
摘要：EdmondsKarp算法，简称EK算法，O(m^2n) 因为是初学教程，所以我会尽量避免繁杂的数学公式和证明。也尽量给出了较为完整的代码。 本文的目标群体是网络流的初学者，尤其是看了各种NB的教程也没看懂怎么求最大流的小盆友们。本文的目的是，解释基本的网络流模型，最基础的最大流求法，即bfs找增广 阅读全文
posted @ 2015-07-27 10:34 柳下_MBX 阅读(525) 评论(0) 推荐(0)
HDU 3549 基础网络流EK算法 Flow Problem
摘要：欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励） Flow Problem Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 101 阅读全文
posted @ 2015-07-27 10:33 柳下_MBX 阅读(219) 评论(0) 推荐(0)
HDU 1937 F - Finding Seats 枚举
摘要：F - Finding Seats Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1937 F - Finding Seats Submit Status 阅读全文
posted @ 2015-07-27 09:04 柳下_MBX 阅读(619) 评论(0) 推荐(0)
HDU 1937 J - Justice League
摘要：J -Justice LeagueTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1941DescriptionThirty five years ago, a gro... 阅读全文
posted @ 2015-07-26 19:13 柳下_MBX 阅读(433) 评论(0) 推荐(0)
HDU 1939 HE IS OFFSIDE
摘要：He is offside!Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 538 Accepted Submission(s): 333P... 阅读全文
posted @ 2015-07-26 12:21 柳下_MBX 阅读(294) 评论(0) 推荐(0)
HDU 3033 组合背包变形 I love sneakers!
摘要：I love sneakers!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4503 Accepted Submission(s): 1... 阅读全文
posted @ 2015-07-26 11:57 柳下_MBX 阅读(516) 评论(1) 推荐(0)
分组背包
摘要：问题有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。这些物品被划分为若干组，每组中的物品互相冲突，最多选一件。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。算法这个问题变成了每组物品有若干种策略：是选择本组的某一件，还是一件都不选。也就是说... 阅读全文
posted @ 2015-07-25 17:54 柳下_MBX 阅读(507) 评论(0) 推荐(0)
hdu1712 分组背包 ACboy needs your help
摘要：ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5022Accepted Submission(s): 2... 阅读全文
posted @ 2015-07-25 17:37 柳下_MBX 阅读(276) 评论(0) 推荐(0)
hdu 1714 RedField
摘要：RedFieldTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 639Accepted Submission(s): 213Problem Desc... 阅读全文
posted @ 2015-07-24 19:21 柳下_MBX 阅读(478) 评论(0) 推荐(0)
HDU 1709 母函数天平问题 可出现减法的情况 The Balance
摘要：The Balance Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6652 Accepted Submission(s): 2730 Pro 阅读全文
posted @ 2015-07-24 18:39 柳下_MBX 阅读(289) 评论(0) 推荐(0)
HDU 1171 Big Event in HDU 母函数
摘要：欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励） Big Event in HDU Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s) 阅读全文
posted @ 2015-07-24 10:41 柳下_MBX 阅读(205) 评论(0) 推荐(0)
hdu 1085 给出数量限制的母函数问题 Holding Bin-Laden Captive!
摘要：Holding Bin-Laden Captive! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17256 Accepted Submiss 阅读全文
posted @ 2015-07-24 10:07 柳下_MBX 阅读(353) 评论(0) 推荐(1)
HDU 1398 Square Coins 整数拆分变形 母函数
摘要：欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励） Square Coins Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 972 阅读全文
posted @ 2015-07-24 09:26 柳下_MBX 阅读(232) 评论(0) 推荐(0)
HDU 1028 整数拆分问题 Ignatius and the Princess III
摘要：Ignatius and the Princess III Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15498 Accepted Subm 阅读全文
posted @ 2015-07-24 09:11 柳下_MBX 阅读(385) 评论(0) 推荐(0)
wutianqi 博客 母函数
摘要：母函数（Generating function）详解 — Tanky Woo 在数学中，某个序列的母函数(Generating function，又称生成函数)是一种形式幂级数，其每一项的系数可以提供关于这个序列的信息。使用母函数解决问题的方法称为母函数方法。 母函数可分为很多种，包括普通母函数、指 阅读全文
posted @ 2015-07-24 00:03 柳下_MBX 阅读(606) 评论(0) 推荐(0)
母函数细致讲解
摘要：母函数又称生成函数。定义是给出序列:a0,a1,a2,.......ak,......,那么函数G(x)=a0+a1*x+a2*x2+......ak*xk称为序列a0,a1,a2,.......ak,......的母函数(即生成函数)。 例如：序列1,2,3.......n的生成函数为：G(x)= 阅读全文
posted @ 2015-07-23 20:03 柳下_MBX 阅读(4369) 评论(0) 推荐(0)
HDU 2897
摘要：Problem Description当日遇到月，于是有了明。当我遇到了你，便成了侣。那天，日月相会，我见到了你。而且，大地失去了光辉，你我是否成侣？这注定是个凄美的故事。（以上是废话）小t和所有世俗的人们一样，期待那百年难遇的日食。驻足街头看天，看日月渐渐走近，小t的脖子那个酸呀（他坚持这个姿势已... 阅读全文
posted @ 2015-07-23 18:28 柳下_MBX 阅读(290) 评论(0) 推荐(0)
HDU 2895 编辑距离
摘要：#include#include#include#includeusing namespace std;char str1[100005],str2[100005];bool vis[100005];int main(){ while(scanf("%s",str1)!=EOF){ ge... 阅读全文
posted @ 2015-07-23 18:26 柳下_MBX 阅读(260) 评论(0) 推荐(0)
AC自动机
摘要：有了KMP和Trie的基础，就可以学习神奇的AC自动机了。AC自动机其实就是在Trie树上实现KMP，可以完成多模式串的匹配。 AC自动机 其实 就是创建了一个状态的转移图，思想很重要。 推荐的学习链接: http://acm.uestc.edu.cn/bbs/read.php?tid=4294 h 阅读全文
posted @ 2015-07-23 18:19 柳下_MBX 阅读(194) 评论(0) 推荐(0)
HDU 1707 简单模拟 Spring-outing Decision
摘要：Spring-outing DecisionTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 676Accepted Submission(s): 2... 阅读全文
posted @ 2015-07-23 08:37 柳下_MBX 阅读(205) 评论(0) 推荐(0)
HDU 1710 二叉树的遍历 Binary Tree Traversals
摘要：Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4330Accepted Submission(s): ... 阅读全文
posted @ 2015-07-23 00:11 柳下_MBX 阅读(851) 评论(0) 推荐(0)
HDU 1713 最小公倍数与最大公约数的问题 相遇周期
摘要：欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励）相遇周期Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2465Accepted S... 阅读全文
posted @ 2015-07-22 20:01 柳下_MBX 阅读(416) 评论(0) 推荐(0)
HDU 1708 简单dp问题 Fibonacci String
摘要：Fibonacci StringTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4568Accepted Submission(s): 1540Pr... 阅读全文
posted @ 2015-07-22 19:14 柳下_MBX 阅读(423) 评论(0) 推荐(0)
HDU1711 KMP
摘要：Number Sequence Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14563 Accepted Submission(s): 63 阅读全文
posted @ 2015-07-22 18:52 柳下_MBX 阅读(231) 评论(0) 推荐(0)
poj 3020 最短路径覆盖 Antenna Placement
摘要：Antenna PlacementTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7329Accepted: 3635DescriptionThe Global Aerial Research Centre has been allo... 阅读全文
posted @ 2015-07-22 10:46 柳下_MBX 阅读(1078) 评论(0) 推荐(0)
poj3041 二分图最小顶点覆盖
摘要：AsteroidsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17237td>Accepted: 9375DescriptionBessie wants to navigate her spaceship through a d... 阅读全文
posted @ 2015-07-22 09:47 柳下_MBX 阅读(218) 评论(0) 推荐(0)
HDU1068 最大独立点集
摘要：Girls and BoysTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8473Accepted Submission(s): 3893Pr... 阅读全文
posted @ 2015-07-22 09:27 柳下_MBX 阅读(318) 评论(0) 推荐(0)
hdu1151 二分图（无回路有向图）的最小路径覆盖 Air Raid
摘要：欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励）Air RaidTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3841Accept... 阅读全文
posted @ 2015-07-22 09:08 柳下_MBX 阅读(348) 评论(0) 推荐(0)
二分图多重匹配问题
摘要：二分图多重匹配问题#include #include #include #include using namespace std;const int maxn = 100005;const int maxm = 15;int cap[maxm];int Link[maxm][maxn];int vL... 阅读全文
posted @ 2015-07-21 20:21 柳下_MBX 阅读(330) 评论(0) 推荐(0)
二分图最大匹配问题及其扩展
摘要：二分图又称作二部图，是图论中的一种特殊模型。 设G=(V,E)是一个无向图，如果顶点V可分割为两个互不相交的子集(A,B)，并且图中的每条边（i，j）所关联的两个顶点i和j分别属于这两个不同的顶点集(i in A,j in B)，则称图G为一个二分图。二分图的最大匹配：匈牙利算法完美匹配： 如果所... 阅读全文
posted @ 2015-07-21 20:08 柳下_MBX 阅读(1341) 评论(0) 推荐(0)
ZOJ3741 状压DP Eternal Reality
摘要：E - Eternal Reality Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3741DescriptionIn Academy City, most ... 阅读全文
posted @ 2015-07-21 19:51 柳下_MBX 阅读(309) 评论(0) 推荐(0)
zoj3745 Salary Increasing
摘要：OJ Problem Set - 3745Salary IncreasingTime Limit: 2 Seconds Memory Limit: 65536 KBEdward has established a company with n staffs. He is such a kind... 阅读全文
posted @ 2015-07-21 18:17 柳下_MBX 阅读(421) 评论(0) 推荐(0)
二分图最大匹配基本模板
摘要：最小顶点覆盖==二分图的最大匹配最少路径覆盖==n—最大匹配////n为左右集合中的顶点个数最大点独立集 = 顶点共个数 - 匹配顶点数多个环的并 例如：有n个国家，国家之间通过有向边相连，边有权值， 现在让你把所有的国家都划成一个一个的圈，使得所有圈的总权值和最大。 二分图的实质就是多个环，... 阅读全文
posted @ 2015-07-21 10:51 柳下_MBX 阅读(396) 评论(0) 推荐(0)
HDU 3371 kruscal/prim求最小生成树 Connect the Cities 大坑大坑
摘要：这个时间短 700多s #include<stdio.h> #include<string.h> #include<iostream> #include<algorithm> using namespace std; struct node{ int u; int v; int w; }que[10 阅读全文
posted @ 2015-07-11 21:15 柳下_MBX 阅读(750) 评论(0) 推荐(0)
HDU 1285 拓普排序 基本模板例题 确定比赛名次
摘要：确定比赛名次 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15603 Accepted Submission(s): 6224 Problem 阅读全文
posted @ 2015-07-11 13:09 柳下_MBX 阅读(276) 评论(0) 推荐(0)
HDU1879 kruscal 继续畅通工程
摘要：继续畅通工程 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17028 Accepted Submission(s): 7319 Problem 阅读全文
posted @ 2015-07-11 12:58 柳下_MBX 阅读(409) 评论(0) 推荐(0)
poj1094 拓扑 Sorting It All Out
摘要：Sorting It All Out Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 29744 Accepted: 10293 Description An ascending sorted sequence of distin 阅读全文
posted @ 2015-07-11 12:27 柳下_MBX 阅读(186) 评论(0) 推荐(0)
(转)搞ACM的你伤不起
摘要：劳资六年前开始搞ACM啊！！！！！！！！！！从此踏上了尼玛不归路啊！！！！！！！！！！！！谁特么跟劳资讲算法是程序设计的核心啊！！！！！！尼玛除了面试题就没见过用算法的地方啊！！！！！！谁再跟劳资讲算法之美算法的力量，劳资一本算法导论拍死你啊！！！！！！！！那是搞ACM的入门书啊！！！！特么的入门书... 阅读全文
posted @ 2015-07-10 21:17 柳下_MBX 阅读(554) 评论(4) 推荐(1)
(转)女生应该找一个玩ACM的男生
摘要：1、强烈的事业心将来，他也一定会有自己热爱的事业。而且，男人最性感的时刻之一，就是他专心致志做事的时候。所以，找一个机会在他全神贯注玩ACM的时候，从侧面好好观察他，你就会发现我说的话没错。2、永不放弃的精神在比赛刚开始，神牛队就飘崎岖。玩ACM的男生不会退缩，而是毅然决定一个人继续AC下去，靠着自... 阅读全文
posted @ 2015-07-10 21:15 柳下_MBX 阅读(597) 评论(0) 推荐(1)
poj3259 bellman——ford Wormholes解绝负权问题
摘要：Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 35103 Accepted: 12805 Description While exploring his many farms, Farmer John has 阅读全文
posted @ 2015-07-10 00:29 柳下_MBX 阅读(139) 评论(0) 推荐(0)
poj2253 最短路 floyd Frogger
摘要：Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 28825 Accepted: 9359 Description Freddy Frog is sitting on a stone in the middle of 阅读全文
posted @ 2015-07-10 00:04 柳下_MBX 阅读(182) 评论(0) 推荐(0)
poj1860 bellman—ford队列优化 Currency Exchange
摘要：Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 22123 Accepted: 7990 Description Several currency exchange points are wor 阅读全文
posted @ 2015-07-09 16:41 柳下_MBX 阅读(333) 评论(0) 推荐(0)
bellman ford优先队列优化简介模板
摘要：#include<iostream>#include<cstdio>#include<utility>#include<queue>#include<cstring>using namespace std;#define INF 1000000000int d[20005];int n,m,a,b, 阅读全文
posted @ 2015-07-09 15:28 柳下_MBX 阅读(191) 评论(0) 推荐(0)
poj 3026 bfs+prim Borg Maze
摘要：Description The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used t 阅读全文
posted @ 2015-07-08 21:11 柳下_MBX 阅读(222) 评论(0) 推荐(0)
poj1258 Agri-Net 最小生成树
摘要：Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 44032 Accepted: 18001 Description Farmer John has been elected mayor of his town! 阅读全文
posted @ 2015-07-08 13:52 柳下_MBX 阅读(138) 评论(0) 推荐(0)
poj2485 Highways 最小生成树
摘要：Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. 阅读全文
posted @ 2015-07-08 13:31 柳下_MBX 阅读(262) 评论(0) 推荐(0)
poj1789 Truck History最小生成树
摘要：Truck History Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20768 Accepted: 8045 Description Advanced Cargo Movement, Ltd. uses trucks of 阅读全文
posted @ 2015-07-08 12:21 柳下_MBX 阅读(162) 评论(0) 推荐(0)
hrb 2134 素数
摘要：分拆素数和Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 176(99 users)Total Accepted: 106(93 users)Rating:Special Judge:NoDescription把一个偶数拆成两个不同素数的和... 阅读全文
posted @ 2015-07-08 11:15 柳下_MBX 阅读(167) 评论(0) 推荐(0)
poj2993 翻转2996
摘要：Emag eht htiw Em PlehTime Limit:1000MSMemory Limit:65536KTotal Submissions:2944Accepted:1949DescriptionThis problem is a reverse case of theproblem 29... 阅读全文
posted @ 2015-07-07 23:52 柳下_MBX 阅读(190) 评论(0) 推荐(0)
poj1573 模拟
摘要：Robot MotionTime Limit:1000MSMemory Limit:10000KTotal Submissions:11270Accepted:5487DescriptionA robot has been programmed to follow the instructions ... 阅读全文
posted @ 2015-07-07 23:02 柳下_MBX 阅读(145) 评论(0) 推荐(0)
poj2632 模拟
摘要：Crashing RobotsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8388Accepted: 3631DescriptionIn a modernized warehouse, robots are used to fet... 阅读全文
posted @ 2015-07-07 21:47 柳下_MBX 阅读(126) 评论(0) 推荐(0)
poj3295
摘要：TautologyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10453Accepted: 3967DescriptionWFF 'N PROOF is a logic game played with dice. Each di... 阅读全文
posted @ 2015-07-07 13:27 柳下_MBX 阅读(217) 评论(0) 推荐(0)
poj2996 模拟
摘要：Help Me with the GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:3713Accepted:2376DescriptionYour task is to read a picture of a chessboard ... 阅读全文
posted @ 2015-07-06 22:25 柳下_MBX 阅读(188) 评论(0) 推荐(0)
poj2240最短路 floyd
摘要：Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17360 Accepted: 7308 Description Arbitrage is the use of discrepancies in currenc 阅读全文
posted @ 2015-07-04 19:13 柳下_MBX 阅读(191) 评论(0) 推荐(0)
poj1125最短路
摘要：Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 30408 Accepted: 16624 Description Stockbrokers are known to overreact 阅读全文
posted @ 2015-07-04 19:12 柳下_MBX 阅读(224) 评论(0) 推荐(0)
poj2568
摘要：Y2K Accounting Bug Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11275 Accepted: 5675 Description Accounting for Computer Machinists (ACM 阅读全文
posted @ 2015-07-03 00:00 柳下_MBX 阅读(251) 评论(0) 推荐(0)
poj2109
摘要：Power of CryptographyTime Limit:1000MSMemory Limit:30000KTotal Submissions:20371Accepted:10293DescriptionCurrent work in cryptography involves (among ... 阅读全文
posted @ 2015-07-02 23:12 柳下_MBX 阅读(655) 评论(0) 推荐(0)
poj1328贪心 雷达，陆地，岛屿问题
摘要：Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 60381 Accepted: 13610 Description Assume the coasting is an infinite str 阅读全文
posted @ 2015-07-02 21:18 柳下_MBX 阅读(275) 评论(0) 推荐(0)
poj2965枚举
摘要：The Pilots Brothers' refrigerator Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20398 Accepted: 7857 Special Judge Description The game “ 阅读全文
posted @ 2015-07-02 13:54 柳下_MBX 阅读(131) 评论(0) 推荐(0)
位运算问题
摘要：位运算 位运算是把数字用二进制表示之后，对每一位上0或者1的运算。 理解位运算的第一步是理解二进制。二进制是指数字的每一位都是0或者1.比如十进制的2转化为二进制之后就是10。在程序员的圈子里有一个流传了很久的笑话，说世界上有10种人，一种人知道二进制，而另一种人不知道二进制。。。。。。 其实二进制 阅读全文
posted @ 2015-07-01 15:46 柳下_MBX 阅读(355) 评论(0) 推荐(1)