skalahonza

//TASK: https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=chocolate

#include <iostream>
#include <vector>

using namespace std;
#ifdef WIN32

int getchar_unlocked() { return getchar(); }

skalahonza

//TASK: https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=cinemas

#include <iostream>
#include <cstdio>
#include <vector>

#define arr std::vector

using namespace std;
#define min(a, b) ((a)<(b)?(a):(b))

skalahonza

//TASK: https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=keyservers

#include <vector>
#include <cstdio>
#include <stack>
#include <cstdlib>

#ifdef WIN32

int getchar_unlocked() { return getchar(); }

skalahonza

// TASK: https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=videocard

#include <vector>
#include <cstdio>
#include <queue>
#include <algorithm>

using namespace std;

#if defined(WIN32) && !defined(UNIX)

skalahonza

-- board type definition for game board
type Board = [Int]
initBoard :: Board
initBoard = [5,4,3,2,1]

-- player tpye definition
data Player = P1 | P2 deriving Show
nextP :: Player -> Player 
nextP P1 = P2
nextP P2 = P1

skalahonza

; list of actions
; - n počet disků

; move tower to c
; last stage to 2

(define (hanoi n a b c)
  (cond
    ((eq? n 1) (list(cons a b))) ; jedno patro dám rovnou na b
    (#t (append (hanoi (- n 1) a c b) (list(cons a b))

skalahonza

(define first car)
(define second cadr)
(define rest cdr)
(define (third list) (car (cddr list)))
(define fourth cadddr)

(define initmap '())

(define test
  (list (list 'a 1) (list 'b 3))

skalahonza

type KeyVal a b = (a, b)
type Map a b = [KeyVal a b]

test = initmap ["a","b","c"] [1,2,3]

myZip (k:ks) (v:vs) = [(k,v)] ++ myZip ks vs
myZip [] [] = []

get_key (a, b) = a
get_val (a, b) = b

skalahonza

(define first car)
(define second cadr)
(define rest cdr)
(define (third list) (car (cddr list)))
(define fourth cadddr)



(define (push v st)
 (cons v st))

skalahonza

module QueueStacks where

type Stack v = [v]

push :: v -> Stack v -> Stack v
push value stack = value:stack

pop :: Stack v -> Stack v
pop [] = []
pop (_:newStack) = newStack