This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
#include <string.h> | |
#include <math.h> | |
typedef struct { | |
size_t width; | |
size_t height; | |
unsigned char *data; | |
} Image; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
int main (int ac, char* av[]) | |
{ | |
int number = atoi(av[1]); | |
//number = 5; | |
int i=0,j=0; | |
int direction=0; | |
/* |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
/* | |
You can define the size of Queens | |
*/ | |
#define QUEEN 8 | |
int row[QUEEN+1]; | |
int l[2*QUEEN]; | |
int r[2*QUEEN]; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(defun split-nums (n) | |
(if (>= n 0) | |
(if (= n 0) | |
'((0) NIL) | |
(if (oddp n) | |
(map 'list #'append `(NIL (,n)) (split-nums (- n 1))) | |
(map 'list #'append `((,n) NIL) (split-nums (- n 1))))))) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import ( | |
"crypto/tls" | |
"flag" | |
"io" | |
"log" | |
"net" | |
"net/http" | |
"time" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(defun collatz-conjecture (n) | |
(progn | |
(print n) | |
(cond | |
((= n 1) n) | |
((= (mod n 2) 0) (collatz-conjecture (/ n 2))) | |
((= (mod n 2) 1) (collatz-conjecture (+ 1 (* n 3))))))) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// these aren't _quite_ functional tests, | |
// and should all be compile_fail, | |
// but may be illustrative | |
#[test] | |
fn concurrent_set() { | |
use std::sync::Arc; | |
let x = Arc::new(Cell::new(42)); | |
let x1 = Arc::clone(&x); | |
std::thread::spawn(move || { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(defun fib3 (n) | |
(cond ((= n 1) 1) | |
((= n 2) 2) | |
((= n 3) 4) | |
(t (+ (fib3 (- n 1)) | |
(fib3 (- n 2)) | |
(fib3 (- n 3)))))) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def qsort(arr): | |
if len(arr) <= 1: | |
return arr | |
else: | |
# construct array with [(values bigger than pivot), pivot, (values smaller than pivot)] | |
return qsort([x for x in arr[1:] if x > arr[0]]) + \ | |
[arr[0]] + \ | |
qsort([x for x in arr[1:] if x <= arr[0]]) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def perm(string): | |
if len(string) <= 1: | |
return [string] | |
return [i+j for idx,i in enumerate(string) | |
for j in perm(string[0:idx] + string[idx+1:])] | |
if __name__ == "__main__": | |
TCs = [ | |
("a", ["a"]), | |
("ao", ["ao", "oa"]) |