申論題資訊
試卷:102年 - 102 國立中山大學_碩士班招生考試_資工系(甲組):離散數學#105881
科目: 中山◆資工◆離散數學
年份:102年
排序:0
題組內容
4.Consider parking motorcycles and compact cars in a row of spaces where each cycle
uires one space and each compact needs two. Find and solve a recurrence relation
number of ways to park motorcycles and compact cars in a row of n spaces
申論題內容
(b) if the
motorcycles come in two distinct models and the compact cars come in three different colors, and
we want to use up all the n spaces.