elativus commited on
Commit
b0b25ac
·
verified ·
1 Parent(s): 330a1de

Upload dev file dev_hard_d8_n128_seed4003.jsonl

Browse files
Files changed (1) hide show
  1. dev/dev_hard_d8_n128_seed4003.jsonl +128 -0
dev/dev_hard_d8_n128_seed4003.jsonl ADDED
@@ -0,0 +1,128 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-13, 1, -2, 17, 21, 0, 9, -8, 26, 18, -1, -25, 0, -29, -26, -8, -29, -7, -10, -23, -6, -12]\n", "answer": "5"}
2
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [13, 3, -9, -9, -5, 12, 9, 9, 29, -16, -19, 21, -25, -4, 16, 3, -19, -1, -27, -19, -3, -19]\n", "answer": "4"}
3
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [20, 24, -29, -16, -29, 26, 15, -27, -7, 26, 1, -26, -22, -4, -12, 23, 24, 1, 1, 7, 2, 25]\n", "answer": "8"}
4
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [28, -24, -3, -2, -12, 22, -9, 25, 3, -7, 18, -14, -8, -22, 17, -2, -21, -10, 5, 25, -5, -10]\n", "answer": "7"}
5
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-13, -9, -4, -2, -29, 17, 25, 23, -6, -9, 15, 1, -6, -28, 20, 0, 1, 23, 6, 10, 10, 8]\n", "answer": "8"}
6
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [16, 4, 26, -5, 25, 19, -11, 8, -6, -22, -9, -3, -15, -15, -23, -7, 28, -4, -16, 27, -7, -29]\n", "answer": "5"}
7
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [18, -15, -24, 3, -26, 15, -22, -17, -7, 10, -23, 19, -2, 19, 24, 8, -3, -20, -18, 8, 28, 4]\n", "answer": "8"}
8
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, -13, -2, 5, 13, 15, 1, -5, -19, -7, -28, -27, 10, 16, 25, -28, 22, -12, -11, -7, 12, 14]\n", "answer": "7"}
9
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-26, -28, 11, 16, -1, -11, -25, 12, -9, 15, -12, 14, -7, -28, -20, 11, -14, -7, -27, -22, -8, -10]\n", "answer": "5"}
10
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-29, 14, 16, -18, -21, -23, -21, -25, -13, 20, 11, -7, 14, -9, 14, -18, 27, 5, 11, 24, 29, -10]\n", "answer": "9"}
11
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-24, 3, 0, 22, 10, 7, -18, -12, -8, 4, 7, 5, 18, 24, 11, 29, 1, -24, -15, 20, 4, -22]\n", "answer": "9"}
12
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-4, 26, 18, 19, 20, -5, -13, -19, 1, 10, 9, -16, -3, 27, 17, 20, -28, -24, 22, -26, -14, -2]\n", "answer": "6"}
13
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-17, -22, 19, 26, -17, 18, -1, 9, -11, -2, 16, -11, 26, 2, 28, 28, 14, -8, -20, 5, 0, 7]\n", "answer": "7"}
14
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, -20, 12, 9, 8, -21, 6, -6, 17, -8, 2, -22, -29, -9, -17, -13, -14, -27, -10, -26, 15, 22]\n", "answer": "6"}
15
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, -24, -29, -12, 6, 29, -19, -23, 11, 5, 18, 1, -24, 17, -15, -28, -24, 26, -26, -22, 29, -29]\n", "answer": "7"}
16
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-29, 26, 2, -25, 19, -20, 21, 15, 27, -12, 3, -28, -19, 25, -19, 17, -14, -5, -29, -16, -3, -6]\n", "answer": "7"}
17
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, 15, -22, 13, 25, 26, 26, -7, 9, -25, 19, 24, 23, 14, 21, -9, -23, 8, 13, 7, 15, 28]\n", "answer": "6"}
18
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-13, -29, -27, 27, -23, 13, -26, -6, -19, -15, 17, 20, -25, 19, -20, -4, 16, -11, -28, 19, -11, 18]\n", "answer": "8"}
19
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-28, -18, 15, -11, 28, 28, 8, 9, -22, 28, -17, 25, -11, -3, 0, -28, -23, 27, 7, -2, 7, -26]\n", "answer": "7"}
20
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, 1, -14, -16, -22, 28, 7, 24, 20, 13, -9, 15, -9, -13, 7, 3, -9, 7, 11, -16, -12, 24]\n", "answer": "6"}
21
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, -17, 3, -13, 13, -4, -14, -17, 5, -15, -23, 25, 26, -19, -17, -12, -6, -3, -9, -5, 12, -2]\n", "answer": "7"}
22
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 7, -4, -26, -3, -1, -15, -12, 11, -20, -20, 18, -12, 13, 28, -24, 6, -16, 29, -6, -14, -25]\n", "answer": "7"}
23
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [17, 16, 18, 4, 12, -29, 1, -10, -7, -25, -18, -26, -4, -27, -5, -29, -9, 27, 15, 22, -16, 11]\n", "answer": "6"}
24
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-21, 4, -7, -10, 17, -16, -7, -20, 2, 19, -13, -11, 26, -25, -5, -18, -1, -2, -19, 20, -1, 29]\n", "answer": "8"}
25
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, -5, 10, -8, -5, -17, 13, 27, -3, 9, 29, 12, 3, 3, 0, 17, 0, 9, 17, 0, -29, -19]\n", "answer": "6"}
26
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-15, 17, -23, 12, 25, -9, 4, 12, 24, -7, 10, -17, 8, 0, 1, -26, 11, -27, -21, 28, -14, -21]\n", "answer": "7"}
27
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, -10, -23, 13, -28, -10, 23, -18, 15, -12, 14, -29, 8, -13, -27, -26, -24, -8, 3, 12, 13, -16]\n", "answer": "8"}
28
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, 10, 14, -18, 16, 29, 8, 13, -26, 22, -19, -18, -12, 26, 27, -12, -27, -11, -20, -11, -16, -10]\n", "answer": "7"}
29
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [17, 23, 29, -27, 28, -14, -11, 26, -7, 20, -25, 22, 29, -27, -16, -22, 20, -27, 17, -26, 0, 18]\n", "answer": "7"}
30
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [18, 11, -20, 26, 16, -10, -26, 9, -2, -15, 3, 5, 9, 4, -20, 28, -2, -29, 28, -8, -1, -16]\n", "answer": "7"}
31
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [19, 23, 29, 28, -5, 25, -16, -2, -1, -25, 24, 23, 22, -8, 18, 2, 4, -29, -29, -20, -10, 16]\n", "answer": "6"}
32
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, 11, -23, -15, -25, 3, 5, -2, -13, 13, -19, 27, -14, -28, -8, -23, 13, 29, 8, -7, 15, 2]\n", "answer": "7"}
33
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [15, -24, -22, -19, 0, -16, -21, -29, 7, -13, -5, -20, 9, -16, 28, 12, 17, 22, -5, 2, -25, 10]\n", "answer": "10"}
34
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, 23, 1, -5, -16, -28, 20, 29, -10, 1, -29, -25, 25, 2, 16, 25, -13, 7, 12, -16, -8, -5]\n", "answer": "6"}
35
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [24, 8, -25, -17, 1, -23, 27, 9, 24, -18, 13, 26, 14, 2, -26, 2, -9, 4, 21, 19, 9, -29]\n", "answer": "7"}
36
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-7, -25, 3, -27, -19, -7, 8, -6, 7, 2, 9, 10, 4, -10, 27, -26, 17, -17, -12, 5, -20, 19]\n", "answer": "9"}
37
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-7, -9, 19, 1, 6, -10, -28, 29, 4, 0, -19, 26, 16, -18, 14, -14, 5, 26, -29, -7, 13, -3]\n", "answer": "6"}
38
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-19, -20, -28, -17, 18, -29, 7, -24, -27, -14, -12, 13, 9, -1, 9, 4, -1, -11, 24, 1, 25, -27]\n", "answer": "8"}
39
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [3, 7, -23, 1, 3, -9, -18, 10, 12, 27, 14, 29, -21, 0, 21, -15, 24, 13, -28, 1, 25, 20]\n", "answer": "9"}
40
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [18, -10, 6, -13, 14, 17, 4, -21, -14, -9, -11, -6, -18, 28, -24, 2, -10, -29, 5, -10, -29, 22]\n", "answer": "7"}
41
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, 24, 6, -5, 27, -23, 15, -5, 23, -15, 5, 26, -13, 6, -25, 19, 6, -1, 7, -2, -5, -4]\n", "answer": "5"}
42
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-20, 23, -25, 10, 7, 14, 25, 15, 21, 10, 7, -19, 6, 12, 23, 23, -21, 11, 22, -21, -15, -1]\n", "answer": "6"}
43
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-17, -18, 9, 1, 5, 8, -4, 3, 15, -10, 3, -10, -21, -10, 12, -17, 24, 18, -21, -27, -16, -13]\n", "answer": "6"}
44
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, 27, -22, -25, -17, 12, -16, 21, 29, -16, -28, 11, 26, 7, -6, 21, 20, -27, 14, -23, 1, -9]\n", "answer": "5"}
45
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [24, -6, 23, -2, 17, 23, 11, 29, 16, -29, -22, -12, -20, 9, 8, 23, -8, -20, -18, 18, 11, -18]\n", "answer": "5"}
46
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [12, 19, -23, -14, -10, -6, -3, 16, -27, -3, 27, 26, -18, 10, 14, 23, -18, -18, -21, 1, -4, -15]\n", "answer": "8"}
47
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, -20, 28, -2, -20, 8, 26, 27, -15, 1, 7, -11, 7, -20, -28, 16, -24, -28, 28, 18, 27, -26]\n", "answer": "7"}
48
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [24, 15, 17, -15, -5, 24, 14, -7, -11, 29, -3, -16, -19, 6, -17, -4, 26, -21, -17, 19, 27, -10]\n", "answer": "6"}
49
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-16, -18, 24, -19, 21, -22, 7, 4, 5, 18, -24, -13, 1, -13, 0, -17, 9, -22, -11, -15, -1, 28]\n", "answer": "5"}
50
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-20, 16, -28, -3, 10, -28, -27, -18, 29, -5, -10, -19, 27, 16, 6, -28, -11, -5, -25, 27, 5, 1]\n", "answer": "6"}
51
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-21, -17, -9, 6, 25, -13, 19, -4, -17, 9, -7, -8, 26, -2, -11, -1, -7, 1, 0, 16, 3, 16]\n", "answer": "9"}
52
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-15, 8, -8, 19, -16, -1, -21, -25, -29, 9, -21, 14, 19, 9, -16, 23, 17, -13, 23, -8, -15, -16]\n", "answer": "7"}
53
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, 6, -12, -21, 8, 25, 18, 0, -17, -24, -3, 17, 25, -23, -22, 12, 9, -11, -28, 5, 26, 3]\n", "answer": "6"}
54
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [27, -10, 23, -3, -19, -15, 6, -28, 9, 9, -5, 22, 26, -9, 2, -12, 0, -22, 13, 1, -22, 2]\n", "answer": "6"}
55
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, 0, -19, 9, 10, -20, 8, 12, 15, 8, 22, 6, 15, 1, 23, 12, -11, -18, 8, -27, -7, 19]\n", "answer": "8"}
56
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-29, 22, 26, -21, -15, 17, -11, 3, -16, 5, -21, -19, 14, -21, -29, 3, 19, 23, -19, 10, -20, -23]\n", "answer": "9"}
57
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, 4, -17, -4, 18, 1, 2, -26, 6, 5, 11, -14, -3, 2, 23, -10, 28, 13, 11, 28, 18, -26]\n", "answer": "8"}
58
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [16, 20, -7, 16, 28, 21, 6, -14, -20, -12, -1, -3, 25, -7, 23, 25, 29, -27, -7, 21, -6, 22]\n", "answer": "6"}
59
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 20, -17, 13, 21, -8, -14, 1, -10, -11, 15, 0, -1, 5, 27, 28, 26, 15, -26, 3, 7, 8]\n", "answer": "7"}
60
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-27, -19, 13, 12, 14, 24, 28, -17, 26, 18, -2, -11, 23, 8, 6, 19, -11, -5, 21, 0, 5, -20]\n", "answer": "7"}
61
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 18, -27, -27, -22, 21, -21, 20, 17, 12, -1, -5, 20, -12, -14, -17, 1, -7, 12, 12, -9, 18]\n", "answer": "7"}
62
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [21, -28, 7, -12, -20, -19, -7, 23, -16, 12, 29, -18, 10, -14, 25, 6, -17, -8, 1, -10, 14, -6]\n", "answer": "8"}
63
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, 28, 12, -7, 11, -11, -17, 10, 23, -12, 3, 13, 3, 8, -7, -29, 11, -17, -16, -13, 16, -25]\n", "answer": "6"}
64
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-24, -22, -28, -28, -7, -23, -5, 8, 12, -1, -3, 17, -24, 26, 13, 25, -16, 28, 1, 4, 11, -27]\n", "answer": "9"}
65
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-5, -23, 27, -26, -18, 23, 6, -20, 7, -19, 29, 24, -9, 17, -24, 16, -25, -25, 8, -4, 25, -22]\n", "answer": "6"}
66
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-27, 19, -23, -27, -28, 10, 9, -23, 14, 25, -8, -23, 18, 6, -5, -28, 15, -10, -22, 0, 5, 5]\n", "answer": "6"}
67
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [29, 6, -12, 2, 4, 11, 24, 15, 7, 12, -13, 18, 8, 8, 16, -4, -18, 5, 23, -13, 15, 22]\n", "answer": "7"}
68
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [10, -16, 0, -27, 28, 21, 11, -22, 18, 25, 23, -20, -10, -24, -2, 24, -7, 27, -22, 20, 5, -19]\n", "answer": "7"}
69
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, 21, 21, 6, 16, -2, 14, 9, -24, -4, 17, -10, -23, 24, 13, 10, 11, -13, -27, -27, -8, 24]\n", "answer": "5"}
70
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [24, 25, 13, -20, 14, 8, -24, -12, 14, -7, 5, -7, -3, 19, -1, 28, 27, 12, -22, -1, 4, -25]\n", "answer": "6"}
71
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [19, -6, -19, -5, 12, 4, -11, -9, -23, -13, -9, 27, 16, 7, 6, 23, -5, -8, -3, 19, -23, 0]\n", "answer": "6"}
72
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [16, 21, 10, -28, 5, 22, 7, -10, -13, -29, 0, 24, 0, 0, -5, -19, -22, 24, 18, -15, -19, -25]\n", "answer": "4"}
73
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-27, -2, 10, 5, -1, 15, -2, -9, 15, -17, -17, 17, -3, 8, 25, -24, -23, -22, 27, -25, 29, -21]\n", "answer": "8"}
74
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-10, 27, 10, -7, 5, -26, -16, 5, -14, -25, 3, -10, 27, 12, -26, -16, -5, 23, -13, -2, -3, 1]\n", "answer": "7"}
75
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [27, 11, -1, -14, -20, 21, -22, -6, 0, -23, 12, -26, -19, -26, -26, -20, -15, 5, 26, -19, 8, 20]\n", "answer": "6"}
76
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [14, 11, 9, 7, 20, -5, 16, -16, 1, 1, 26, -17, 2, 4, -27, 9, -18, 29, -7, 8, 18, -25]\n", "answer": "6"}
77
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, 3, 10, 6, 19, -20, 16, 24, 21, 4, -29, 2, 5, -10, 2, -21, -11, 26, 7, 24, 5, -22]\n", "answer": "5"}
78
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, 22, -19, 5, 20, -24, 4, -1, -29, -2, 0, 10, 5, 2, -25, -1, -14, 27, -9, -6, 23, -17]\n", "answer": "6"}
79
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, -1, 13, 14, -14, 21, 0, 8, 29, 24, 4, -10, 6, -14, -22, -28, 10, 18, 2, 21, -1, -26]\n", "answer": "7"}
80
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [26, 5, -5, 25, -11, 10, 5, 1, -13, 14, -21, -16, -16, 3, -7, -13, 29, -7, -29, -29, -26, 20]\n", "answer": "5"}
81
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [21, -13, 28, -18, 15, -5, -5, -25, -17, -1, 14, 7, -7, 24, 29, -2, -25, -14, -19, 0, -23, 25]\n", "answer": "6"}
82
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [22, 2, -23, -28, 13, 13, 24, 18, 14, -28, 21, -11, 21, -4, -22, 15, -22, 3, -18, 20, 14, 6]\n", "answer": "5"}
83
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-26, -13, 20, 0, 26, -7, -16, 16, 10, 27, -16, -19, 4, 4, 15, -7, 20, 4, -20, 2, -20, -22]\n", "answer": "6"}
84
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-16, 11, 29, 9, -19, -27, -28, -26, -25, 11, 16, 24, 10, -21, 14, -7, 14, 17, -28, 15, 6, -8]\n", "answer": "7"}
85
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, -26, 1, 25, -22, 10, -2, -21, -25, 13, -28, -8, -16, -29, 13, -28, 19, -22, 12, -1, 7, -9]\n", "answer": "6"}
86
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-28, -29, 14, 17, -18, -6, -29, 1, -18, 6, 14, -4, -9, -4, -19, -21, 22, -23, -14, -24, 0, 23]\n", "answer": "8"}
87
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-3, 18, -2, 26, 18, 4, -16, 6, 14, -28, 18, 12, 24, -1, 18, -18, -6, -27, -25, -7, 13, -23]\n", "answer": "7"}
88
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-5, 10, 5, -20, 3, -1, -14, -17, -19, 24, 19, 10, 9, -29, 4, -7, 16, -9, -11, 27, -23, -18]\n", "answer": "5"}
89
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-17, -24, -14, 19, -21, 5, 5, 6, 12, 2, 16, -24, -19, -12, -21, -24, -2, -2, -26, -17, -17, -9]\n", "answer": "6"}
90
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, -5, -17, 13, 1, 0, 6, -2, -29, -29, 25, -25, -28, 15, 7, -18, -27, 7, -27, 19, -6, -16]\n", "answer": "5"}
91
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [29, -18, -18, 1, 4, -7, 28, 11, -9, -12, 6, -22, -2, -1, -11, 14, -23, -16, -26, 19, 9, 18]\n", "answer": "6"}
92
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, 3, 12, 0, -13, -10, -29, 3, -29, -29, -17, -9, -28, 19, 22, 2, -24, -5, 24, 8, 7, 20]\n", "answer": "6"}
93
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, -10, -11, 12, -7, 6, -13, 22, -20, 13, -3, 0, -23, 11, 8, 12, -20, -26, 25, 28, -15, -4]\n", "answer": "8"}
94
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, -25, -13, 3, 5, 26, -10, 24, -24, 12, -13, -11, -4, -23, 20, -23, -24, 20, 29, -4, 7, 17]\n", "answer": "7"}
95
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [19, -15, -3, 4, -12, 29, 0, 2, 26, -2, -20, 10, 26, -1, 27, 21, -21, -15, -26, -11, -4, 15]\n", "answer": "7"}
96
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, 3, 25, -3, -12, 26, -16, 11, 12, 12, -24, 18, -29, -18, 21, 14, -27, -29, 28, -6, 19, 26]\n", "answer": "6"}
97
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-17, 25, 19, -7, 2, -9, 27, 9, 0, 29, -14, 14, 27, 12, -18, -16, -13, -12, 28, 8, 7, -23]\n", "answer": "7"}
98
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [29, -19, -7, -25, -28, 7, 4, -2, -26, 10, 1, -17, 3, 1, 1, 9, 15, -6, 8, -14, 1, -23]\n", "answer": "7"}
99
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-12, -26, -16, -12, 10, 1, 22, -9, 9, -29, -4, 19, -7, -10, 28, -12, 22, -21, 12, -14, -15, 26]\n", "answer": "8"}
100
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-4, -7, -18, 4, -4, 3, -25, 13, 18, 21, -25, 16, -9, 3, 29, 20, -18, -17, -20, -15, 29, -27]\n", "answer": "7"}
101
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [22, -3, -8, -14, -12, 24, -12, -18, 23, 16, -11, 12, 13, -1, 10, -8, -1, 9, -11, 6, -14, -24]\n", "answer": "6"}
102
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-19, -2, 7, 10, -24, 15, 15, -3, -12, -27, -14, 3, -1, 3, 12, 10, -2, -10, -24, -18, -25, -4]\n", "answer": "5"}
103
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [20, -11, 1, 22, 24, -11, 6, 21, -21, -24, -8, 8, 10, 8, 7, -12, 3, -12, -23, -28, 10, 17]\n", "answer": "6"}
104
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-10, 22, -28, -4, -8, -12, -14, -1, 0, 1, -21, -13, -16, -15, -8, 8, -27, -10, -20, -25, 26, -27]\n", "answer": "7"}
105
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, -9, -25, -7, -2, 16, -5, -17, 17, -3, 13, 1, -3, 29, -24, -13, -11, 5, 23, -5, -6, -8]\n", "answer": "7"}
106
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-27, 24, -17, 26, -3, -26, -25, 25, -2, 26, -12, -27, 20, -2, 18, 23, -7, 19, 14, -16, 22, 29]\n", "answer": "9"}
107
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-22, 10, 25, -12, -20, 26, 5, -5, 26, -12, 20, 12, 5, 27, 3, -15, -29, 16, -17, 23, -14, 23]\n", "answer": "6"}
108
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, 28, -7, 0, -8, 9, 4, 25, 3, 18, 9, 6, 4, 14, -13, -29, -14, 21, 17, -4, -12, -2]\n", "answer": "6"}
109
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [28, -2, 27, 10, -19, -15, 29, 9, 11, 16, 13, 18, -19, 3, 17, -28, 0, -28, 14, -5, -9, -14]\n", "answer": "6"}
110
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, 28, 7, 3, 2, -4, -14, -2, -22, -5, 0, 27, 12, 24, 29, 3, 12, -28, -11, -17, -11, -9]\n", "answer": "6"}
111
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, -2, 5, -22, 7, 20, -16, -23, -25, -3, 11, 14, 18, -25, -28, 26, 8, 15, -10, -21, -17, -16]\n", "answer": "7"}
112
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, -23, 15, 8, -2, 7, 14, 4, 2, -5, -22, 5, 15, -24, 10, -17, -12, -14, 2, 21, -7, -10]\n", "answer": "6"}
113
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 25, 17, -2, 0, -3, 3, 24, -25, 9, 28, -24, 14, -15, -2, 21, -10, -19, 5, 1, 20, 1]\n", "answer": "6"}
114
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [19, 19, 20, 16, -2, 23, -1, -25, 10, 2, 23, -8, -23, -16, 24, 0, -11, 29, 23, 27, -8, -23]\n", "answer": "6"}
115
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-24, -5, -13, -17, -18, 23, 7, -15, 15, 8, -7, 14, -8, -15, 23, 21, 23, 17, -6, -17, -19, 7]\n", "answer": "7"}
116
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [24, 10, 18, 20, -26, -8, -11, -21, -22, -6, 12, 23, 0, -25, -18, 22, 21, -10, -16, -17, 28, 18]\n", "answer": "6"}
117
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, -9, -16, 17, -22, 23, -14, 26, -12, 12, -2, 6, 7, 16, 21, -24, 8, 28, 14, -17, 24, -7]\n", "answer": "9"}
118
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [17, -23, 18, -25, -8, 0, 10, 10, 7, -15, -29, -15, 0, -28, 16, 25, -12, 24, -27, -5, 2, -15]\n", "answer": "6"}
119
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, 23, 19, 24, 18, -11, 17, 23, 22, 22, 25, 23, -8, -19, -14, -2, -11, -11, -11, 9, 24, -17]\n", "answer": "5"}
120
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-20, -5, 11, 8, 19, -14, -3, 19, -20, -24, 17, 8, 16, 29, -12, -27, -5, 27, -23, -22, -8, -9]\n", "answer": "6"}
121
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-14, 28, 19, 29, 11, 4, -3, 24, 16, 4, -3, 11, 4, -24, -9, -7, 3, -17, 6, -12, 24, 23]\n", "answer": "6"}
122
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [26, -27, -14, -6, 5, -17, 26, 4, -13, -28, 4, -22, -28, -11, -19, 7, -14, 29, 28, -20, 6, -1]\n", "answer": "6"}
123
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-27, 29, -21, 26, 1, 10, -16, -5, -15, 11, 26, -12, 26, 24, 20, 1, -17, -8, 23, -15, -11, -24]\n", "answer": "7"}
124
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, 10, 11, 6, -12, 26, 28, 26, -17, -15, -14, -26, 19, -28, -29, 2, -15, 10, 26, 22, -24, 20]\n", "answer": "6"}
125
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-20, -2, 7, -24, 0, -8, 17, -12, 19, -20, 7, 6, 27, -17, -13, 21, -17, 11, -6, 18, -26, -22]\n", "answer": "6"}
126
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, 15, 20, 18, 12, -11, 25, 16, 21, 26, -2, -24, 20, 29, -4, -17, 4, 13, 26, -8, -4, -1]\n", "answer": "6"}
127
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-10, -13, 16, 7, 11, 26, -19, -9, -22, 28, -13, 1, -8, 26, 9, 10, 13, -19, 21, -8, 8, -14]\n", "answer": "7"}
128
+ {"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, -8, 20, -21, -23, 10, 1, 25, 24, -12, 3, 27, -8, 18, -29, -4, 8, 18, 5, 10, -14, -29]\n", "answer": "6"}