![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Algorithm
文章平均质量分 77
kaitaow
这个作者很懒,什么都没留下…
展开
-
POJ2676:Sudoku(DFS)
SudokuTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10849 Accepted: 5414 Special JudgeDescriptionSudoku is a very simple task. A square table with 9原创 2012-11-29 18:38:51 · 424 阅读 · 0 评论 -
POJ1664:放苹果(搜索)
放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21860 Accepted: 13944Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。In原创 2012-11-24 17:30:52 · 343 阅读 · 0 评论 -
POJ1562:Oil Deposits(DFS)
Oil DepositsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9814 Accepted: 5375DescriptionThe GeoSurvComp geologic survey company is responsible for detec原创 2012-11-25 10:46:37 · 300 阅读 · 0 评论 -
腾讯俱乐部ACM训练赛进阶组题解
比赛链接:http://acm.hdu.edu.cn/diy/contest_show.php?cid=18010problem1001Meepo’s Problem I Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/65536K (Java/Other)Total Submission(s) : 24原创 2012-11-25 17:18:16 · 577 阅读 · 0 评论 -
POJ2378:Tree Cutting(DFS)
Tree CuttingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3022 Accepted: 1767DescriptionAfter Farmer John realized that Bessie had installed a "tree-sha原创 2012-11-27 13:58:11 · 235 阅读 · 0 评论 -
POJ3140:Contestants Division(DFS,树形DP)
Contestants DivisionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6947 Accepted: 1961DescriptionIn the new ACM-ICPC Regional Contest, a special monito原创 2012-11-28 23:41:16 · 949 阅读 · 0 评论 -
Codeforces题目
A - WatermelonCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionOne hot summer day Pete and hi原创 2012-11-30 20:20:52 · 688 阅读 · 0 评论 -
九度OJ 1008最短路径问题
题目1008:最短路径问题 时间限制:1 秒内存限制:32 兆特殊判题:否提交:3219解决:963题目描述:给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。输入:输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a原创 2013-07-17 18:19:00 · 520 阅读 · 0 评论 -
POJ2407:Relatives(欧拉函数)
RelativesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9411 Accepted: 4453DescriptionGiven n, a positive integer, how many positive integers less than n原创 2012-11-24 10:25:50 · 178 阅读 · 0 评论 -
九度OJ题目1388:跳台阶
题目1388:跳台阶时间限制:1 秒内存限制:32 兆特殊判题:否提交:1033解决:431题目描述:一只青蛙一次可以跳上1级台阶,也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。输入:输入可能包含多个测试样例,对于每个测试案例,输入包括一个整数n(1 70)。输出:对应每个测试案例,输出该原创 2013-08-01 21:13:03 · 636 阅读 · 0 评论 -
九度OJ 1025 最大报销额(01背包)
九度OJ 1025 最大报销额(01背包)原创 2013-08-02 18:56:08 · 604 阅读 · 0 评论 -
leetcode clone graph
题目描述https://oj.leetcode.com/problems/clone-graph/思路第一遍遍历图,在每个节点的neighbors列表的末尾加上一个selfCopyNode,即对该节点的复制节点。第二遍遍历图,对每个节点的复制节点,让它的每个neighbor都是原节点对应neighbor复制节点。第三遍遍历图,移除每个节点的selfCopyNode,还原原来原创 2015-01-18 09:56:33 · 309 阅读 · 0 评论 -
二叉树遍历之已知前序中序求后序
二叉树根据前序中序求后序原创 2014-03-05 11:58:37 · 801 阅读 · 0 评论 -
<<编程之美>>之中国象棋将帅问题
Problem Description>Chapter1 Section2 Page13Problem Solutions如果只是要求得到问题的解而不做其他限制,显然是很简单的问题.只需要遍历A的位置,再遍历B的位置然后判断即可.问题是题目要求只能够使用一个字节的存储空间char类型是一个字节int类型是4个字节short int类型是2个字节那么只能够使用char原创 2014-02-23 21:24:24 · 576 阅读 · 0 评论 -
SQL
create procedure CAL_GPA @SNO varchar(12) as declare @GPA float declare @score float declare @point int begin DECLARE test_Cursor CURSOR SCROLL FORSELECT GRADEfrom SCwhere SC.SNO=@SNO open原创 2013-11-21 15:57:09 · 68 阅读 · 0 评论 -
九度OJ 1076:N的阶乘(高精度计算)
怎么算出1000的阶乘?原创 2013-08-11 10:41:04 · 854 阅读 · 0 评论 -
九度OJ 1035:找出直系亲属(二叉树)
九度OJ 1035:找出直系亲属(二叉树)原创 2013-08-02 22:54:48 · 1264 阅读 · 0 评论 -
Sicily2012每周一赛第14场题解
比赛链接:http://soj.me/contest_detail.php?cid=775Problem10001000. Bridges and Tunnels Total:54Accepted:11原创 2012-11-24 22:46:52 · 659 阅读 · 0 评论 -
POJ1111:Image Perimeters(DFS)
Language:DefaultImage PerimetersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6691 Accepted: 3976DescriptionTechnicians in a pathology lab ana原创 2012-11-25 09:48:59 · 275 阅读 · 0 评论 -
POJ1019:Number Sequence(组合计数)
Number SequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28810 Accepted: 8003DescriptionA single positive integer i is given. Write a program to fin原创 2012-11-28 15:50:16 · 401 阅读 · 0 评论 -
POJ3009:Curling 2.0(DFS)
Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7490 Accepted: 3127DescriptionOn Planet MM-21, after their Olympic games this year, curling i原创 2012-11-29 16:19:08 · 268 阅读 · 0 评论 -
POJ2454:Jersey Politics(贪心+随机化)
Jersey PoliticsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4231 Accepted: 1022 Special JudgeDescriptionIn the newest census of Jersey Cows and Hol原创 2012-12-02 22:07:21 · 490 阅读 · 0 评论 -
最短路+邻接表+最小堆的C++代码实现
最短路+邻接表+最小堆的C++代码实现原创 2013-07-17 17:32:27 · 903 阅读 · 0 评论 -
POJ2823:Sliding Window(单调队列||线段树)
Sliding WindowTime Limit: 12000MS Memory Limit: 65536KTotal Submissions: 28126 Accepted: 8389Case Time Limit: 5000MSDescriptionAn array of size n ≤ 106 is giv原创 2012-11-23 12:47:22 · 789 阅读 · 0 评论 -
POJ1286:Necklace of Beads(POLYA定理应用)
Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5410 Accepted: 2241DescriptionBeads of red, blue or green colors are connected togeth原创 2012-11-23 18:38:15 · 282 阅读 · 0 评论 -
POJ2225:Asteroids!(BFS)
Asteroids!Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2653 Accepted: 1006DescriptionYou're in space. You want to get home. There are asteroids.原创 2012-11-27 09:36:33 · 803 阅读 · 0 评论 -
POJ3378:Crazy Thairs(动态规划+线段树或树状数组+离散化+高精度)
Crazy ThairsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 6092 Accepted: 1478DescriptionThese days, Sempr is crazed on one problem named Crazy Thair原创 2012-11-28 22:19:36 · 480 阅读 · 0 评论 -
POJ2386:Lake Counting(DFS)
Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14776 Accepted: 7496DescriptionDue to recent rains, water has pooled in various places in Far原创 2012-11-27 14:13:36 · 223 阅读 · 0 评论 -
POJ2553:The Bottom of a Graph(tarjan缩点)
The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 7005 Accepted: 2871DescriptionWe will use the following (standard) definitions from g原创 2012-11-24 15:30:44 · 245 阅读 · 0 评论 -
POJ1850:Code(组合计数)
CodeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6374 Accepted: 2987DescriptionTransmitting and memorizing information is a task that requires differen原创 2012-11-26 13:58:23 · 249 阅读 · 0 评论 -
POJ2446:Chessboard(二分匹配)
ChessboardTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10746 Accepted: 3340DescriptionAlice and Bob often play games on chessboard. One day, Alice draw原创 2012-11-26 19:21:31 · 452 阅读 · 0 评论 -
POJ1018:Communication System(枚举+搜索剪枝)
Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19377 Accepted: 6851DescriptionWe have received an order from Pizoor Communications In原创 2012-11-27 14:53:05 · 279 阅读 · 0 评论 -
POJ3273:Monthly Expense(二分)
Monthly ExpenseTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 9302Accepted: 3823DescriptionFarmer John is an astounding accounting wizard and has realiz原创 2012-11-27 19:06:52 · 204 阅读 · 0 评论 -
POJ1584:A Round Peg in a Ground Hole(叉积,凸包)
A Round Peg in a Ground HoleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4098 Accepted: 1246DescriptionThe DIY Furniture company specializes in assembl原创 2012-11-29 15:12:21 · 423 阅读 · 0 评论 -
POJ2029:Get Many Persimmon Trees(DP)
Get Many Persimmon TreesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2821 Accepted: 1836DescriptionSeiji Hayashi had been a professor of the Nisshinkan原创 2012-11-30 14:34:36 · 271 阅读 · 0 评论 -
CF190A:Vasya and the Bus(易错题)
Vasya and the BusTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionOne day Vasya heard a story原创 2012-11-23 22:02:53 · 259 阅读 · 0 评论 -
POJ1284:Primitive Roots(欧拉函数的应用,奇素数的原根)
Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2159 Accepted: 1194DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is equal原创 2012-11-24 10:05:59 · 255 阅读 · 0 评论 -
Leetcode Binary Tree Maximum Path Sum
ProblemGiven a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example:Given the below binary tree, 1 / \ 2 3Return原创 2015-02-18 10:21:56 · 315 阅读 · 0 评论