task_name string | source_code string | compiler_asm string | object_asm string | shared_asm string | program_asm string |
|---|---|---|---|---|---|
C_1 | #include <assert.h>
#include <string.h>
// Return "Hello, MMCODEEVAL: Masssively Multilingual Code Evaluation"
char *hello_mmcodeeval(){
return "Hello, MMCODEEVAL: Masssively Multilingual Code Evaluation";
} | .arch armv8-a
.file "source.c"
.text
.section .rodata
.align 3
.LC0:
.string "Hello, MMCODEEVAL: Masssively Multilingual Code Evaluation"
.text
.align 2
.global hello_mmcodeeval
.type hello_mmcodeeval, %function
hello_mmcodeeval:
.LFB0:
.cfi_startproc
adrp x0, .LC0
add x0, x0, :lo12:.LC0
ret
.cfi_endproc... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/000_C_1/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <hello_mmcodeeval>:
0: 90000000 adrp x0, 0 <hello_mmcodeeval>
4: 91000000 add x0, x0, #0x0
8: d65f03c0 ret
|
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/000_C_1/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
42... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/000_C_1/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_fn... |
C_10 | #include <assert.h>
#include <stdio.h>
/*
Calculate the sum of even numbers in a given list.
Parameters:
- numbers (list): A list of integers.
- size (int): The size of the list.
Returns:
int: The sum of even numbers in the input list.
>>> calculate_even_sum([1,4,3,2,5], 5)
6
*/
int calculate_even_s... | .arch armv8-a
.file "source.c"
.text
.align 2
.global calculate_even_sum
.type calculate_even_sum, %function
calculate_even_sum:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str x0, [sp, 8]
str w1, [sp, 4]
str wzr, [sp, 24]
str wzr, [sp, 28]
b .L2
.L4:
ldrsw x0, [sp, 28]
lsl x0, x0, 2
l... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/001_C_10/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <calculate_even_sum>:
0: d10083ff sub sp, sp, #0x20
4: f90007e0 str x0, [sp, #8]
8: b90007e1 str w1, [sp, #4]
c: b9001bff st... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/001_C_10/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/001_C_10/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_11 | #include <assert.h>
#include <stdio.h>
/*
Determine if two closed intervals intersect.
β Args:
β a, b: Representing the first closed interval [a, b] where 0 <= a <= b <= 1000.
β c, d: Representing the second closed interval [c, d] where 0 <= c <= d <= 1000.
β Returns:
β int: 1 if the intervals intersect,... | .arch armv8-a
.file "source.c"
.text
.align 2
.global are_intervals_intersecting
.type are_intervals_intersecting, %function
are_intervals_intersecting:
.LFB0:
.cfi_startproc
sub sp, sp, #16
.cfi_def_cfa_offset 16
str w0, [sp, 12]
str w1, [sp, 8]
str w2, [sp, 4]
str w3, [sp]
ldr w1, [sp, 4]
ldr w0, [sp, ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/002_C_11/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <are_intervals_intersecting>:
0: d10043ff sub sp, sp, #0x10
4: b9000fe0 str w0, [sp, #12]
8: b9000be1 str w1, [sp, #8]
c: b90... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/002_C_11/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000420 <_init>:
420: d503201f nop
424: a9bf7bfd stp x29, x30, [sp, #-16]!
428: 910003fd mov x29, sp
42c: 94000015 bl 480 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/002_C_11/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_12 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
/*
You are given three digits a, b, c. Two of them are equal, but the third one is different from the other two. Find the value that occurs exactly once.
>>> extraNumber(0,0,1)
1
>>> extraNumber(4,3,4)
3
*/
int extraNumber(int... | .arch armv8-a
.file "source.c"
.text
.align 2
.global extraNumber
.type extraNumber, %function
extraNumber:
.LFB0:
.cfi_startproc
sub sp, sp, #16
.cfi_def_cfa_offset 16
str w0, [sp, 12]
str w1, [sp, 8]
str w2, [sp, 4]
ldr w1, [sp, 12]
ldr w0, [sp, 8]
cmp w1, w0
bne .L2
ldr w0, [sp, 4]
b .L3
.L2:
ldr ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/003_C_12/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <extraNumber>:
0: d10043ff sub sp, sp, #0x10
4: b9000fe0 str w0, [sp, #12]
8: b9000be1 str w1, [sp, #8]
c: b90007e2 str w2, ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/003_C_12/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/003_C_12/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_13 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Calculate the total score for a student based on the scores in different subjects.
Parameters:
- subject_scores (list): A list containing the scores for each subject.
Returns:
int: The total score obtained b... | .arch armv8-a
.file "source.c"
.text
.align 2
.global calculate_total_score
.type calculate_total_score, %function
calculate_total_score:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str w0, [sp, 28]
str w1, [sp, 24]
str w2, [sp, 20]
str w3, [sp, 16]
str w4, [sp, 12]
ldr w1, [sp, 28]
ldr... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/004_C_13/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <calculate_total_score>:
0: d10083ff sub sp, sp, #0x20
4: b9001fe0 str w0, [sp, #28]
8: b9001be1 str w1, [sp, #24]
c: b90017e... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/004_C_13/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000420 <_init>:
420: d503201f nop
424: a9bf7bfd stp x29, x30, [sp, #-16]!
428: 910003fd mov x29, sp
42c: 94000015 bl 480 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/004_C_13/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_14 | #include <assert.h>
#include <stdio.h>
#include <string.h>
/*
Decode a series of numbers to reveal the pattern and understand the actual values
each digit represents.
0000=4 8888=8 1234=1 5678=3 9012=2 1357=0 2468=4
Parameters:
- data_str: A string representing a series of numbers. Length does not exceed 100.
Return... | .arch armv8-a
.file "source.c"
.text
.align 2
.global decode_numbers
.type decode_numbers, %function
decode_numbers:
.LFB0:
.cfi_startproc
sub sp, sp, #112
.cfi_def_cfa_offset 112
stp x29, x30, [sp, 80]
.cfi_offset 29, -32
.cfi_offset 30, -24
add x29, sp, 80
str x19, [sp, 96]
.cfi_offset 19, -16
str x0,... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/005_C_14/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <decode_numbers>:
0: d101c3ff sub sp, sp, #0x70
4: a9057bfd stp x29, x30, [sp, #80]
8: 910143fd add x29, sp, #0x50
c: f90033f... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/005_C_14/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000550 <_init>:
550: d503201f nop
554: a9bf7bfd stp x29, x30, [sp, #-16]!
558: 910003fd mov x29, sp
55c: 9400001d bl 5d0 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/005_C_14/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000678 <_init>:
678: d503201f nop
67c: a9bf7bfd stp x29, x30, [sp, #-16]!
680: 910003fd mov x29, sp
684: 9400003c bl 774 <call_weak_f... |
C_15 | #include <assert.h>
#include <stdio.h>
/*
Counts the number of different coloring methods for n squares with m colors,
considering the requirement that adjacent squares and the first/last squares
must have different colors.
Args:
- n (int): The number of squares.
- m (int): The number of colors.
Returns:
in... | .arch armv8-a
.file "source.c"
.text
.align 2
.global count_coloring_methods
.type count_coloring_methods, %function
count_coloring_methods:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -16]!
.cfi_def_cfa_offset 16
.cfi_offset 29, -16
.cfi_offset 30, -8
mov x29, sp
mov x13, 4480
sub sp, sp, x13
.cfi_def_cfa_... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/006_C_15/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <count_coloring_methods>:
0: a9bf7bfd stp x29, x30, [sp, #-16]!
4: 910003fd mov x29, sp
8: d282300d mov x13, #0x1180 ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/006_C_15/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000520 <_init>:
520: d503201f nop
524: a9bf7bfd stp x29, x30, [sp, #-16]!
528: 910003fd mov x29, sp
52c: 94000019 bl 590 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/006_C_15/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000640 <_init>:
640: d503201f nop
644: a9bf7bfd stp x29, x30, [sp, #-16]!
648: 910003fd mov x29, sp
64c: 9400003a bl 734 <call_weak_f... |
C_16 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Count the number of valid coin toss sequences with no consecutive heads in n tosses.
β Parameters:
- n (int): The number of coin tosses.
β Returns:
β unsigned long long: The count of valid sequences.
>>> co... | .arch armv8-a
.file "source.c"
.text
.align 2
.global count_valid_coin_toss_sequences
.type count_valid_coin_toss_sequences, %function
count_valid_coin_toss_sequences:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -16]!
.cfi_def_cfa_offset 16
.cfi_offset 29, -16
.cfi_offset 30, -8
mov x29, sp
sub sp, sp, #688
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/007_C_16/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <count_valid_coin_toss_sequences>:
0: a9bf7bfd stp x29, x30, [sp, #-16]!
4: 910003fd mov x29, sp
8: d10ac3ff sub sp, sp, #0x2b0
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/007_C_16/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000528 <_init>:
528: d503201f nop
52c: a9bf7bfd stp x29, x30, [sp, #-16]!
530: 910003fd mov x29, sp
534: 94000017 bl 590 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/007_C_16/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000640 <_init>:
640: d503201f nop
644: a9bf7bfd stp x29, x30, [sp, #-16]!
648: 910003fd mov x29, sp
64c: 9400003a bl 734 <call_weak_f... |
C_17 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Find the length of the longest consecutive sequence of 1s in the binary representation of a non-negative integer.
β Parameters:
- n (unsigned long long): A non-negative integer (0 β€ n β€ 2^64 - 1).
β Returns:
β ... | .arch armv8-a
.file "source.c"
.text
.align 2
.global find_longest_consecutive_ones_length
.type find_longest_consecutive_ones_length, %function
find_longest_consecutive_ones_length:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str x0, [sp, 8]
str wzr, [sp, 24]
str wzr, [sp, 28]
b .L2
.L6:
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/008_C_17/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <find_longest_consecutive_ones_length>:
0: d10083ff sub sp, sp, #0x20
4: f90007e0 str x0, [sp, #8]
8: b9001bff str wzr, [sp, #24... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/008_C_17/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000430 <_init>:
430: d503201f nop
434: a9bf7bfd stp x29, x30, [sp, #-16]!
438: 910003fd mov x29, sp
43c: 94000015 bl 490 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/008_C_17/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_18 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
/*
Creates an ID by combining two words in a specific manner.
βParameters:
- word1 (char*): The first word to be used in the ID.
- word2 (char*): The second word to be used in the ID.
βReturns:
βchar*: A divine ID formed by reversing every o... | .arch armv8-a
.file "source.c"
.text
.align 2
.global create_id
.type create_id, %function
create_id:
.LFB6:
.cfi_startproc
stp x29, x30, [sp, -64]!
.cfi_def_cfa_offset 64
.cfi_offset 29, -64
.cfi_offset 30, -56
mov x29, sp
str x0, [sp, 24]
str x1, [sp, 16]
ldr x0, [sp, 24]
bl strlen
str w0, [sp, 44]
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/009_C_18/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <create_id>:
0: a9bc7bfd stp x29, x30, [sp, #-64]!
4: 910003fd mov x29, sp
8: f9000fe0 str x0, [sp, #24]
c: f9000be1 str x1,... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/009_C_18/code.so: file format elf64-littleaarch64
Disassembly of section .init:
00000000000004c8 <_init>:
4c8: d503201f nop
4cc: a9bf7bfd stp x29, x30, [sp, #-16]!
4d0: 910003fd mov x29, sp
4d4: 9400001b bl 540 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/009_C_18/code.program: file format elf64-littleaarch64
Disassembly of section .init:
00000000000005f8 <_init>:
5f8: d503201f nop
5fc: a9bf7bfd stp x29, x30, [sp, #-16]!
600: 910003fd mov x29, sp
604: 9400003c bl 6f4 <call_weak_f... |
C_19 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Count the number of different permutation schemes for a binary string of length n,
where the number of '1's is m and the number of '0's is n - m.
β Parameters:
- n (int): Length of the binary string.
- m (int): Numbe... | .arch armv8-a
.file "source.c"
.text
.align 2
.global count_permutations_of_binary_string
.type count_permutations_of_binary_string, %function
count_permutations_of_binary_string:
.LFB0:
.cfi_startproc
sub sp, sp, #64
.cfi_def_cfa_offset 64
str w0, [sp, 12]
str w1, [sp, 8]
fmov d0, 1.0e+0
str d0, [sp, 32]
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/010_C_19/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <count_permutations_of_binary_string>:
0: d10103ff sub sp, sp, #0x40
4: b9000fe0 str w0, [sp, #12]
8: b9000be1 str w1, [sp, #8]
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/010_C_19/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000430 <_init>:
430: d503201f nop
434: a9bf7bfd stp x29, x30, [sp, #-16]!
438: 910003fd mov x29, sp
43c: 94000015 bl 490 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/010_C_19/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_2 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Calculate the area of a triangle given its three sides.
β Parameters:
- a (float): Length of side 'a'.
- b (float): Length of side 'b'.
- c (float): Length of side 'c'.
β Returns:
- str: If the provided sides form... | .arch armv8-a
.file "source.c"
.text
.align 2
.global calculate_triangle_area
.type calculate_triangle_area, %function
calculate_triangle_area:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -64]!
.cfi_def_cfa_offset 64
.cfi_offset 29, -64
.cfi_offset 30, -56
mov x29, sp
str d0, [sp, 40]
str d1, [sp, 32]
str d... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/011_C_2/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <calculate_triangle_area>:
0: a9bc7bfd stp x29, x30, [sp, #-64]!
4: 910003fd mov x29, sp
8: fd0017e0 str d0, [sp, #40]
c: fd00... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/011_C_2/code.so: file format elf64-littleaarch64
Disassembly of section .init:
00000000000004a0 <_init>:
4a0: d503201f nop
4a4: a9bf7bfd stp x29, x30, [sp, #-16]!
4a8: 910003fd mov x29, sp
4ac: 94000019 bl 510 <call_weak_fn>
4b... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/011_C_2/code.program: file format elf64-littleaarch64
Disassembly of section .init:
00000000000005e0 <_init>:
5e0: d503201f nop
5e4: a9bf7bfd stp x29, x30, [sp, #-16]!
5e8: 910003fd mov x29, sp
5ec: 94000032 bl 6b4 <call_weak_fn... |
C_20 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
β Answer a series of questions by providing choices A, B, C, or D for each question.
β Question 1:
β Constants like 1e6 belong to which data type?
β A. unsigned int
β B. int
β C. float
β ... | .arch armv8-a
.file "source.c"
.text
.section .rodata
.align 3
.LC0:
.string "DDDBA"
.text
.align 2
.global answer_questions
.type answer_questions, %function
answer_questions:
.LFB0:
.cfi_startproc
adrp x0, .LC0
add x0, x0, :lo12:.LC0
ret
.cfi_endproc
.LFE0:
.size answer_questions, .-answer_questions
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/012_C_20/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <answer_questions>:
0: 90000000 adrp x0, 0 <answer_questions>
4: 91000000 add x0, x0, #0x0
8: d65f03c0 ret
|
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/012_C_20/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/012_C_20/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_21 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
The task is to determine if it is possible to assemble the wooden squares from n buckets,
where each bucket contains $a_i$ squares with a side length of 1, into a single larger square.
Input: length of list, array of nu... | .arch armv8-a
.file "source.c"
.text
.align 2
.global Is_Square
.type Is_Square, %function
Is_Square:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -48]!
.cfi_def_cfa_offset 48
.cfi_offset 29, -48
.cfi_offset 30, -40
mov x29, sp
str w0, [sp, 28]
str x1, [sp, 16]
str xzr, [sp, 40]
str wzr, [sp, 32]
b .L2
.L3... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/013_C_21/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <Is_Square>:
0: a9bd7bfd stp x29, x30, [sp, #-48]!
4: 910003fd mov x29, sp
8: b9001fe0 str w0, [sp, #28]
c: f9000be1 str x1,... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/013_C_21/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000490 <_init>:
490: d503201f nop
494: a9bf7bfd stp x29, x30, [sp, #-16]!
498: 910003fd mov x29, sp
49c: 94000019 bl 500 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/013_C_21/code.program: file format elf64-littleaarch64
Disassembly of section .init:
00000000000005e0 <_init>:
5e0: d503201f nop
5e4: a9bf7bfd stp x29, x30, [sp, #-16]!
5e8: 910003fd mov x29, sp
5ec: 94000032 bl 6b4 <call_weak_f... |
C_22 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Given integers c and d, where a + b = c and a * b = d, find and return the possible value of a (a <= b). If there are multiple groups, output the group with the smallest a.
Parameters:
- c (int): The sum of a an... | .arch armv8-a
.file "source.c"
.text
.align 2
.global find_integers
.type find_integers, %function
find_integers:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str w0, [sp, 12]
str w1, [sp, 8]
str wzr, [sp, 28]
b .L2
.L6:
ldr w1, [sp, 12]
ldr w0, [sp, 28]
sub w1, w1, w0
ldr w0, [sp, 28]
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/014_C_22/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <find_integers>:
0: d10083ff sub sp, sp, #0x20
4: b9000fe0 str w0, [sp, #12]
8: b9000be1 str w1, [sp, #8]
c: b9001fff str wz... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/014_C_22/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/014_C_22/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_23 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include <stdlib.h>
/*
Count the number of acute-angled triangles that can be formed by selecting any 3 edges out of a given set of edges.
Args:
- edges_count: The number of edges passed.
- An arbi... | .arch armv8-a
.file "source.c"
.text
.align 2
.global count_acute_triangles
.type count_acute_triangles, %function
count_acute_triangles:
.LFB6:
.cfi_startproc
sub sp, sp, #304
.cfi_def_cfa_offset 304
stp x29, x30, [sp, 96]
.cfi_offset 29, -208
.cfi_offset 30, -200
add x29, sp, 96
str w0, [sp, 12]
str x1... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/015_C_23/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <count_acute_triangles>:
0: d104c3ff sub sp, sp, #0x130
4: a9067bfd stp x29, x30, [sp, #96]
8: 910183fd add x29, sp, #0x60
c:... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/015_C_23/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000600 <_init>:
600: d503201f nop
604: a9bf7bfd stp x29, x30, [sp, #-16]!
608: 910003fd mov x29, sp
60c: 94000025 bl 6a0 <call_weak_fn>
6... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/015_C_23/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000720 <_init>:
720: d503201f nop
724: a9bf7bfd stp x29, x30, [sp, #-16]!
728: 910003fd mov x29, sp
72c: 94000042 bl 834 <call_weak_f... |
C_24 | #include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*
Reads an integer and a character, then returns them as a formatted string separated by a comma.
Parameters:
- integer_value (int): The input integer.
- char_value (char): The input character.
Returns:
- char*: A string containing the inte... | .arch armv8-a
.file "source.c"
.text
.section .rodata
.align 3
.LC0:
.string "Memory allocation failed\n"
.align 3
.LC1:
.string "%d,%c"
.text
.align 2
.global process_integer_and_char
.type process_integer_and_char, %function
process_integer_and_char:
.LFB6:
.cfi_startproc
stp x29, x30, [sp, -48]!
.cfi_... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/016_C_24/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <process_integer_and_char>:
0: a9bd7bfd stp x29, x30, [sp, #-48]!
4: 910003fd mov x29, sp
8: b9001fe0 str w0, [sp, #28]
c: 39... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/016_C_24/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 94000025 bl 620 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/016_C_24/code.program: file format elf64-littleaarch64
Disassembly of section .init:
00000000000006a0 <_init>:
6a0: d503201f nop
6a4: a9bf7bfd stp x29, x30, [sp, #-16]!
6a8: 910003fd mov x29, sp
6ac: 94000042 bl 7b4 <call_weak_f... |
C_25 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Shifts all characters by 5 positions in alphabetical order. Only letters are replaced, and all letters are in uppercase.
β Parameters:
β text (str): The input text to be processed.
β
β Returns:
β str: The tr... | .arch armv8-a
.file "source.c"
.text
.align 2
.global shift_characters
.type shift_characters, %function
shift_characters:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -48]!
.cfi_def_cfa_offset 48
.cfi_offset 29, -48
.cfi_offset 30, -40
mov x29, sp
str x0, [sp, 24]
ldr x0, [sp, 24]
bl strlen
str x0, [sp, 40... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/017_C_25/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <shift_characters>:
0: a9bd7bfd stp x29, x30, [sp, #-48]!
4: 910003fd mov x29, sp
8: f9000fe0 str x0, [sp, #24]
c: f9400fe0 ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/017_C_25/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000498 <_init>:
498: d503201f nop
49c: a9bf7bfd stp x29, x30, [sp, #-16]!
4a0: 910003fd mov x29, sp
4a4: 94000017 bl 500 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/017_C_25/code.program: file format elf64-littleaarch64
Disassembly of section .init:
00000000000005b8 <_init>:
5b8: d503201f nop
5bc: a9bf7bfd stp x29, x30, [sp, #-16]!
5c0: 910003fd mov x29, sp
5c4: 9400002c bl 674 <call_weak_f... |
C_26 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Classify the integer x based on the following method:
If x is a single-digit number, x belongs to its own class.
Otherwise, sum the digits of x, get a new x, and iterate until the class is determined.
Parameters:
- x (c... | .arch armv8-a
.file "source.c"
.text
.align 2
.global classify_integer
.type classify_integer, %function
classify_integer:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -64]!
.cfi_def_cfa_offset 64
.cfi_offset 29, -64
.cfi_offset 30, -56
mov x29, sp
str x19, [sp, 16]
.cfi_offset 19, -48
str x0, [sp, 40]
str ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/018_C_26/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <classify_integer>:
0: a9bc7bfd stp x29, x30, [sp, #-64]!
4: 910003fd mov x29, sp
8: f9000bf3 str x19, [sp, #16]
c: f90017e0 ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/018_C_26/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000498 <_init>:
498: d503201f nop
49c: a9bf7bfd stp x29, x30, [sp, #-16]!
4a0: 910003fd mov x29, sp
4a4: 94000017 bl 500 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/018_C_26/code.program: file format elf64-littleaarch64
Disassembly of section .init:
00000000000005b8 <_init>:
5b8: d503201f nop
5bc: a9bf7bfd stp x29, x30, [sp, #-16]!
5c0: 910003fd mov x29, sp
5c4: 9400002c bl 674 <call_weak_f... |
C_27 | #include <assert.h>
#include <stdio.h>
/*
Transforms the case of a given letter.
Parameters:
- letter (char): The input letter to be transformed.
Returns:
- char: The letter with its case reversed. If the input is lowercase, it returns the uppercase version,
and if the input is uppercase, it returns the lowerca... | .arch armv8-a
.file "source.c"
.text
.align 2
.global transform_letter_case
.type transform_letter_case, %function
transform_letter_case:
.LFB0:
.cfi_startproc
sub sp, sp, #16
.cfi_def_cfa_offset 16
strb w0, [sp, 15]
ldrb w0, [sp, 15]
cmp w0, 64
bls .L2
ldrb w0, [sp, 15]
cmp w0, 90
bhi .L2
ldrb w0, [sp... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/019_C_27/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <transform_letter_case>:
0: d10043ff sub sp, sp, #0x10
4: 39003fe0 strb w0, [sp, #15]
8: 39403fe0 ldrb w0, [sp, #15]
c: 71010... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/019_C_27/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000420 <_init>:
420: d503201f nop
424: a9bf7bfd stp x29, x30, [sp, #-16]!
428: 910003fd mov x29, sp
42c: 94000015 bl 480 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/019_C_27/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_28 | #include <stdio.h>
#include <assert.h>
/*
Display the ASCII information for a given character.
β Parameters:
- character (char): The input character for which ASCII information is to be displayed.
β Returns:
- int: corresponding ASCII code
>>> display_ascii_info('A')
65
*/
int display_ascii_info(char char... | .arch armv8-a
.file "source.c"
.text
.align 2
.global display_ascii_info
.type display_ascii_info, %function
display_ascii_info:
.LFB0:
.cfi_startproc
sub sp, sp, #16
.cfi_def_cfa_offset 16
strb w0, [sp, 15]
ldrb w0, [sp, 15]
add sp, sp, 16
.cfi_def_cfa_offset 0
ret
.cfi_endproc
.LFE0:
.size display_asc... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/020_C_28/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <display_ascii_info>:
0: d10043ff sub sp, sp, #0x10
4: 39003fe0 strb w0, [sp, #15]
8: 39403fe0 ldrb w0, [sp, #15]
c: 910043ff... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/020_C_28/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/020_C_28/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_29 | #include <assert.h> // Used for testing the function with assertions
#include <math.h> // Not needed for this function
#include <stdbool.h> // Not needed for this function
#include <stdio.h> // Needed for input/output functions
#include <string.h> // Not needed for this function
/*
Evaluate the grade for an input integ... | .arch armv8-a
.file "source.c"
.text
.align 2
.global evaluate_integer_grade
.type evaluate_integer_grade, %function
evaluate_integer_grade:
.LFB0:
.cfi_startproc
sub sp, sp, #16
.cfi_def_cfa_offset 16
str w0, [sp, 12]
ldr w0, [sp, 12]
cmp w0, 89
ble .L2
ldr w0, [sp, 12]
cmp w0, 100
bgt .L2
mov w0, 65
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/021_C_29/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <evaluate_integer_grade>:
0: d10043ff sub sp, sp, #0x10
4: b9000fe0 str w0, [sp, #12]
8: b9400fe0 ldr w0, [sp, #12]
c: 710164... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/021_C_29/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000420 <_init>:
420: d503201f nop
424: a9bf7bfd stp x29, x30, [sp, #-16]!
428: 910003fd mov x29, sp
42c: 94000015 bl 480 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/021_C_29/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_3 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Calculate the value of the function for a given input.
Parameters:
- x (int): Input value for the function.
Returns:
- double or string: If x is not in the defined domain, returns "Not define".
Otherwise, return... | .arch armv8-a
.file "source.c"
.text
.section .rodata
.align 3
.LC0:
.string "%.5lf"
.align 3
.LC1:
.string "Not define"
.text
.align 2
.global calculate_function_value
.type calculate_function_value, %function
calculate_function_value:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -32]!
.cfi_def_cfa_offset 3... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/022_C_3/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <calculate_function_value>:
0: a9be7bfd stp x29, x30, [sp, #-32]!
4: 910003fd mov x29, sp
8: b9001fe0 str w0, [sp, #28]
c: b94... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/022_C_3/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000550 <_init>:
550: d503201f nop
554: a9bf7bfd stp x29, x30, [sp, #-16]!
558: 910003fd mov x29, sp
55c: 94000021 bl 5e0 <call_weak_fn>
56... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/022_C_3/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000670 <_init>:
670: d503201f nop
674: a9bf7bfd stp x29, x30, [sp, #-16]!
678: 910003fd mov x29, sp
67c: 9400003e bl 774 <call_weak_fn... |
C_30 | #include <assert.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Checks if a three-character string has exactly two characters that are the same.
β
Args:
s (char array): The three-character string to be checked.
β
Returns:
str: Returns 'Yes' if the input has exactly two equal characters, other... | .arch armv8-a
.file "source.c"
.text
.section .rodata
.align 3
.LC0:
.string "Yes"
.align 3
.LC1:
.string "No"
.text
.align 2
.global check_two_equal_digits
.type check_two_equal_digits, %function
check_two_equal_digits:
.LFB0:
.cfi_startproc
sub sp, sp, #16
.cfi_def_cfa_offset 16
str x0, [sp, 8]
ldr x... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/023_C_30/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <check_two_equal_digits>:
0: d10043ff sub sp, sp, #0x10
4: f90007e0 str x0, [sp, #8]
8: f94007e0 ldr x0, [sp, #8]
c: 39400001... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/023_C_30/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000420 <_init>:
420: d503201f nop
424: a9bf7bfd stp x29, x30, [sp, #-16]!
428: 910003fd mov x29, sp
42c: 94000015 bl 480 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/023_C_30/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_31 | #include <assert.h>
#include <stdio.h>
#include <string.h>
/*
Given a string consisting of lowercase English letters, in each round you can change one of the characters to another character. The question is: what is the minimum number of rounds needed to make the string composed of the same character?
For example:
... | .arch armv8-a
.file "source.c"
.text
.align 2
.global minRoundsToSameChar
.type minRoundsToSameChar, %function
minRoundsToSameChar:
.LFB0:
.cfi_startproc
sub sp, sp, #160
.cfi_def_cfa_offset 160
stp x29, x30, [sp, 144]
.cfi_offset 29, -16
.cfi_offset 30, -8
add x29, sp, 144
str x0, [sp, 8]
adrp x0, :got:... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/024_C_31/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <minRoundsToSameChar>:
0: d10283ff sub sp, sp, #0xa0
4: a9097bfd stp x29, x30, [sp, #144]
8: 910243fd add x29, sp, #0x90
c: f... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/024_C_31/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000520 <_init>:
520: d503201f nop
524: a9bf7bfd stp x29, x30, [sp, #-16]!
528: 910003fd mov x29, sp
52c: 94000019 bl 590 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/024_C_31/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000640 <_init>:
640: d503201f nop
644: a9bf7bfd stp x29, x30, [sp, #-16]!
648: 910003fd mov x29, sp
64c: 9400003a bl 734 <call_weak_f... |
C_32 | #include <assert.h>
#include <stdio.h>
/*
Given a sequence of n events, each occurring with a periodicity of a_i years, the problem is to find the year Y_n when the n-th event occurs, under the condition that the countdown for event i+1 can only commence in the year immediately following the occurrence of event i.
... | .arch armv8-a
.file "source.c"
.text
.align 2
.global apocalypseYear
.type apocalypseYear, %function
apocalypseYear:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str w0, [sp, 12]
str x1, [sp]
str wzr, [sp, 16]
str wzr, [sp, 20]
b .L2
.L3:
ldrsw x0, [sp, 20]
lsl x0, x0, 2
ldr x1, [sp]
a... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/025_C_32/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <apocalypseYear>:
0: d10083ff sub sp, sp, #0x20
4: b9000fe0 str w0, [sp, #12]
8: f90003e1 str x1, [sp]
c: b90013ff str wzr, ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/025_C_32/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/025_C_32/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_33 | #include <stdio.h>
#include <assert.h>
#include <stdbool.h>
/*
This problem introduces a new modulo operation, denoted by the symbol "β". When calculating x β y, if x is not a multiple of y, the result is the remainder of x divided by y. Otherwise, divide x by y repeatedly until x is no longer a multiple of y, denoting... | .arch armv8-a
.file "source.c"
.text
.align 2
.global newModuloFactorial
.type newModuloFactorial, %function
newModuloFactorial:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -16]!
.cfi_def_cfa_offset 16
.cfi_offset 29, -16
.cfi_offset 30, -8
mov x29, sp
.cfi_def_cfa_register 29
sub sp, sp, #80
str x0, [x29, ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/026_C_33/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <newModuloFactorial>:
0: a9bf7bfd stp x29, x30, [sp, #-16]!
4: 910003fd mov x29, sp
8: d10143ff sub sp, sp, #0x50
c: f81c83a0... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/026_C_33/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000520 <_init>:
520: d503201f nop
524: a9bf7bfd stp x29, x30, [sp, #-16]!
528: 910003fd mov x29, sp
52c: 94000019 bl 590 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/026_C_33/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000640 <_init>:
640: d503201f nop
644: a9bf7bfd stp x29, x30, [sp, #-16]!
648: 910003fd mov x29, sp
64c: 9400003a bl 734 <call_weak_f... |
C_34 | #include <stdio.h>
#include <assert.h>
/*
You are given an array a of n integers. You can perform at most one operation where you select three integers i, j, x (1 <= i <= j <= n) and replace all elements from a[i] to a[j] with x, at a cost of (j - i + 1).
Find the minimum cost to make all elements in the array equal.
... | .arch armv8-a
.file "source.c"
.text
.align 2
.global makeEqualAgain
.type makeEqualAgain, %function
makeEqualAgain:
.LFB0:
.cfi_startproc
sub sp, sp, #48
.cfi_def_cfa_offset 48
str w0, [sp, 12]
str x1, [sp]
mov w0, 1
str w0, [sp, 28]
str wzr, [sp, 32]
ldr w0, [sp, 12]
str w0, [sp, 44]
mov w0, 1
str w... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/027_C_34/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <makeEqualAgain>:
0: d100c3ff sub sp, sp, #0x30
4: b9000fe0 str w0, [sp, #12]
8: f90003e1 str x1, [sp]
c: 52800020 mov w0, #... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/027_C_34/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/027_C_34/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_35 | #include <assert.h>
#include <stdio.h>
/*
Given a sequence of N piles of stones numbered from 1 to N, with each pile containing a positive number of stones, determine the winner of a game played by Charlie and Dan. Charlie goes first, and they take turns moving a positive number of stones from the leftmost non-empty pi... | .arch armv8-a
.file "source.c"
.text
.section .rodata
.align 3
.LC0:
.string "Charlie"
.align 3
.LC1:
.string "Dan"
.text
.align 2
.global gameWinner
.type gameWinner, %function
gameWinner:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str w0, [sp, 12]
str x1, [sp]
ldr x0, [sp]
ldr w0,... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/028_C_35/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <gameWinner>:
0: d10083ff sub sp, sp, #0x20
4: b9000fe0 str w0, [sp, #12]
8: f90003e1 str x1, [sp]
c: f94003e0 ldr x0, [sp]
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/028_C_35/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000410 <_init>:
410: d503201f nop
414: a9bf7bfd stp x29, x30, [sp, #-16]!
418: 910003fd mov x29, sp
41c: 94000015 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/028_C_35/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_36 | #include <assert.h>
#include <stdio.h>
/*
Given n doors arranged in a circle, the player starts in front of door 1. Each turn, the player can choose a number i and pay a cost C_i to move i steps to the right and then open the door at that position. It is guaranteed that C_i >= C_{i+1} for 1 <= i < n.
The task is to det... | .arch armv8-a
.file "source.c"
.text
.align 2
.global minTotalCost
.type minTotalCost, %function
minTotalCost:
.LFB0:
.cfi_startproc
sub sp, sp, #16
.cfi_def_cfa_offset 16
str w0, [sp, 12]
str x1, [sp]
ldrsw x0, [sp, 12]
lsl x0, x0, 2
sub x0, x0, #8
ldr x1, [sp]
add x0, x1, x0
ldr w0, [x0]
sxtw x1, w0... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/029_C_36/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <minTotalCost>:
0: d10043ff sub sp, sp, #0x10
4: b9000fe0 str w0, [sp, #12]
8: f90003e1 str x1, [sp]
c: b9800fe0 ldrsw x0, [... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/029_C_36/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/029_C_36/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_37 | #include <assert.h>
#include <stdio.h>
/*
Given a sequence of student IDs entering a classroom, where the IDs range from 0 to N-1, calculate the total number of handshakes that occur. Each student will shake hands with every student already in the classroom with a smaller ID number. The sequence represents the order in... | .arch armv8-a
.file "source.c"
.text
.align 2
.global countHandshakes
.type countHandshakes, %function
countHandshakes:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -16]!
.cfi_def_cfa_offset 16
.cfi_offset 29, -16
.cfi_offset 30, -8
mov x29, sp
mov x13, 40064
sub sp, sp, x13
.cfi_def_cfa_offset 40080
str xz... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/030_C_37/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <countHandshakes>:
0: a9bf7bfd stp x29, x30, [sp, #-16]!
4: 910003fd mov x29, sp
8: d293900d mov x13, #0x9c80 //... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/030_C_37/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000550 <_init>:
550: d503201f nop
554: a9bf7bfd stp x29, x30, [sp, #-16]!
558: 910003fd mov x29, sp
55c: 9400001d bl 5d0 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/030_C_37/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000678 <_init>:
678: d503201f nop
67c: a9bf7bfd stp x29, x30, [sp, #-16]!
680: 910003fd mov x29, sp
684: 9400003c bl 774 <call_weak_f... |
C_38 | #include <assert.h>
#include <stdio.h>
/*
Given n positive integers representing the count of each number from 1 to n,
find the maximum sum of the mode (most frequent element) for all prefixes of
a sequence constructed from these numbers. The mode is the largest number among
the most frequent elements in a sequence.... | .arch armv8-a
.file "source.c"
.text
.align 2
.global maxModeSum
.type maxModeSum, %function
maxModeSum:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -16]!
.cfi_def_cfa_offset 16
.cfi_offset 29, -16
.cfi_offset 30, -8
mov x29, sp
sub x13, sp, #786432
.cfi_def_cfa 13, 786432
.LPSRL0:
sub sp, sp, 65536
str xz... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/031_C_38/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <maxModeSum>:
0: a9bf7bfd stp x29, x30, [sp, #-16]!
4: 910003fd mov x29, sp
8: d14303ed sub x13, sp, #0xc0, lsl #12
c: d14043... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/031_C_38/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000518 <_init>:
518: d503201f nop
51c: a9bf7bfd stp x29, x30, [sp, #-16]!
520: 910003fd mov x29, sp
524: 94000017 bl 580 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/031_C_38/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000640 <_init>:
640: d503201f nop
644: a9bf7bfd stp x29, x30, [sp, #-16]!
648: 910003fd mov x29, sp
64c: 9400003a bl 734 <call_weak_f... |
C_39 | #include <assert.h>
#include <stdio.h>
/*
Given an array A of integers, the task is to calculate the sum of the XOR of all subarrays.
A subarray is defined by a pair of indices (L, R) such that 1 <= L <= R <= n, where n is the size of the array.
The XOR sum of a subarray is the result of XORing all elements from L to R... | .arch armv8-a
.file "source.c"
.text
.align 2
.global sumOfXorSubarrays
.type sumOfXorSubarrays, %function
sumOfXorSubarrays:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -16]!
.cfi_def_cfa_offset 16
.cfi_offset 29, -16
.cfi_offset 30, -8
mov x29, sp
sub x13, sp, #2359296
.cfi_def_cfa 13, 2359296
.LPSRL0:
su... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/032_C_39/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <sumOfXorSubarrays>:
0: a9bf7bfd stp x29, x30, [sp, #-16]!
4: 910003fd mov x29, sp
8: d14903ed sub x13, sp, #0x240, lsl #12
c... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/032_C_39/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000558 <_init>:
558: d503201f nop
55c: a9bf7bfd stp x29, x30, [sp, #-16]!
560: 910003fd mov x29, sp
564: 9400001b bl 5d0 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/032_C_39/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000678 <_init>:
678: d503201f nop
67c: a9bf7bfd stp x29, x30, [sp, #-16]!
680: 910003fd mov x29, sp
684: 9400003c bl 774 <call_weak_f... |
C_4 | #include <assert.h>
#include <stdio.h>
/*
Find the maximum and minimum of three distinct integers.
Parameters:
a (int): The first integer.
b (int): The second integer.
c (int): The third integer.
Returns:
Tuple[int, int]: A tuple is not a concept in C; instead, we will return by reference.
>>> Example call:
int max,... | .arch armv8-a
.file "source.c"
.text
.align 2
.global find_max_min
.type find_max_min, %function
find_max_min:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str w0, [sp, 28]
str w1, [sp, 24]
str w2, [sp, 20]
str x3, [sp, 8]
str x4, [sp]
ldr w1, [sp, 28]
ldr w0, [sp, 24]
cmp w1, w0
ble .... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/033_C_4/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <find_max_min>:
0: d10083ff sub sp, sp, #0x20
4: b9001fe0 str w0, [sp, #28]
8: b9001be1 str w1, [sp, #24]
c: b90017e2 str w2,... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/033_C_4/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
42... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/033_C_4/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_fn... |
C_40 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
/*
Given two positive integers n and k, find the number of positive integers x, where 1 <= x <= n, that can be expressed as x = a^b with a and b being positive integers and b >= k.
Different legal representations of the sa... | .arch armv8-a
.file "source.c"
.text
.align 2
.global countPowerNumbers
.type countPowerNumbers, %function
countPowerNumbers:
.LFB6:
.cfi_startproc
stp x29, x30, [sp, -80]!
.cfi_def_cfa_offset 80
.cfi_offset 29, -80
.cfi_offset 30, -72
mov x29, sp
str x19, [sp, 16]
str d8, [sp, 24]
.cfi_offset 19, -64
.... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/034_C_40/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <countPowerNumbers>:
0: a9bb7bfd stp x29, x30, [sp, #-80]!
4: 910003fd mov x29, sp
8: f9000bf3 str x19, [sp, #16]
c: fd000fe8... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/034_C_40/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000568 <_init>:
568: d503201f nop
56c: a9bf7bfd stp x29, x30, [sp, #-16]!
570: 910003fd mov x29, sp
574: 94000023 bl 600 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/034_C_40/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000688 <_init>:
688: d503201f nop
68c: a9bf7bfd stp x29, x30, [sp, #-16]!
690: 910003fd mov x29, sp
694: 94000038 bl 774 <call_weak_f... |
C_41 | #include <stdio.h>
#include <assert.h>
/*
Given three integers n, m, and k, find the number of sequences consisting of n '(' and m ')', such that the longest balanced subsequence is of length 2 * k. The result should be calculated modulo 1,000,000,007 (10^9 + 7).
For example:
>>> countBalancedSubsequences(2, 2, 2)... | .arch armv8-a
.file "source.c"
.text
.align 2
.global countBalancedSubsequences
.type countBalancedSubsequences, %function
countBalancedSubsequences:
.LFB0:
.cfi_startproc
sub sp, sp, #64
.cfi_def_cfa_offset 64
str x0, [sp, 24]
str x1, [sp, 16]
str x2, [sp, 8]
mov x0, 51719
movk x0, 0x3b9a, lsl 16
str x0... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/035_C_41/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <countBalancedSubsequences>:
0: d10103ff sub sp, sp, #0x40
4: f9000fe0 str x0, [sp, #24]
8: f9000be1 str x1, [sp, #16]
c: f90... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/035_C_41/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000420 <_init>:
420: d503201f nop
424: a9bf7bfd stp x29, x30, [sp, #-16]!
428: 910003fd mov x29, sp
42c: 94000015 bl 480 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/035_C_41/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_42 | #include <stdio.h>
#include <assert.h>
/*
Given a rectangle paper of size n x m placed on a plane Cartesian coordinate system with its bottom-left corner at (0,0) and top-right corner at (n,m),
you need to calculate the expected number of operations to cut the paper such that the remaining area is less than k.
In eac... | .arch armv8-a
.file "source.c"
.text
.align 2
.global expectedCuts
.type expectedCuts, %function
expectedCuts:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -16]!
.cfi_def_cfa_offset 16
.cfi_offset 29, -16
.cfi_offset 30, -8
mov x29, sp
.cfi_def_cfa_register 29
sub sp, sp, #80
str w0, [x29, -52]
str w1, [x29... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/036_C_42/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <expectedCuts>:
0: a9bf7bfd stp x29, x30, [sp, #-16]!
4: 910003fd mov x29, sp
8: d10143ff sub sp, sp, #0x50
c: b81cc3a0 stur... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/036_C_42/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000518 <_init>:
518: d503201f nop
51c: a9bf7bfd stp x29, x30, [sp, #-16]!
520: 910003fd mov x29, sp
524: 94000017 bl 580 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/036_C_42/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000640 <_init>:
640: d503201f nop
644: a9bf7bfd stp x29, x30, [sp, #-16]!
648: 910003fd mov x29, sp
64c: 9400003a bl 734 <call_weak_f... |
C_43 | #include <stdio.h>
#include <assert.h>
#include <string.h>
/*
Given a permutation q of n elements and an integer k, find the number of permutations p of n elements such that f(p) = q, where f(p) is the lexicographically smallest permutation that can be obtained by dividing p into exactly k non-empty contiguous segments... | .arch armv8-a
.file "source.c"
.text
.align 2
.global countPermutations
.type countPermutations, %function
countPermutations:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -96]!
.cfi_def_cfa_offset 96
.cfi_offset 29, -96
.cfi_offset 30, -88
mov x29, sp
.cfi_def_cfa_register 29
stp x19, x20, [sp, 16]
stp x21, ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/037_C_43/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <countPermutations>:
0: a9ba7bfd stp x29, x30, [sp, #-96]!
4: 910003fd mov x29, sp
8: a90153f3 stp x19, x20, [sp, #16]
c: a90... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/037_C_43/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000558 <_init>:
558: d503201f nop
55c: a9bf7bfd stp x29, x30, [sp, #-16]!
560: 910003fd mov x29, sp
564: 9400001b bl 5d0 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/037_C_43/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000678 <_init>:
678: d503201f nop
67c: a9bf7bfd stp x29, x30, [sp, #-16]!
680: 910003fd mov x29, sp
684: 9400003c bl 774 <call_weak_f... |
C_44 | #include <stdio.h>
#include <assert.h>
#include <stdbool.h>
/*
Given an array of n distinct integers representing the heights of Kira's friends,
find the number of ways to choose a triplet (a, b, c) such that the greatest common divisor (GCD)
of the maximum and minimum values of the triplet is 1.
>>> countTriplet... | .arch armv8-a
.file "source.c"
.text
.align 2
.global countTriplets
.type countTriplets, %function
countTriplets:
.LFB0:
.cfi_startproc
sub sp, sp, #64
.cfi_def_cfa_offset 64
str x0, [sp, 8]
str w1, [sp, 4]
str wzr, [sp, 28]
str wzr, [sp, 32]
b .L2
.L14:
ldr w0, [sp, 32]
add w0, w0, 1
str w0, [sp, 36]
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/038_C_44/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <countTriplets>:
0: d10103ff sub sp, sp, #0x40
4: f90007e0 str x0, [sp, #8]
8: b90007e1 str w1, [sp, #4]
c: b9001fff str wzr... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/038_C_44/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/038_C_44/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_45 | #include <stdio.h>
#include <assert.h>
/*
You are given a 1 by n pixel image, where each pixel has a color represented by an integer. You can perform an operation where you pick a color and change all connected pixels of the same color to the chosen color. Two pixels are connected if they are adjacent and have the same... | .arch armv8-a
.file "source.c"
.text
.align 2
.global minOperations
.type minOperations, %function
minOperations:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -96]!
.cfi_def_cfa_offset 96
.cfi_offset 29, -96
.cfi_offset 30, -88
mov x29, sp
.cfi_def_cfa_register 29
stp x19, x20, [sp, 16]
stp x21, x22, [sp, 32... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/039_C_45/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <minOperations>:
0: a9ba7bfd stp x29, x30, [sp, #-96]!
4: 910003fd mov x29, sp
8: a90153f3 stp x19, x20, [sp, #16]
c: a9025bf... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/039_C_45/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000518 <_init>:
518: d503201f nop
51c: a9bf7bfd stp x29, x30, [sp, #-16]!
520: 910003fd mov x29, sp
524: 94000017 bl 580 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/039_C_45/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000640 <_init>:
640: d503201f nop
644: a9bf7bfd stp x29, x30, [sp, #-16]!
648: 910003fd mov x29, sp
64c: 9400003a bl 734 <call_weak_f... |
C_46 | #include <assert.h>
#include <stdio.h>
/*
Given an integer n, write a function to compute the sum of all numbers from 1 to n that are multiples of either 3 or 5. If a number is a multiple of both 3 and 5, it should only be counted once.
For example:
>>> sumOfMultiples(10)
33 // (3 + 5 + 6 + 9 + 10)
*/
int sumOf... | .arch armv8-a
.file "source.c"
.text
.align 2
.global sumOfMultiples
.type sumOfMultiples, %function
sumOfMultiples:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str w0, [sp, 12]
str wzr, [sp, 24]
mov w0, 1
str w0, [sp, 28]
b .L2
.L5:
ldr w2, [sp, 28]
mov w0, 21846
movk w0, 0x5555, lsl ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/040_C_46/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <sumOfMultiples>:
0: d10083ff sub sp, sp, #0x20
4: b9000fe0 str w0, [sp, #12]
8: b9001bff str wzr, [sp, #24]
c: 52800020 mov... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/040_C_46/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/040_C_46/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_47 | #include <assert.h>
#include <ctype.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Determine if a given string is a palindrome. A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward (ignoring spaces, punctuation, and capitalization).
>>> ... | .arch armv8-a
.file "source.c"
.text
.align 2
.global isPalindrome
.type isPalindrome, %function
isPalindrome:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -64]!
.cfi_def_cfa_offset 64
.cfi_offset 29, -64
.cfi_offset 30, -56
mov x29, sp
str x19, [sp, 16]
.cfi_offset 19, -48
str x0, [sp, 40]
str wzr, [sp, 56... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/041_C_47/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <isPalindrome>:
0: a9bc7bfd stp x29, x30, [sp, #-64]!
4: 910003fd mov x29, sp
8: f9000bf3 str x19, [sp, #16]
c: f90017e0 str... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/041_C_47/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000510 <_init>:
510: d503201f nop
514: a9bf7bfd stp x29, x30, [sp, #-16]!
518: 910003fd mov x29, sp
51c: 94000021 bl 5a0 <call_weak_fn>
5... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/041_C_47/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000638 <_init>:
638: d503201f nop
63c: a9bf7bfd stp x29, x30, [sp, #-16]!
640: 910003fd mov x29, sp
644: 9400003c bl 734 <call_weak_f... |
C_48 | #include <assert.h>
#include <stdio.h>
/*
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
For example:
>>> addDigits(38)
2
Because 3 + 8 = 11, and 1 + 1 = 2. Since 2 has only one digit, 2 is the result.
*/
int addDigits(int num){
while (num >= 10) {
... | .arch armv8-a
.file "source.c"
.text
.align 2
.global addDigits
.type addDigits, %function
addDigits:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str w0, [sp, 12]
b .L2
.L5:
str wzr, [sp, 28]
b .L3
.L4:
ldr w2, [sp, 12]
mov w0, 26215
movk w0, 0x6666, lsl 16
smull x0, w2, w0
lsr x0, x0... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/042_C_48/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <addDigits>:
0: d10083ff sub sp, sp, #0x20
4: b9000fe0 str w0, [sp, #12]
8: 14000021 b 8c <addDigits+0x8c>
c: b9001fff str w... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/042_C_48/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000410 <_init>:
410: d503201f nop
414: a9bf7bfd stp x29, x30, [sp, #-16]!
418: 910003fd mov x29, sp
41c: 94000015 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/042_C_48/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_49 | #include <assert.h>
#include <stdbool.h>
#include <stdio.h>
/*
You are playing a game called Nim. In this game, you start with a pile of n stones, and you and your opponent take turns to remove 1 to 3 stones from the pile. The one who removes the last stone wins the game. Given the number of stones n, determine if you ... | .arch armv8-a
.file "source.c"
.text
.align 2
.global canWinNim
.type canWinNim, %function
canWinNim:
.LFB0:
.cfi_startproc
sub sp, sp, #16
.cfi_def_cfa_offset 16
str w0, [sp, 12]
ldr w0, [sp, 12]
and w0, w0, 3
cmp w0, 0
cset w0, ne
and w0, w0, 255
add sp, sp, 16
.cfi_def_cfa_offset 0
ret
.cfi_endpro... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/043_C_49/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <canWinNim>:
0: d10043ff sub sp, sp, #0x10
4: b9000fe0 str w0, [sp, #12]
8: b9400fe0 ldr w0, [sp, #12]
c: 12000400 and w0, w... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/043_C_49/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000410 <_init>:
410: d503201f nop
414: a9bf7bfd stp x29, x30, [sp, #-16]!
418: 910003fd mov x29, sp
41c: 94000015 bl 470 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/043_C_49/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_5 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Calculate the distance between two points A (xa, ya) and B (xb, yb).
Parameters:
- xa (double): x-coordinate of point A.
- ya (double): y-coordinate of point A.
- xb (double): x-coordinate of point B.
- yb (double):... | .arch armv8-a
.file "source.c"
.text
.align 2
.global calculate_distance
.type calculate_distance, %function
calculate_distance:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -48]!
.cfi_def_cfa_offset 48
.cfi_offset 29, -48
.cfi_offset 30, -40
mov x29, sp
str d0, [sp, 40]
str d1, [sp, 32]
str d2, [sp, 24]
st... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/044_C_5/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <calculate_distance>:
0: a9bd7bfd stp x29, x30, [sp, #-48]!
4: 910003fd mov x29, sp
8: fd0017e0 str d0, [sp, #40]
c: fd0013e1 ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/044_C_5/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000498 <_init>:
498: d503201f nop
49c: a9bf7bfd stp x29, x30, [sp, #-16]!
4a0: 910003fd mov x29, sp
4a4: 94000017 bl 500 <call_weak_fn>
4a... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/044_C_5/code.program: file format elf64-littleaarch64
Disassembly of section .init:
00000000000005e0 <_init>:
5e0: d503201f nop
5e4: a9bf7bfd stp x29, x30, [sp, #-16]!
5e8: 910003fd mov x29, sp
5ec: 94000032 bl 6b4 <call_weak_fn... |
C_50 | #include <assert.h>
#include <stdio.h>
/*
Given two integers a and b, return the sum if the sum is even, or return the product of a and b if the sum is odd.
>>> evenSumOrOddProduct(2, 3)
6
>>> evenSumOrOddProduct(5, 5)
10
*/
int evenSumOrOddProduct(int a, int b);int evenSumOrOddProduct(int a, int b) {
... | .arch armv8-a
.file "source.c"
.text
.align 2
.global evenSumOrOddProduct
.type evenSumOrOddProduct, %function
evenSumOrOddProduct:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str w0, [sp, 12]
str w1, [sp, 8]
ldr w1, [sp, 12]
ldr w0, [sp, 8]
add w0, w1, w0
str w0, [sp, 28]
ldr w0, [sp, ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/045_C_50/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <evenSumOrOddProduct>:
0: d10083ff sub sp, sp, #0x20
4: b9000fe0 str w0, [sp, #12]
8: b9000be1 str w1, [sp, #8]
c: b9400fe1 ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/045_C_50/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000420 <_init>:
420: d503201f nop
424: a9bf7bfd stp x29, x30, [sp, #-16]!
428: 910003fd mov x29, sp
42c: 94000015 bl 480 <call_weak_fn>
4... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/045_C_50/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_f... |
C_6 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Find the factorial of N and take the modulo 10007 of the result.
β Parameters:
- N (int): An integer representing the input value (N <= 10000).
β Returns:
β int: The result after taking the modulo 10007 of the ... | .arch armv8-a
.file "source.c"
.text
.align 2
.global process_request
.type process_request, %function
process_request:
.LFB0:
.cfi_startproc
stp x29, x30, [sp, -32]!
.cfi_def_cfa_offset 32
.cfi_offset 29, -32
.cfi_offset 30, -24
mov x29, sp
str x19, [sp, 16]
mov x13, 40064
sub sp, sp, x13
.cfi_def_cfa_... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/046_C_6/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <process_request>:
0: a9be7bfd stp x29, x30, [sp, #-32]!
4: 910003fd mov x29, sp
8: f9000bf3 str x19, [sp, #16]
c: d293900d m... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/046_C_6/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000518 <_init>:
518: d503201f nop
51c: a9bf7bfd stp x29, x30, [sp, #-16]!
520: 910003fd mov x29, sp
524: 94000017 bl 580 <call_weak_fn>
52... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/046_C_6/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000640 <_init>:
640: d503201f nop
644: a9bf7bfd stp x29, x30, [sp, #-16]!
648: 910003fd mov x29, sp
64c: 9400003a bl 734 <call_weak_fn... |
C_7 | #include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
/*
Calculate the area of a triangle given its base and height.
β Parameters:
- base (int): The base length of the triangle.
- height (int): The height of the triangle.
β Returns:
β float: The calculated area of th... | .arch armv8-a
.file "source.c"
.text
.align 2
.global calculate_triangle_area
.type calculate_triangle_area, %function
calculate_triangle_area:
.LFB0:
.cfi_startproc
sub sp, sp, #16
.cfi_def_cfa_offset 16
str w0, [sp, 12]
str w1, [sp, 8]
ldr w1, [sp, 12]
ldr w0, [sp, 8]
mul w0, w1, w0
scvtf d1, w0
fmov ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/047_C_7/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <calculate_triangle_area>:
0: d10043ff sub sp, sp, #0x10
4: b9000fe0 str w0, [sp, #12]
8: b9000be1 str w1, [sp, #8]
c: b9400fe... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/047_C_7/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000420 <_init>:
420: d503201f nop
424: a9bf7bfd stp x29, x30, [sp, #-16]!
428: 910003fd mov x29, sp
42c: 94000015 bl 480 <call_weak_fn>
43... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/047_C_7/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_fn... |
C_8 | #include <assert.h>
#include <stdio.h>
/*
Calculate the Hamming distance between two integers in binary representation.
β Parameters:
- x (int): The first positive integer (x <= 1,000,000,000).
- y (int): The second positive integer (y <= 1,000,000,000).
β Returns:
β int: The Hamming distance between x and y, ... | .arch armv8-a
.file "source.c"
.text
.align 2
.global hamming_distance
.type hamming_distance, %function
hamming_distance:
.LFB0:
.cfi_startproc
sub sp, sp, #32
.cfi_def_cfa_offset 32
str w0, [sp, 12]
str w1, [sp, 8]
str wzr, [sp, 24]
ldr w1, [sp, 12]
ldr w0, [sp, 8]
eor w0, w1, w0
str w0, [sp, 28]
b .... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/048_C_8/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <hamming_distance>:
0: d10083ff sub sp, sp, #0x20
4: b9000fe0 str w0, [sp, #12]
8: b9000be1 str w1, [sp, #8]
c: b9001bff str ... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/048_C_8/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000418 <_init>:
418: d503201f nop
41c: a9bf7bfd stp x29, x30, [sp, #-16]!
420: 910003fd mov x29, sp
424: 94000013 bl 470 <call_weak_fn>
42... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/048_C_8/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000580 <_init>:
580: d503201f nop
584: a9bf7bfd stp x29, x30, [sp, #-16]!
588: 910003fd mov x29, sp
58c: 9400002a bl 634 <call_weak_fn... |
C_9 | #include <assert.h>
#include <stdarg.h>
/*
Count the number of odd integers in a given list of numbers.
Parameters:
- count (int): The count of numbers to evaluate.
- ... (int): A sequence of integers.
Returns:
int: The count of odd numbers in the input list.
>>> count_odd_numbers(5, 1, 4, 3, 2, 5)
... | .arch armv8-a
.file "source.c"
.text
.align 2
.global count_odd_numbers
.type count_odd_numbers, %function
count_odd_numbers:
.LFB0:
.cfi_startproc
sub sp, sp, #288
.cfi_def_cfa_offset 288
stp x29, x30, [sp, 80]
.cfi_offset 29, -208
.cfi_offset 30, -200
add x29, sp, 80
str w0, [sp, 12]
str x1, [sp, 232]
... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/049_C_9/code.o: file format elf64-littleaarch64
Disassembly of section .text:
0000000000000000 <count_odd_numbers>:
0: d10483ff sub sp, sp, #0x120
4: a9057bfd stp x29, x30, [sp, #80]
8: 910143fd add x29, sp, #0x50
c: b900... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/049_C_9/code.so: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000520 <_init>:
520: d503201f nop
524: a9bf7bfd stp x29, x30, [sp, #-16]!
528: 910003fd mov x29, sp
52c: 94000019 bl 590 <call_weak_fn>
53... |
/home/alexanderpretko/CodeGeneration/MCEval/generated_mceval_arm64_linux/O0/049_C_9/code.program: file format elf64-littleaarch64
Disassembly of section .init:
0000000000000640 <_init>:
640: d503201f nop
644: a9bf7bfd stp x29, x30, [sp, #-16]!
648: 910003fd mov x29, sp
64c: 9400003a bl 734 <call_weak_fn... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.