Zstu Learning algorithm 017--dfs--Monkey Mountain climbing

Description A monkey in a hill not more than 30 mountain climbing jump, the monkey up a step can jump 1 or jump 3, try to find out how many different climbing method up the hill input multiple sets of test data, each group input 1 integer n, Indicates the number of steps of the hill output for the input integer n to find out how many kinds of crawl sample input

30

Sample Output

58425

HINT

To the general effect: Classic DFS

#include <cstdio>intn, tot;voidDfsintsum) {     if(Sum = =N) {Tot++; return; }     if(Sum >N)return ; DFS (sum+1); DFS (sum+3);}intMain () { while(~SCANF ("%d",&N)) {Tot=0; DFS (0); printf ("%d\n", tot); }    return 0;}

View Code

Zstu Learning algorithm 017--dfs--Monkey Mountain climbing