Submit solution
Points:
5 (partial)
Time limit:
1.0s
Memory limit:
1G
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
Given a list of
integers, compute the number of triples
with
such that the median of
,
, and
is
.
Constraints
Input Specification
The first line of the input consists of two space-separated integers, and
.
The next line contains space-separated integers, the values
through
representing
the
numbers of the list in order.
Output Specification
Output, on a single line, the number of valid triples.
Sample Input
4 1
1 1 2 2
Sample Output
2
Comments