摘要： 路径模拟+dfs#include <stdio.h>const int maxn=128+10;char terminal[maxn];char outcome[maxn];int n;char order[8];int amount=0;char s[8][2];char dfs(int height,int loc){ if(height==n) return terminal[loc-1]; int a=s[height][1]-'0'; int b=order[a-1]-'0'; if(b==0) return(dfs(height+1,lo 阅读全文