Cow Frisbee Team S 背包dp

[USACO09MAR] Cow Frisbee Team S

题目描述

老唐最近沉迷于玩飞盘, 约翰打算邀请他一起参与一项有趣的运动项目, 因此计划从老唐家中挑选 N 头奶牛中的优秀选手组成一支专业队伍

每只奶牛都具有整数这一特性（实力），其能力值等于第i号奶牛的能力指标R_i（其中i=1,2,...,n）。球队成员数量必须满足以下条件：最少一名队员（不允许出现零人的情况），同时队员总数不得超越球队最大规模限制N（即介于1至N之间）。一个球队的综合实力即为其全体成员各自实力值之合计值。

John has a strong belief in the power of numbers, which he refers to as his lucky number, denoted as F. Consequently, he requires that the total ability of the team must be a multiple of F. Could you help him calculate The number of such possible team combinations is needed? But due to the potentially large size of this number, only the r