rebeccajae

import random

def solution(N, L):
  #Given budget of integer N, and a list of items of length S
  #each with their own cost C, return the sub-list that uses
  #the highest value <=N.
  res = (0, 0, 0)
  for idx, item in enumerate(L):
    i = 0
    l = 0

rebeccajae

Keybase proof

I hereby claim:

• I am rebeccajae on github.
• I am rebeccajae (https://keybase.io/rebeccajae) on keybase.
• I have a public key ASADKqSwYD57WMewaRqh43Eh2lVEmZLM5s8oFEAMfmJptgo

To claim this, I am signing this object:

rebeccajae

function p = rootPitch(key, note)
    notes = {'c', 'cs', 'd', 'ef', 'e', 'f', 'fs','g','gs','a','bf', 'b'};
    I = find(strcmp(notes, note));
    I = I-1;
    shift = 12*key;
    idx = shift + I;
    a = 2^(1/12);
    f0 = 16.35;
    p = f0*a^idx;
end

rebeccajae

global start

section .text
bits 32

string_start:
	dw 0x2f33, 0x2f32, 0x2f4f, 0x2f4b, 0x0
  
start:
    mov esp, stack_top

rebeccajae

#include <pthread.h>
#include <stdio.h>

#define NTHREADS 10

void *sum_runner(void *param);

int sum;

int main(int arc, char *argv[])

rebeccajae

#include <stdio.h>
#include <sys/types.h>
#include <unistd.h>

int main()
{
    int n = 8; //35
    pid_t pid;

    pid = fork();