Problem B. Harvest of Apples HDU - 6333(莫隊)

Problem Description There are  n apples on a tree, numbered from 1 to n. Count the number of ways to pick at most m apples.     Input The first line of the input contains an integer  T (1≤T≤105) denot
相關文章
相關標籤/搜索