logo AlgoBeat OnlineJudge
登录 注册

#101630. [BZOJ 1630] [Usaco2007 Demo]Ant Counting

内存限制:64 MiB 时间限制:5000 ms 标准输入输出
题目类型:传统 评测方式:文本比较
上传者: 匿名

题目描述

同OJ2023

输入格式

  • Line 1: 4 space-separated integers: T, A, S, and B

  • Lines 2..A+1: Each line contains a single integer that is an ant type present in the hive

输出格式

  • Line 1: The number of sets of size S..B (inclusive) that can be created. A set like {1,2} is the same as the set {2,1} and should not be double-counted. Print only the LAST SIX DIGITS of this number, with no leading zeroes or spaces.

样例

样例输入

3 5 2 3
1
2
2
1
3

INPUT DETAILS:

Three types of ants (1..3); 5 ants altogether.  How many sets of size 2 or
size 3 can be made?

样例输出

10

OUTPUT DETAILS:

5 sets of ants with two members; 5 more sets of ants with three members