答案为C(n + R - L + 1, n) - 1。
大体推导过程是固定长度,然后隔板法,然后对长度求和。
暴力算组合数那里,要判断n < m,否则会RE。
/* Pigonometry */
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef unsigned long long ULL;
const int maxn = 1000505;
const ULL p = 1000003;
ULL fact[maxn];
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}
inline ULL qpow(ULL x, ULL n) {
ULL res = 1;
for(ULL t = x; n; n >>= 1, t = t * t % p) if(n & 1) res = res * t % p;
return res;
}
inline ULL inv(ULL x) {
return qpow(x, p - 2);
}
inline ULL bf(ULL n, ULL m) {
if(n < m) return 0;
return fact[n] * inv(fact[m]) % p * inv(fact[n - m]) % p;
}
inline ULL C(ULL n, ULL m) {
ULL res = 1;
for(ULL nn = n / p, mm = m / p; n && m && res; n = nn, m = mm, nn /= p, mm /= p)
(res *= bf(n - nn * p, m - mm * p)) %= p;
return res;
}
int main() {
fact[0] = 1;
for(int i = 1; i <= 1000005; i++) (fact[i] = fact[i - 1] * i) %= p;
ULL n, L, R;
for(int T = iread(); T; T--) {
n = iread(); L = iread(); R = iread();
printf("%llu\n", (C(n + R - L + 1, n) - 1 + p) % p);
}
return 0;
}