-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbenchmark_dataset.json
More file actions
7602 lines (7602 loc) · 318 KB
/
Copy pathbenchmark_dataset.json
File metadata and controls
7602 lines (7602 loc) · 318 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
[
{
"id": 1,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 0-0\ndef process_values_0(data_item_0, target_number_0):\n low = 0\n high = len(data_item_0) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_item_0[mid] == target_number_0:\n return mid\n if data_item_0[mid] < target_number_0:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = process_values_0([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 2,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 1-0\ndef solve_1(data_item_1, target_target_1):\n for position in range(len(data_item_1)):\n if data_item_1[position] == target_target_1:\n return position\n return -1\n\nanswer = solve_1([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 3,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 2-0\ndef calculate_total_2(number):\n if number <= 1:\n return 1\n return number * calculate_total_2(number - 1)\n\nprint(calculate_total_2(5))\n"
},
{
"id": 4,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 3-0\ndef count_items_3(data_value_3):\n total = 0\n for value in data_value_3:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(count_items_3([2, 5, 6, 7, 8]))\n"
},
{
"id": 5,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 4-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 6,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 5-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 7,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 6-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 8,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 7-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 9,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 8-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 10,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 9-0\ndef build_result_9(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(build_result_9(7))\n"
},
{
"id": 11,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 10-0\ndef solve_10(data_target_10, target_item_10):\n low = 0\n high = len(data_target_10) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_target_10[mid] == target_item_10:\n return mid\n if data_target_10[mid] < target_item_10:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = solve_10([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 12,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 11-0\ndef build_result_11(data_item_11, target_current_11):\n for position in range(len(data_item_11)):\n if data_item_11[position] == target_current_11:\n return position\n return -1\n\nanswer = build_result_11([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 13,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 12-0\ndef student_solution_12(number):\n if number <= 1:\n return 1\n return number * student_solution_12(number - 1)\n\nprint(student_solution_12(5))\n"
},
{
"id": 14,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 13-0\ndef calculate_total_13(data_number_13):\n total = 0\n for value in data_number_13:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(calculate_total_13([2, 5, 6, 7, 8]))\n"
},
{
"id": 15,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 14-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 16,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 15-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 17,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 16-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 18,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 17-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 19,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 18-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 20,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 19-0\ndef student_solution_19(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(student_solution_19(7))\n"
},
{
"id": 21,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 20-0\ndef count_items_20(data_count_20, target_current_20):\n low = 0\n high = len(data_count_20) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_count_20[mid] == target_current_20:\n return mid\n if data_count_20[mid] < target_current_20:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = count_items_20([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 22,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 21-0\ndef build_result_21(data_score_21, target_number_21):\n for position in range(len(data_score_21)):\n if data_score_21[position] == target_number_21:\n return position\n return -1\n\nanswer = build_result_21([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 23,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 22-0\ndef run_example_22(number):\n if number <= 1:\n return 1\n return number * run_example_22(number - 1)\n\nprint(run_example_22(5))\n"
},
{
"id": 24,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 23-0\ndef process_values_23(data_index_23):\n total = 0\n for value in data_index_23:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(process_values_23([2, 5, 6, 7, 8]))\n"
},
{
"id": 25,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 24-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 26,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 25-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 27,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 26-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 28,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 27-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 29,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 28-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 30,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 29-0\ndef run_example_29(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(run_example_29(7))\n"
},
{
"id": 31,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 30-0\ndef student_solution_30(data_total_30, target_index_30):\n low = 0\n high = len(data_total_30) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_total_30[mid] == target_index_30:\n return mid\n if data_total_30[mid] < target_index_30:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = student_solution_30([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 32,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 31-0\ndef process_values_31(data_score_31, target_total_31):\n for position in range(len(data_score_31)):\n if data_score_31[position] == target_total_31:\n return position\n return -1\n\nanswer = process_values_31([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 33,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 32-0\ndef run_example_32(number):\n if number <= 1:\n return 1\n return number * run_example_32(number - 1)\n\nprint(run_example_32(5))\n"
},
{
"id": 34,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 33-0\ndef count_items_33(data_result_33):\n total = 0\n for value in data_result_33:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(count_items_33([2, 5, 6, 7, 8]))\n"
},
{
"id": 35,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 34-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 36,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 35-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 37,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 36-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 38,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 37-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 39,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 38-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 40,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 39-0\ndef count_items_39(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(count_items_39(7))\n"
},
{
"id": 41,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 40-0\ndef run_example_40(data_answer_40, target_index_40):\n low = 0\n high = len(data_answer_40) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_answer_40[mid] == target_index_40:\n return mid\n if data_answer_40[mid] < target_index_40:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = run_example_40([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 42,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 41-0\ndef search_item_41(data_value_41, target_result_41):\n for position in range(len(data_value_41)):\n if data_value_41[position] == target_result_41:\n return position\n return -1\n\nanswer = search_item_41([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 43,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 42-0\ndef build_result_42(number):\n if number <= 1:\n return 1\n return number * build_result_42(number - 1)\n\nprint(build_result_42(5))\n"
},
{
"id": 44,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 43-0\ndef student_solution_43(data_total_43):\n total = 0\n for value in data_total_43:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(student_solution_43([2, 5, 6, 7, 8]))\n"
},
{
"id": 45,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 44-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 46,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 45-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 47,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 46-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 48,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 47-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 49,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 48-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 50,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 49-0\ndef search_item_49(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(search_item_49(7))\n"
},
{
"id": 51,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 50-0\ndef count_items_50(data_total_50, target_total_50):\n low = 0\n high = len(data_total_50) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_total_50[mid] == target_total_50:\n return mid\n if data_total_50[mid] < target_total_50:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = count_items_50([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 52,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 51-0\ndef calculate_total_51(data_score_51, target_current_51):\n for position in range(len(data_score_51)):\n if data_score_51[position] == target_current_51:\n return position\n return -1\n\nanswer = calculate_total_51([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 53,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 52-0\ndef run_example_52(number):\n if number <= 1:\n return 1\n return number * run_example_52(number - 1)\n\nprint(run_example_52(5))\n"
},
{
"id": 54,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 53-0\ndef student_solution_53(data_value_53):\n total = 0\n for value in data_value_53:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(student_solution_53([2, 5, 6, 7, 8]))\n"
},
{
"id": 55,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 54-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 56,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 55-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 57,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 56-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 58,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 57-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 59,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 58-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 60,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 59-0\ndef search_item_59(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(search_item_59(7))\n"
},
{
"id": 61,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 60-0\ndef build_result_60(data_total_60, target_value_60):\n low = 0\n high = len(data_total_60) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_total_60[mid] == target_value_60:\n return mid\n if data_total_60[mid] < target_value_60:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = build_result_60([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 62,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 61-0\ndef solve_61(data_score_61, target_total_61):\n for position in range(len(data_score_61)):\n if data_score_61[position] == target_total_61:\n return position\n return -1\n\nanswer = solve_61([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 63,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 62-0\ndef student_solution_62(number):\n if number <= 1:\n return 1\n return number * student_solution_62(number - 1)\n\nprint(student_solution_62(5))\n"
},
{
"id": 64,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 63-0\ndef run_example_63(data_result_63):\n total = 0\n for value in data_result_63:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(run_example_63([2, 5, 6, 7, 8]))\n"
},
{
"id": 65,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 64-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 66,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 65-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 67,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 66-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 68,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 67-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 69,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 68-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 70,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 69-0\ndef calculate_total_69(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(calculate_total_69(7))\n"
},
{
"id": 71,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 70-0\ndef solve_70(data_total_70, target_answer_70):\n low = 0\n high = len(data_total_70) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_total_70[mid] == target_answer_70:\n return mid\n if data_total_70[mid] < target_answer_70:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = solve_70([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 72,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 71-0\ndef build_result_71(data_answer_71, target_number_71):\n for position in range(len(data_answer_71)):\n if data_answer_71[position] == target_number_71:\n return position\n return -1\n\nanswer = build_result_71([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 73,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 72-0\ndef calculate_total_72(number):\n if number <= 1:\n return 1\n return number * calculate_total_72(number - 1)\n\nprint(calculate_total_72(5))\n"
},
{
"id": 74,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 73-0\ndef student_solution_73(data_value_73):\n total = 0\n for value in data_value_73:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(student_solution_73([2, 5, 6, 7, 8]))\n"
},
{
"id": 75,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 74-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 76,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 75-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 77,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 76-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 78,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 77-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 79,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 78-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 80,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 79-0\ndef search_item_79(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(search_item_79(7))\n"
},
{
"id": 81,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 80-0\ndef calculate_total_80(data_answer_80, target_limit_80):\n low = 0\n high = len(data_answer_80) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_answer_80[mid] == target_limit_80:\n return mid\n if data_answer_80[mid] < target_limit_80:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = calculate_total_80([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 82,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 81-0\ndef build_result_81(data_score_81, target_score_81):\n for position in range(len(data_score_81)):\n if data_score_81[position] == target_score_81:\n return position\n return -1\n\nanswer = build_result_81([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 83,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 82-0\ndef calculate_total_82(number):\n if number <= 1:\n return 1\n return number * calculate_total_82(number - 1)\n\nprint(calculate_total_82(5))\n"
},
{
"id": 84,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 83-0\ndef build_result_83(data_limit_83):\n total = 0\n for value in data_limit_83:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(build_result_83([2, 5, 6, 7, 8]))\n"
},
{
"id": 85,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 84-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 86,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 85-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 87,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 86-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 88,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 87-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 89,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 88-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 90,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 89-0\ndef process_values_89(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(process_values_89(7))\n"
},
{
"id": 91,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 90-0\ndef search_item_90(data_score_90, target_item_90):\n low = 0\n high = len(data_score_90) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_score_90[mid] == target_item_90:\n return mid\n if data_score_90[mid] < target_item_90:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = search_item_90([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 92,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 91-0\ndef solve_91(data_score_91, target_count_91):\n for position in range(len(data_score_91)):\n if data_score_91[position] == target_count_91:\n return position\n return -1\n\nanswer = solve_91([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 93,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 92-0\ndef search_item_92(number):\n if number <= 1:\n return 1\n return number * search_item_92(number - 1)\n\nprint(search_item_92(5))\n"
},
{
"id": 94,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 93-0\ndef search_item_93(data_target_93):\n total = 0\n for value in data_target_93:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(search_item_93([2, 5, 6, 7, 8]))\n"
},
{
"id": 95,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 94-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 96,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 95-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 97,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 96-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 98,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 97-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 99,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 98-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 100,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 99-0\ndef count_items_99(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(count_items_99(7))\n"
},
{
"id": 101,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 100-0\ndef count_items_100(data_target_100, target_answer_100):\n low = 0\n high = len(data_target_100) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_target_100[mid] == target_answer_100:\n return mid\n if data_target_100[mid] < target_answer_100:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = count_items_100([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 102,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 101-0\ndef student_solution_101(data_score_101, target_total_101):\n for position in range(len(data_score_101)):\n if data_score_101[position] == target_total_101:\n return position\n return -1\n\nanswer = student_solution_101([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 103,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 102-0\ndef solve_102(number):\n if number <= 1:\n return 1\n return number * solve_102(number - 1)\n\nprint(solve_102(5))\n"
},
{
"id": 104,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 103-0\ndef run_example_103(data_answer_103):\n total = 0\n for value in data_answer_103:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(run_example_103([2, 5, 6, 7, 8]))\n"
},
{
"id": 105,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 104-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 106,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 105-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 107,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 106-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 108,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 107-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 109,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 108-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 110,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 109-0\ndef count_items_109(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(count_items_109(7))\n"
},
{
"id": 111,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 110-0\ndef search_item_110(data_index_110, target_count_110):\n low = 0\n high = len(data_index_110) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_index_110[mid] == target_count_110:\n return mid\n if data_index_110[mid] < target_count_110:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = search_item_110([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 112,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 111-0\ndef solve_111(data_target_111, target_current_111):\n for position in range(len(data_target_111)):\n if data_target_111[position] == target_current_111:\n return position\n return -1\n\nanswer = solve_111([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 113,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 112-0\ndef solve_112(number):\n if number <= 1:\n return 1\n return number * solve_112(number - 1)\n\nprint(solve_112(5))\n"
},
{
"id": 114,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 113-0\ndef student_solution_113(data_score_113):\n total = 0\n for value in data_score_113:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(student_solution_113([2, 5, 6, 7, 8]))\n"
},
{
"id": 115,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 114-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 116,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 115-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 117,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 116-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 118,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 117-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 119,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 118-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 120,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 119-0\ndef search_item_119(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(search_item_119(7))\n"
},
{
"id": 121,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 120-0\ndef count_items_120(data_score_120, target_total_120):\n low = 0\n high = len(data_score_120) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_score_120[mid] == target_total_120:\n return mid\n if data_score_120[mid] < target_total_120:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = count_items_120([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 122,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 121-0\ndef student_solution_121(data_score_121, target_number_121):\n for position in range(len(data_score_121)):\n if data_score_121[position] == target_number_121:\n return position\n return -1\n\nanswer = student_solution_121([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 123,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 122-0\ndef build_result_122(number):\n if number <= 1:\n return 1\n return number * build_result_122(number - 1)\n\nprint(build_result_122(5))\n"
},
{
"id": 124,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 123-0\ndef process_values_123(data_score_123):\n total = 0\n for value in data_score_123:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(process_values_123([2, 5, 6, 7, 8]))\n"
},
{
"id": 125,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 124-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 126,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 125-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 127,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 126-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 128,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 127-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 129,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 128-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 130,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 129-0\ndef student_solution_129(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(student_solution_129(7))\n"
},
{
"id": 131,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 130-0\ndef count_items_130(data_item_130, target_item_130):\n low = 0\n high = len(data_item_130) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_item_130[mid] == target_item_130:\n return mid\n if data_item_130[mid] < target_item_130:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = count_items_130([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 132,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 131-0\ndef process_values_131(data_target_131, target_count_131):\n for position in range(len(data_target_131)):\n if data_target_131[position] == target_count_131:\n return position\n return -1\n\nanswer = process_values_131([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 133,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 132-0\ndef student_solution_132(number):\n if number <= 1:\n return 1\n return number * student_solution_132(number - 1)\n\nprint(student_solution_132(5))\n"
},
{
"id": 134,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 133-0\ndef count_items_133(data_answer_133):\n total = 0\n for value in data_answer_133:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(count_items_133([2, 5, 6, 7, 8]))\n"
},
{
"id": 135,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 134-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 136,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 135-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 137,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 136-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 138,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 137-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 139,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 138-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 140,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 139-0\ndef count_items_139(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(count_items_139(7))\n"
},
{
"id": 141,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 140-0\ndef calculate_total_140(data_limit_140, target_score_140):\n low = 0\n high = len(data_limit_140) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_limit_140[mid] == target_score_140:\n return mid\n if data_limit_140[mid] < target_score_140:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = calculate_total_140([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 142,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 141-0\ndef solve_141(data_index_141, target_score_141):\n for position in range(len(data_index_141)):\n if data_index_141[position] == target_score_141:\n return position\n return -1\n\nanswer = solve_141([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 143,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 142-0\ndef search_item_142(number):\n if number <= 1:\n return 1\n return number * search_item_142(number - 1)\n\nprint(search_item_142(5))\n"
},
{
"id": 144,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 143-0\ndef solve_143(data_limit_143):\n total = 0\n for value in data_limit_143:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(solve_143([2, 5, 6, 7, 8]))\n"
},
{
"id": 145,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 144-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 146,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 145-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 147,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 146-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 148,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 147-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 149,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 148-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 150,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 149-0\ndef run_example_149(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(run_example_149(7))\n"
},
{
"id": 151,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 150-0\ndef search_item_150(data_count_150, target_result_150):\n low = 0\n high = len(data_count_150) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_count_150[mid] == target_result_150:\n return mid\n if data_count_150[mid] < target_result_150:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = search_item_150([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 152,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 151-0\ndef calculate_total_151(data_count_151, target_current_151):\n for position in range(len(data_count_151)):\n if data_count_151[position] == target_current_151:\n return position\n return -1\n\nanswer = calculate_total_151([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 153,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 152-0\ndef run_example_152(number):\n if number <= 1:\n return 1\n return number * run_example_152(number - 1)\n\nprint(run_example_152(5))\n"
},
{
"id": 154,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 153-0\ndef run_example_153(data_value_153):\n total = 0\n for value in data_value_153:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(run_example_153([2, 5, 6, 7, 8]))\n"
},
{
"id": 155,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 154-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 156,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 155-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 157,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct matrix traversal case 156-0\nmatrix = [[1, 2], [3, 4], [5, 6]]\ntotal = 0\nfor row in matrix:\n for value in row:\n total += value\nprint(total)\n"
},
{
"id": 158,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct tuple use case 157-0\npoint = (3, 5)\nx_value = point[0]\ny_value = point[1]\nprint(x_value + y_value)\n"
},
{
"id": 159,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct insertion style pass case 158-0\nnumbers = [5, 2, 4, 1]\nordered = []\nfor value in numbers:\n ordered.append(value)\nordered.sort()\nprint(ordered[0])\n"
},
{
"id": 160,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct fibonacci case 159-0\ndef solve_159(number):\n if number <= 1:\n return number\n first = 0\n second = 1\n for step in range(2, number + 1):\n first, second = second, first + second\n return second\n\nprint(solve_159(7))\n"
},
{
"id": 161,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct binary search case 160-0\ndef process_values_160(data_result_160, target_limit_160):\n low = 0\n high = len(data_result_160) - 1\n while low <= high:\n mid = (low + high) // 2\n if data_result_160[mid] == target_limit_160:\n return mid\n if data_result_160[mid] < target_limit_160:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nposition = process_values_160([1, 3, 5, 7, 9], 7)\nprint(position)\n"
},
{
"id": 162,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct linear search case 161-0\ndef run_example_161(data_score_161, target_current_161):\n for position in range(len(data_score_161)):\n if data_score_161[position] == target_current_161:\n return position\n return -1\n\nanswer = run_example_161([4, 8, 12, 16], 12)\nprint(answer)\n"
},
{
"id": 163,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct factorial case 162-0\ndef calculate_total_162(number):\n if number <= 1:\n return 1\n return number * calculate_total_162(number - 1)\n\nprint(calculate_total_162(5))\n"
},
{
"id": 164,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct counting case 163-0\ndef process_values_163(data_score_163):\n total = 0\n for value in data_score_163:\n if value % 2 == 0:\n total += 1\n return total\n\nprint(process_values_163([2, 5, 6, 7, 8]))\n"
},
{
"id": 165,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct stack case 164-0\nstack = []\nfor value in [1, 2, 3]:\n stack.append(value)\ntop_value = stack.pop()\nprint(top_value)\n"
},
{
"id": 166,
"category": "Correct Programs",
"expected": [],
"code": "# CodeLens benchmark: correct dictionary case 165-0\nstudent = {'name': 'Asha', 'score': 88}\nbonus = 5\nstudent['score'] = student['score'] + bonus\nprint(student['score'])\n"
},
{
"id": 167,
"category": "Correct Programs",