摘要：
uva839 （递归来判断天平是否平衡）（递归+树） c++ include include include include include include include include include include using namespace std; typedef long long 阅读全文
摘要：
D 比赛的时候居然看漏了条件。。。 若在(x, y)格子，那么只能移动到(x+1, y)或(x, y+1) 这样的话就好做了，直接dp,然后统计每一种路径长度经过的点数。 c++ include include include include include include include incl 阅读全文