2011年9月21日
hdu4021
摘要： 24 Puzzle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 785 Accepted Submission(s): 222 Problem Description Daniel likes to... 阅读全文
posted @ 2011-09-21 16:49 NightCat_song 阅读(287) 评论(0) 推荐(0) 编辑
hdu4027
摘要： Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 2757 Accepted Submission(s): 657 Problem Descrip... 阅读全文
posted @ 2011-09-21 10:59 NightCat_song 阅读(310) 评论(0) 推荐(0) 编辑
hdu3321
摘要： Problem Description Professor Brute is not good at algorithm design. Once he was asked to solve a path finding problem. He worked on it for several days and finally came up with the following al... 阅读全文
posted @ 2011-09-21 05:20 NightCat_song 阅读(202) 评论(0) 推荐(0) 编辑
快速幂的两种写法
摘要： Quote of the Day: The easiest thing to find is fault. --Anonymous 真是蛋疼。。。。竟然傻×的写了N久的递归版快速幂，时间效率低不说，关键是这样很容易被人鄙视的。。。。。。直接上代码 1: //非递归版本 2: //输入a,b； 求解a^b 3: #include<iostream> 4: #include<cstdio> 5: using namespace std; 6: 7: int main(){ 8: int a,b; 9: //ans:最终结果 10: /... 阅读全文
posted @ 2011-09-21 04:05 NightCat_song 阅读(835) 评论(0) 推荐(0) 编辑