Tasks Details
medium
Find the minimal nucleotide from a range of sequence DNA.
Task Score
100%
Correctness
100%
Performance
100%
A DNA sequence can be represented as a string consisting of the letters A, C, G and T, which correspond to the types of successive nucleotides in the sequence. Each nucleotide has an impact factor, which is an integer. Nucleotides of types A, C, G and T have impact factors of 1, 2, 3 and 4, respectively. You are going to answer several queries of the form: What is the minimal impact factor of nucleotides contained in a particular part of the given DNA sequence?
The DNA sequence is given as a non-empty string S = S[0]S[1]...S[N-1] consisting of N characters. There are M queries, which are given in non-empty arrays P and Q, each consisting of M integers. The K-th query (0 ≤ K < M) requires you to find the minimal impact factor of nucleotides contained in the DNA sequence between positions P[K] and Q[K] (inclusive).
For example, consider string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6The answers to these M = 3 queries are as follows:
- The part of the DNA between positions 2 and 4 contains nucleotides G and C (twice), whose impact factors are 3 and 2 respectively, so the answer is 2.
- The part between positions 5 and 5 contains a single nucleotide T, whose impact factor is 4, so the answer is 4.
- The part between positions 0 and 6 (the whole string) contains all nucleotides, in particular nucleotide A whose impact factor is 1, so the answer is 1.
Write a function:
object Solution { def solution(s: String, p: Array[Int], q: Array[Int]): Array[Int] }
that, given a non-empty string S consisting of N characters and two non-empty arrays P and Q consisting of M integers, returns an array consisting of M integers specifying the consecutive answers to all queries.
Result array should be returned as an array of integers.
For example, given the string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6the function should return the values [2, 4, 1], as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- M is an integer within the range [1..50,000];
- each element of arrays P and Q is an integer within the range [0..N - 1];
- P[K] ≤ Q[K], where 0 ≤ K < M;
- string S consists only of upper-case English letters A, C, G, T.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Scala
Time spent on task 47 minutes
Notes
not defined yet
Code: 18:14:25 UTC,
scala,
verify,
result: Failed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
println(results.length)
results
}
}
Analysis
expand all
Example tests
1.
1.869 s
WRONG ANSWER,
got [0, 0, 0] expected [2, 4, 1]
stdout:
3
Code: 18:20:13 UTC,
scala,
verify,
result: Failed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
val impacts = S map {
case 'A' => 1
case 'C' => 2
case 'G' => 3
case 'T' => 4
case _ => sys.error("Invalid input")
}
println(impacts)
results
}
}
Analysis
expand all
Example tests
1.
1.887 s
WRONG ANSWER,
got [0, 0, 0] expected [2, 4, 1]
stdout:
Vector(2, 1, 3, 2, 2, 4, 1)
Code: 18:22:04 UTC,
scala,
verify,
result: Failed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
val impacts = S map {
case 'A' => 1
case 'C' => 2
case 'G' => 3
case 'T' => 4
case _ => sys.error("Invalid input")
}
(P zip Q).zipWithIndex foreach {
case ((p, q), i) =>
results(i) = p
}
results
}
}
Analysis
expand all
Example tests
1.
2.498 s
WRONG ANSWER,
got [2, 5, 0] expected [2, 4, 1]
Code: 18:48:39 UTC,
scala,
verify,
result: Failed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
@scala.annotation.tailrec
def makePrefixCounts(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size()) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
makePrefixCounts(check, index + 1, accum, nextValue)
}
}
def makePrefixCounts(check: Char): Array[Int] =
makePrefixCounts(check, 0, Array.fill(S.size())(0), 0)
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// val T = makePrefixCounts('T')
val hasInRange(a: Array[Int], p: Int, q: Int): Boolean = false
(P zip Q).zipWithIndex foreach {
case ((p, q), i) =>
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
result(i) = minValue
}
results
}
}
Analysis
Compile error
Solution.scala:13: error: Int does not take parameters
if (index >= S.size()) accum
^
Solution.scala:24: error: Int does not take parameters
makePrefixCounts(check, 0, Array.fill(S.size())(0), 0)
^
Solution.scala:31: error: not found: value hasInRange
val hasInRange(a: Array[Int], p: Int, q: Int): Boolean = false
^
Solution.scala:36: error: not found: value hasInRange
if (hasInRange(A, p, q)) 1
^
Solution.scala:37: error: not found: value hasInRange
else if (hasInRange(C, p, q)) 2
^
Solution.scala:38: error: not found: value hasInRange
else if (hasInRange(G, p, q)) 3
^
Solution.scala:40: error: not found: value result
result(i) = minValue
^
Solution.scala:23: error: method makePrefixCounts is defined twice
conflicting symbols both originated in file '/tmp/Solution.scala'
def makePrefixCounts(check: Char): Array[Int] =
^
8 errors found
Code: 18:49:03 UTC,
scala,
verify,
result: Failed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
@scala.annotation.tailrec
def makePrefixCounts(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
makePrefixCounts(check, index + 1, accum, nextValue)
}
}
def makePrefixCounts(check: Char): Array[Int] =
makePrefixCounts(check, 0, Array.fill(S.size)(0), 0)
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// val T = makePrefixCounts('T')
val hasInRange(a: Array[Int], p: Int, q: Int): Boolean = false
(P zip Q).zipWithIndex foreach {
case ((p, q), i) =>
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
result(i) = minValue
}
results
}
}
Analysis
Compile error
Solution.scala:31: error: not found: value hasInRange
val hasInRange(a: Array[Int], p: Int, q: Int): Boolean = false
^
Solution.scala:36: error: not found: value hasInRange
if (hasInRange(A, p, q)) 1
^
Solution.scala:37: error: not found: value hasInRange
else if (hasInRange(C, p, q)) 2
^
Solution.scala:38: error: not found: value hasInRange
else if (hasInRange(G, p, q)) 3
^
Solution.scala:40: error: not found: value result
result(i) = minValue
^
Solution.scala:23: error: method makePrefixCounts is defined twice
conflicting symbols both originated in file '/tmp/Solution.scala'
def makePrefixCounts(check: Char): Array[Int] =
^
6 errors found
Code: 18:49:25 UTC,
scala,
verify,
result: Failed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
@scala.annotation.tailrec
def makePrefixCounts(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
makePrefixCounts(check, index + 1, accum, nextValue)
}
}
def makePrefixCounts(check: Char): Array[Int] =
makePrefixCounts(check, 0, Array.fill(S.size)(0), 0)
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// val T = makePrefixCounts('T')
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = false
(P zip Q).zipWithIndex foreach {
case ((p, q), i) =>
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
result(i) = minValue
}
results
}
}
Analysis
Compile error
Solution.scala:40: error: not found: value result
result(i) = minValue
^
Solution.scala:23: error: method makePrefixCounts is defined twice
conflicting symbols both originated in file '/tmp/Solution.scala'
def makePrefixCounts(check: Char): Array[Int] =
^
two errors found
Code: 18:50:17 UTC,
scala,
verify,
result: Failed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
def makePrefixCounts(check: Char): Array[Int] = {
@scala.annotation.tailrec
def go(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
makePrefixCounts(check, index + 1, accum, nextValue)
}
}
go(check, 0, Array.fill(S.size)(0), 0)
}
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// val T = makePrefixCounts('T')
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = false
(P zip Q).zipWithIndex foreach {
case ((p, q), i) =>
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
results(i) = minValue
}
results
}
}
Analysis
Compile error
Solution.scala:22: error: too many arguments for method makePrefixCounts: (check: Char)Array[Int]
makePrefixCounts(check, index + 1, accum, nextValue)
^
one error found
Code: 18:50:35 UTC,
scala,
verify,
result: Failed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
def makePrefixCounts(check: Char): Array[Int] = {
@scala.annotation.tailrec
def go(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
go(check, index + 1, accum, nextValue)
}
}
go(check, 0, Array.fill(S.size)(0), 0)
}
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// val T = makePrefixCounts('T')
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = false
(P zip Q).zipWithIndex foreach {
case ((p, q), i) =>
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
results(i) = minValue
}
results
}
}
Analysis
expand all
Example tests
1.
2.462 s
WRONG ANSWER,
got [4, 4, 4] expected [2, 4, 1]
Code: 18:53:36 UTC,
scala,
verify,
result: Passed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
def makePrefixCounts(check: Char): Array[Int] = {
@scala.annotation.tailrec
def go(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
go(check, index + 1, accum, nextValue)
}
}
go(check, 0, Array.fill(S.size)(0), 0)
}
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// Not needed because if it's not the above 3, it must be T.
// val T = makePrefixCounts('T')
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = {
val atP = if (p == 0) 0 else a(p)
val atQ = a(q)
(atQ - atP) > 0
}
(P zip Q).zipWithIndex foreach {
case ((p, q), i) =>
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
results(i) = minValue
}
results
}
}
Analysis
Code: 18:53:59 UTC,
scala,
verify,
result: Passed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
val M = P.length
val results = Array.fill(M)(0)
def makePrefixCounts(check: Char): Array[Int] = {
@scala.annotation.tailrec
def go(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
go(check, index + 1, accum, nextValue)
}
}
go(check, 0, Array.fill(S.size)(0), 0)
}
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// Not needed because if it's not the above 3, it must be T.
// val T = makePrefixCounts('T')
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = {
val atP = if (p == 0) 0 else a(p - 1)
val atQ = a(q)
(atQ - atP) > 0
}
(P zip Q).zipWithIndex foreach {
case ((p, q), i) =>
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
results(i) = minValue
}
results
}
}
Analysis
Code: 18:55:55 UTC,
scala,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
def makePrefixCounts(check: Char): Array[Int] = {
@scala.annotation.tailrec
def go(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
go(check, index + 1, accum, nextValue)
}
}
go(check, 0, Array.fill(S.size)(0), 0)
}
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// Not needed because if it's not the above 3, it must be T.
// val T = makePrefixCounts('T')
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = {
val atP = if (p == 0) 0 else a(p - 1)
val atQ = a(q)
(atQ - atP) > 0
}
// val results = Array.fill(P.length)(0)
// (P zip Q).zipWithIndex foreach {
// case ((p, q), i) =>
// results(i) = minValue
// }
@scala.annotation.tailrec
def loop(index: Int, result: Array[Int]): Array[Int] = {
if (index >= P.length) result
else {
val p = P(index)
val q = Q(index)
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
result(index) = minValue
loop(index + 1, result)
}
}
}
}
Analysis
Compile error
Solution.scala:58: error: type mismatch;
found : Unit
required: Array[Int]
}
^
one error found
Code: 18:56:35 UTC,
scala,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
def makePrefixCounts(check: Char): Array[Int] = {
@scala.annotation.tailrec
def go(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
go(check, index + 1, accum, nextValue)
}
}
go(check, 0, Array.fill(S.size)(0), 0)
}
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// Not needed because if it's not the above 3, it must be T.
// val T = makePrefixCounts('T')
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = {
val atP = if (p == 0) 0 else a(p - 1)
val atQ = a(q)
(atQ - atP) > 0
}
// val results = Array.fill(P.length)(0)
// (P zip Q).zipWithIndex foreach {
// case ((p, q), i) =>
// results(i) = minValue
// }
val K = P.length
@scala.annotation.tailrec
def loop(index: Int, result: Array[Int]): Array[Int] = {
if (index >= K) result
else {
val p = P(index)
val q = Q(index)
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
result(index) = minValue
loop(index + 1, result)
}
}
loop(K, Array.fill(K)(0))
}
}
Analysis
expand all
Example tests
1.
2.292 s
WRONG ANSWER,
got [0, 0, 0] expected [2, 4, 1]
Code: 18:57:01 UTC,
scala,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
def makePrefixCounts(check: Char): Array[Int] = {
@scala.annotation.tailrec
def go(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
go(check, index + 1, accum, nextValue)
}
}
go(check, 0, Array.fill(S.size)(0), 0)
}
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// Not needed because if it's not the above 3, it must be T.
// val T = makePrefixCounts('T')
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = {
val atP = if (p == 0) 0 else a(p - 1)
val atQ = a(q)
(atQ - atP) > 0
}
// val results = Array.fill(P.length)(0)
// (P zip Q).zipWithIndex foreach {
// case ((p, q), i) =>
// results(i) = minValue
// }
val K = P.length
@scala.annotation.tailrec
def loop(index: Int, result: Array[Int]): Array[Int] = {
if (index >= K) result
else {
val p = P(index)
val q = Q(index)
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
result(index) = minValue
loop(index + 1, result)
}
}
loop(0, Array.fill(K)(0))
}
}
Analysis
Code: 18:58:03 UTC,
scala,
verify,
result: Passed
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
def makePrefixCounts(check: Char): Array[Int] = {
@scala.annotation.tailrec
def go(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
go(check, index + 1, accum, nextValue)
}
}
go(check, 0, Array.fill(S.size)(0), 0)
}
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// Don't need counts for `T` because if it's none of the other 3, it must be `T`.
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = {
val atP = if (p == 0) 0 else a(p - 1)
val atQ = a(q)
(atQ - atP) > 0
}
val K = P.length
@scala.annotation.tailrec
def loop(index: Int, result: Array[Int]): Array[Int] = {
if (index >= K) result
else {
val p = P(index)
val q = Q(index)
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
result(index) = minValue
loop(index + 1, result)
}
}
loop(0, Array.fill(K)(0))
}
}
Analysis
Code: 18:58:16 UTC,
scala,
final,
score:
100
import scala.collection.JavaConversions._
// you can use println for debugging purposes, e.g.
// println("this is a debug message")
object Solution {
def solution(S: String, P: Array[Int], Q: Array[Int]): Array[Int] = {
def makePrefixCounts(check: Char): Array[Int] = {
@scala.annotation.tailrec
def go(check: Char, index: Int, accum: Array[Int], last: Int): Array[Int] = {
if (index >= S.size) accum
else {
val nextValue =
if (S.charAt(index) == check) last + 1
else last
accum(index) = nextValue
go(check, index + 1, accum, nextValue)
}
}
go(check, 0, Array.fill(S.size)(0), 0)
}
val A = makePrefixCounts('A')
val C = makePrefixCounts('C')
val G = makePrefixCounts('G')
// Don't need counts for `T` because if it's none of the other 3, it must be `T`.
def hasInRange(a: Array[Int], p: Int, q: Int): Boolean = {
val atP = if (p == 0) 0 else a(p - 1)
val atQ = a(q)
(atQ - atP) > 0
}
val K = P.length
@scala.annotation.tailrec
def loop(index: Int, result: Array[Int]): Array[Int] = {
if (index >= K) result
else {
val p = P(index)
val q = Q(index)
val minValue =
if (hasInRange(A, p, q)) 1
else if (hasInRange(C, p, q)) 2
else if (hasInRange(G, p, q)) 3
else 4
result(index) = minValue
loop(index + 1, result)
}
}
loop(0, Array.fill(K)(0))
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N + M)
expand all
Correctness tests
1.
2.303 s
OK
2.
2.276 s
OK
3.
2.295 s
OK
4.
2.298 s
OK
1.
2.295 s
OK
2.
2.319 s
OK
3.
2.300 s
OK
4.
2.284 s
OK
1.
2.315 s
OK
2.
2.287 s
OK
3.
2.303 s
OK
1.
2.293 s
OK
1.
2.300 s
OK