随笔分类 -  基础算法

上一页 1 2

Strange Towers of Hanoi
摘要:"POJ" 题意:求$n(1 include include include include using namespace std; inline int read() { int x=0,o=1;char ch=getchar(); while(ch!=' '&&(ch'9'))ch=getch 阅读全文

posted @ 2019-07-21 20:39 PPXppx 阅读(134) 评论(0) 推荐(0)

上一页 1 2