码迷,mamicode.com
首页 >  
搜索关键字:katu puzzle    ( 693个结果
HDOJ-ACM1097(JAVA) A hard puzzle
这道题就是HDOJ的1061的变形: 1061 :求n的n次方的个位数 http://www.cnblogs.com/xiezie/p/5596779.html 1097 :求n的m次方的个位数 因此,就不在这里赘述了 以下是JAVA实现: ...
分类:编程语言   时间:2016-06-18 21:06:13    阅读次数:215
LeetCode:N-Queens
N-Queens Total Accepted: 55554 Total Submissions: 212496 Difficulty: Hard The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens...
分类:其他好文   时间:2016-06-12 02:48:29    阅读次数:179
UVa227_puzzle
...
分类:其他好文   时间:2016-06-10 23:13:13    阅读次数:164
8puzzle & kd-tree & Boggle
8puzzle: using A* algorithm to solve 8-puzzle question. 1.define a state of board position 2.the number of moves made to reach the board position 3.th ...
分类:其他好文   时间:2016-06-06 23:21:34    阅读次数:168
计算机学院大学生程序设计竞赛(2015’12)The collector’s puzzle
Problem Description There is a collector who own many valuable jewels. He has a problem about how to store them. There are M special boxes. Each box h ...
分类:其他好文   时间:2016-05-30 23:05:22    阅读次数:204
The Towers of Hanoi Revisited---(多柱汉诺塔)
Description You all must know the puzzle named "The Towers of Hanoi". The puzzle has three pegs and N discs of different radii, initially all disks ar ...
分类:其他好文   时间:2016-05-29 15:04:20    阅读次数:211
【一天一道LeetCode】#51. N-Queens
一天一道LeetCode系列(一)题目 The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to...
分类:其他好文   时间:2016-05-18 18:31:33    阅读次数:142
word search puzzle
...
分类:其他好文   时间:2016-05-18 16:10:36    阅读次数:166
POJ 1651 Multiplication Puzzle 区间DP
题意:在一个数字序列中, 取出不包括头和尾的所有数字, 每次取出一个数字的代价等于取出的这个数和左右两个数的乘积, 求总代价和最小的取法 此小到大递归 ...
分类:其他好文   时间:2016-05-14 20:10:12    阅读次数:277
#和##在宏替换中的作用
#和##在宏替换中的作用 摘自:http://blog.csdn.net/kingkai620/article/details/5905606 文/kingkaihttp://blog.csdn.net/haoel/archive/2009/05/18/4197010.aspx,其中的PUZZLE ...
分类:其他好文   时间:2016-05-14 20:04:17    阅读次数:143
693条   上一页 1 ... 26 27 28 29 30 ... 70 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!