id int64 0 14.1k | problem_id int64 1 1.31k | problem_title stringclasses 441
values | difficulty stringclasses 3
values | c_source stringclasses 441
values | architecture stringclasses 4
values | optimization stringclasses 4
values | compiler stringclasses 8
values | assembly stringlengths 31 174k |
|---|---|---|---|---|---|---|---|---|
14,100 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | riscv64 | -O0 | RISC-V 64 gcc 15.2.0 | min:
addi sp,sp,-32
sd ra,24(sp)
sd s0,16(sp)
addi s0,sp,32
mv a5,a0
mv a4,a1
sw a5,-20(s0)
mv a5,a4
sw a5,-24(s0)
lw a5,-20(s0)
mv a2,a5
lw a5,-24(s0)
mv ... |
14,101 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | riscv64 | -O1 | RISC-V 64 gcc 15.2.0 | minInsertions:
addi sp,sp,-48
sd ra,40(sp)
sd s0,32(sp)
sd s1,24(sp)
sd s2,16(sp)
sd s3,8(sp)
sd s4,0(sp)
mv s4,a0
call strlen
mv s3,a0
sext.w s0,a0
slli s2,s0,2
mv ... |
14,102 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | riscv64 | -O2 | RISC-V 64 gcc 15.2.0 | minInsertions:
addi sp,sp,-48
sd ra,40(sp)
sd s0,32(sp)
sd s1,24(sp)
sd s2,16(sp)
sd s3,8(sp)
mv s3,a0
call strlen
sext.w s0,a0
slli s2,s0,2
mv s1,a0
li a1,1
mv ... |
14,103 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | riscv64 | -O3 | RISC-V 64 gcc 15.2.0 | minInsertions:
addi sp,sp,-48
sd ra,40(sp)
sd s0,32(sp)
sd s1,24(sp)
sd s2,16(sp)
sd s3,8(sp)
mv s3,a0
call strlen
sext.w s0,a0
slli s2,s0,2
mv s1,a0
li a1,1
mv ... |
14,104 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | x86-64 | -O0 | x86-64 clang 21.1.0 | minInsertions:
push rbp
mov rbp, rsp
sub rsp, 48
mov qword ptr [rbp - 8], rdi
mov rdi, qword ptr [rbp - 8]
call strlen@PLT
mov dword ptr [rbp - 20], eax
movsxd rdi, dword ptr [rbp - 20]
shl rdi, 2
call mall... |
14,105 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | x86-64 | -O1 | x86-64 clang 21.1.0 | minInsertions:
push r15
push r14
push r13
push r12
push rbx
mov rbx, rdi
call strlen@PLT
mov r14, rax
mov r13, rax
shl r13, 32
mov r12, r13
sar r12, 30
mov rdi, r12
... |
14,106 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | x86-64 | -O2 | x86-64 clang 21.1.0 | minInsertions:
push r15
push r14
push r12
push rbx
push rax
mov rbx, rdi
call strlen@PLT
mov r14, rax
mov r15, rax
shl r15, 32
mov rsi, r15
sar rsi, 30
mov edi, 1
... |
14,107 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | x86-64 | -O3 | x86-64 clang 21.1.0 | minInsertions:
push r15
push r14
push r12
push rbx
push rax
mov rbx, rdi
call strlen@PLT
mov r14, rax
mov r15, rax
shl r15, 32
mov rsi, r15
sar rsi, 30
mov edi, 1
... |
14,108 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | x86-64 | -O0 | x86-64 gcc 15.2 | min:
push rbp
mov rbp, rsp
mov DWORD PTR [rbp-4], edi
mov DWORD PTR [rbp-8], esi
mov edx, DWORD PTR [rbp-8]
mov eax, DWORD PTR [rbp-4]
cmp edx, eax
cmovle eax, edx
pop rbp
ret
minInsertions:
push r... |
14,109 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | x86-64 | -O1 | x86-64 gcc 15.2 | minInsertions:
push r15
push r14
push r13
push r12
push rbp
push rbx
sub rsp, 24
mov rbx, rdi
call strlen
mov r13, rax
mov ebp, eax
movsx r12, eax
lea r14, [0+r12*4]
... |
14,110 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | x86-64 | -O2 | x86-64 gcc 15.2 | minInsertions:
push r15
push r14
push r13
push r12
push rbp
mov rbp, rdi
push rbx
sub rsp, 8
call strlen
mov esi, 1
movsx r12, eax
mov rbx, rax
lea rdi, [0+r12*4]
ca... |
14,111 | 1,312 | Minimum Insertion Steps to Make a String Palindrome | Hard | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int minInsertions(char * s){
int i, j, len = strlen(s);
int *dp = malloc(len * sizeof(int));
memset(dp, 0, len * sizeof(int));
for (i = len - 2; i >= 0; i--) {
int left... | x86-64 | -O3 | x86-64 gcc 15.2 | minInsertions:
push r15
push r14
push r13
push r12
push rbp
mov rbp, rdi
push rbx
sub rsp, 8
call strlen
mov esi, 1
movsx r12, eax
mov rbx, rax
lea rdi, [0+r12*4]
ca... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.