-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathD.java
More file actions
128 lines (108 loc) · 3.56 KB
/
Copy pathD.java
File metadata and controls
128 lines (108 loc) · 3.56 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
package atcoder.hhkb2020;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
public final class D {
private static final int MOD = (int) (1e9 + 7);
static long mul(long a, long b) {
return (a * b) % MOD;
}
public static void main(String[] args) {
final FastScanner fs = new FastScanner();
final PrintWriter pw = new PrintWriter(System.out);
final int t = fs.nextInt();
for (int i = 0; i < t; i++) {
final long n = fs.nextLong();
final long a = fs.nextLong();
final long b = fs.nextLong();
final long p = n - (a + b);
if (p < 0) {
pw.println(0);
continue;
}
// https://math.stackexchange.com/questions/166609/number-of-solutions-abc-n-a-gt-b-gt-c-ge0
final long c2 = (((p + 2) * (p + 1)) / 2) % MOD;
final long x = n - a + 1;
final long y = n - b + 1;
long res1 = 4L;
long res2 = 4L;
res1 = mul(res1, x);
res1 = mul(res1, y);
res1 = mul(res1, c2);
res2 = mul(res2, c2);
res2 = mul(res2, c2);
pw.println((res1 - res2 + MOD) % MOD);
}
pw.close();
}
static final class Utils {
public static void shuffleSort(int[] arr) {
shuffle(arr);
Arrays.sort(arr);
}
public static void shuffleSort(long[] arr) {
shuffle(arr);
Arrays.sort(arr);
}
public static void shuffle(int[] arr) {
final Random r = new Random();
for (int i = 0; i <= arr.length - 2; i++) {
final int j = i + r.nextInt(arr.length - i);
swap(arr, i, j);
}
}
public static void shuffle(long[] arr) {
final Random r = new Random();
for (int i = 0; i <= arr.length - 2; i++) {
final int j = i + r.nextInt(arr.length - i);
swap(arr, i, j);
}
}
public static void swap(int[] arr, int i, int j) {
final int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public static void swap(long[] arr, int i, int j) {
final long t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
private Utils() {}
}
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
private String next() {
while (!st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
//noinspection CallToPrintStackTrace
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
int[] nextIntArray(int n) {
final int[] a = new int[n];
for (int i = 0; i < n; i++) { a[i] = nextInt(); }
return a;
}
long[] nextLongArray(int n) {
final long[] a = new long[n];
for (int i = 0; i < n; i++) { a[i] = nextLong(); }
return a;
}
}
}