算法
文章平均质量分 83
pan_00_hao
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 2159 Ancient Cipher
转载自http://blog.youkuaiyun.com/shiow1991/article/details/7248495 Description Ancient Roman empire had a strong government system with various departments, including a secret service department. I转载 2013-01-28 22:49:29 · 410 阅读 · 0 评论 -
POJ3295--Tautology
转自:http://www.cnblogs.com/lv-2012/archive/2012/10/27/2742751.html Tautology Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7220 Accepted: 2741 Des转载 2013-03-19 22:02:42 · 853 阅读 · 0 评论 -
POJ2586--Y2K Accounting Bug
Y2K Accounting Bug Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7799 Accepted: 3861 Description Accounting for Computer Machinists (ACM) has sufferred f原创 2013-03-19 11:18:53 · 645 阅读 · 0 评论 -
POJ2109--Power of Cryptography
Power of Cryptography Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 15076 Accepted: 7652 Description Current work in cryptography involves (among other t原创 2013-03-12 20:52:20 · 634 阅读 · 0 评论 -
POJ2965----The Pilots Brothers' refrigerator
The Pilots Brothers' refrigerator Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14029 Accepted: 5261 Special Judge Description The game “The Pilots原创 2013-02-27 20:25:08 · 3639 阅读 · 0 评论 -
POJ3094-- Quicksum
Quicksum Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11717 Accepted: 8059 Description A checksum is an algorithm that scans a packet of data and return原创 2013-02-27 09:56:46 · 713 阅读 · 0 评论 -
POJ2255 Tree Recovery
转载 http://blog.youkuaiyun.com/crescent_star/article/details/5494637 Tree Recovery Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8859 Accepted: 5585 Des转载 2013-02-26 10:31:25 · 604 阅读 · 0 评论 -
POJ1328----Radar Installation
转自:http://ren.iteye.com/blog/344093 Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 38045 Accepted: 8452 Description Assume t转载 2013-03-07 10:54:35 · 569 阅读 · 0 评论 -
POJ -----3006 Dirichlet's Theorem on Arithmetic Progressions
Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12774 Accepted: 6427 Description If a and d are relatively p原创 2013-02-11 22:23:01 · 441 阅读 · 0 评论 -
POJ---1503 Integer Inquiry
Integer Inquiry Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 25660 Accepted: 9972 Description One of the first users of BIT's new supercomputer was Chip原创 2013-02-10 15:10:44 · 369 阅读 · 0 评论 -
POJ---3299 Humidex
Description Adapted from Wikipedia, the free encyclopedia The humidex is a measurement used by Canadian meteorologists to reflect the combined effect of heat and humidity. It differs from the heat原创 2013-02-10 15:08:28 · 616 阅读 · 0 评论 -
POJ 2262 ----Goldbach's Conjecture
Goldbach's Conjecture Description In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number原创 2013-02-07 15:56:53 · 459 阅读 · 0 评论 -
从数组中取出n个元素的所有组合(递归实现)
转载自http://www.cnblogs.com/shuaiwhu/archive/2012/04/27/2473788.html 作者:Microgoogle 今天在做POJ 1753时,需要枚举一个数组中所有组合。之前也遇到过类似的问题,如求从n个数组任意选取一个元素的所有组合都是想起来比较简单,但是设计成算法却颇费周折。 如数组为{1, 2, 3, 4, 5, 6},那么从它中转载 2013-01-17 22:13:15 · 4155 阅读 · 1 评论 -
POJ 1753 Flip Game (递归枚举)
转载http://www.cnblogs.com/shuaiwhu/archive/2012/04/27/2474041.html 作者:Microgoogle POJ 1753,题目链接http://poj.org/problem?id=1753,翻译一下整个题目的大概意思: 有4*4的正方形,每个格子要么是黑色,要么是白色,当把一个格子的颜色改变(黑->白或者白->黑)时,其周围转载 2013-01-17 22:23:43 · 751 阅读 · 0 评论 -
POJ 1083 —— Moving Tables
Description The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north side and south原创 2013-02-01 14:30:31 · 460 阅读 · 0 评论 -
poj 2739 Sum of Consecutive Prime Numbers
Sum of Consecutive Prime Numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10154原创 2013-01-30 11:03:44 · 479 阅读 · 0 评论 -
一位软件工程师的7年的总结
转自:http://blog.youkuaiyun.com/ghd2000/article/details/5653773 一位软件工程师的7年总结 1、分享第一条经验:“学历代表过去、能力代表现在、学习力代表未来。”其实这是一个来自国外教育领域的一个研究结果。相信工作过几年、十几年的朋友对这个道理有些体会吧。但我相信这一点也很重要:“重要的道理明白太晚将抱憾终生!”所以放在每一条,让转载 2013-05-07 11:11:25 · 717 阅读 · 0 评论
分享