- 博客(4)
- 收藏
- 关注
原创 栈和铁轨 栈的基本运用
//Problem Description////As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train
2014-04-11 17:02:01 411
原创 走迷宫 bfs
z//走迷宫,bfs#include #include #include #define n 4 //行#define m 4 //列typedef struct dNode{ int x; int y; int step;} Node;//表示上下左右四个操作int u[4] = {0,0,-1,1};int v[
2014-04-11 17:00:03 386
原创 M斐波那契 详解
M斐波那契数列F[n]是一种整数数列,它的定义如下:F[0] = aF[1] = bF[n] = F[n-1] * F[n-2] ( n > 1 )现在给出a, b, n,你能求出F[n]的值吗?Input输入包含多组测试数据;每组数据占一行,包含3个整数a, b, n( 0 Output对每组测试数据请输出一个整数F[n],由于F[n]可能很大
2014-04-07 22:44:28 530
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人