- 博客(8)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 How Many Fibs?
<br />How Many Fibs?<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 1075 Accepted Submission(s): 454<br /><br /><br />Problem Description<br />Recall the definition of the Fibonacci num
2011-05-18 12:06:00
381
原创 hdu 1045 Fire Net
<br />回溯加搜索题。不多说了，看我的代码一定能明白其中的意思。<br />#include<stdio.h><br />char s[4][4];<br />int max,n;<br /> <br />bool isok(int row,int col)<br />{<br /> int i,j;<br /> for(i=row-1;i>=0;i--)//up<br /> {<br /> if(s[i][col]==
2011-04-30 21:27:00
319
原创 hdu 1789 Doing Homework again 贪心算法
<br />Doing Homework again<br />Problem Description<br />Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after t
2011-04-29 22:34:00
1709
原创 Number Sequence hdu1005
<br />Number Sequence<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 37475 Accepted Submission(s): 7887<br /><br /><br />Problem Description<br />A number sequence is defined as follows
2011-04-27 20:24:00
559
原创 Tr A hdu 1575数学问题
<br />Tr A<br />Problem Description<br />A为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。<br /> <br /> <br />Input<br />数据的第一行是一个T，表示有T组数据。<br />每组数据的第一行有n(2 <= n <= 10)和k(2 <= k < 10^9)两个数据。接下来有n行，每行有n个数据，每个数据的范围是[0,9]，表示方阵A的内容。<br /> <br /> <br />Output<b
2011-04-03 16:57:00
599
1
原创 hdu1269 并查集 强联通
<br /> <br />#include<iostream>//并查集<br />using namespace std;<br />#define max 10010<br />int n,father1[max],father2[max];<br /> <br />int find1(int x)<br />{<br /> <br /> if(father1[x]!=x)<br /> return father1[x]=find1(father1[x
2011-04-02 10:37:00
308
原创 C语中快排的调用方法
格式：qsort(s,n,sizeof(s[0]),cmp);<br />注意事项：<br />必须将库中的头文件<stdlib.h>与<string.h>包函进去；cmp是自己要写的比较函数。<br /> 其中第一个参数s是参与排序的数组名(或者也可以理解成开始排序的地址,因为可以写成&s[i]这样的表达式,这个问题下面有说明); 第二个参数n是参与排序的元素个数; 第三个参数是单个元素的大小,必须 sizeof(s[0])这样的表达式,下面也有说明；第四个参数cmp其实是个函数名字，它是为指导q
2011-03-19 15:48:00
363
原创 Tempter of the Bone 回溯法 hdu1010 zoj2110
<br />Tempter of the Bone<br /> <br />Problem Description<br />The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that th
2011-03-19 14:50:00
480
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人