| #include <stdio.h> | |
| #define MAX 20 | |
| #define INF 1000 | |
| typedef struct { | |
| int predecessor; | |
| int distance; | |
| int status; | |
| int neighbours[MAX]; | |
| } Node; |
| from random import * | |
| # Floyd Sampler | |
| def sampler(N, K): | |
| res = set() | |
| for i in range(N - K, N): | |
| j = randint(0, i) | |
| if j not in res: | |
| res.add(j) | |
| else: |
| from random import * | |
| def randTree(N): | |
| edges = [] | |
| comps = [[i] for i in range(N)] | |
| for _ in range(N - 1): | |
| i = randint(0, len(comps) - 1) | |
| j = randint(0, len(comps) - 2) | |
| if j == i: | |
| j += 1 |
Lights Out: https://veerasundar.com/lights-out-online-game/
Run Here: https://ideone.com/a1Go1a
Edit beg variable to set initial state, 1 for lights on and 0 for off.
Program outputs list of (x, y) coordinates you need to press to solve it in optimal moves.
The Algorithm uses Breadth-First-Search by considering state of game as graph node.
| def merge(arr, i, mid, j, extra): | |
| x = i | |
| y = mid | |
| while x < mid and y < j: | |
| if arr[x] <= arr[y]: | |
| extra[x + y - mid] = arr[x] | |
| x += 1 | |
| else: | |
| extra[x + y - mid] = arr[y] | |
| y += 1 |
| 1 two-sum | |
| 2 add-two-numbers | |
| 3 longest-substring-without-repeating-characters | |
| 4 median-of-two-sorted-arrays | |
| 5 longest-palindromic-substring | |
| 6 zigzag-conversion | |
| 7 reverse-integer | |
| 8 string-to-integer-atoi | |
| 9 palindrome-number | |
| 10 regular-expression-matching |
| // opens file dialog waits till user selects file and return dataurl of uploaded file | |
| async function pick() { | |
| var filepicker = document.createElement("input"); | |
| filepicker.setAttribute("type","file"); | |
| filepicker.click(); | |
| return new Promise((resolve,reject) => { | |
| filepicker.addEventListener("change", e => { | |
| var reader = new FileReader(); | |
| reader.addEventListener('load', file => resolve(file.target.result)); |
| import random | |
| from time import sleep | |
| class Human: | |
| def __init__(self): | |
| self.human = [[" ", "o", " "], ["/", "|", "\\"], ["/", " ", "\\"]] | |
| self.front = False | |
| self.commandmap = { | |
| "left hand to head": self.leftHandToHead, | |
| "left hand to hip": self.leftHandToHip, |
| def encode(s): | |
| n = len(s) | |
| res = [] | |
| i = 0 | |
| while i < n: | |
| ctr = 1 | |
| while i < n - 1 and s[i] == s[i + 1]: | |
| ctr += 1 | |
| i += 1 | |
| if ctr == 1: |
