lnsp

package main

import (
	"fmt"
	"os"
	"strconv"
)

// PerfectSquaresIn builds a list of perfect squares smaller or equal than n.
func PerfectSquaresIn(n int) []int {

lnsp

public class JavaKurs7 {
  public static void main(String[] args) {
    // Raetsel loesen: Weise den Variablen den richtigen Wert zu, um den Code zu knacken.
    // ======== Raetsel 1: Logik pur! ========
    boolean A = true; // Hier einsetzen!
    boolean B = true; // Hier einsetzen!
    boolean C = true; // Hier einsetzen!
    
    // D soll zu true auswerten! Es gibt drei mögliche Lösungen!
    boolean D = (A || B || !C) && (A || !B || C) && (!A || B || C) && (!A || B || !C) && (!A || !B || !C);

lnsp

Keybase proof

I hereby claim:

• I am lnsp on github.
• I am lnsp (https://keybase.io/lnsp) on keybase.
• I have a public key ASB0KxBItdYlQmUMn8UgMKUp3o3gJA5eQtCOGd-EIELwEQo

To claim this, I am signing this object:

lnsp

VHDL Code testen

Schritt 1: GHDL und GtkWave installieren

• http://ghdl.free.fr (Download GHDL)
• http://gtkwave.sourceforge.net (Download GTKWave)

Schritt 2: Testbench erstellen

Beispiel: Zu testende Entity

lnsp

import java.util.Scanner;

public class JavaKurs6 {
	public static void main(String[] args) {
		// Nicht ändern!!
		Scanner in = new Scanner(System.in);
		System.out.print("Bitte gib eine Zahl ein: ");
		int a = in.nextInt(), b = 0, c = 0, d = 0;
		
		// Hier beginnt dein Code!

lnsp

import java.util.Scanner;

public class JavaKurs6 {
	public static void main(String[] args) {
		// Nicht ändern!!
		Scanner in = new Scanner(System.in);
		System.out.print("Bitte gib eine Zahl ein: ");
		int a = in.nextInt(), b = 0, c = 0, d = 0;
		
		// Hier beginnt dein Code!

lnsp

public class Programm {
	public static void main(String[] args) {
		byte rang = 1;
		short freunde = 2000;
		int alter = 36;
		long gehalt = 300000000;
		double guthaben = 3.14;
		float chance = 25.4235f;
		char geschlecht = 'm';
		boolean lebend = true;

lnsp

Keybase proof

I hereby claim:

• I am lnsp on github.
• I am lnsp (https://keybase.io/lnsp) on keybase.
• I have a public key ASBO53YtumwG7-tVjKeQ-dSlwFnhHitmYCGNAI9K2D_1zAo

To claim this, I am signing this object:

lnsp

from operator import itemgetter

def limit_search_space(space, pattern, bad_char):
    # _ for unknown character
    index = 0
    # filter by symbols
    for char in pattern:
        if char != '_':
            space = [word for word in space if word[index] == char]
        else:

lnsp

public class BinarySearchTree<T extends Comparable> {
	 private class Node {
		 private T mContent;
		 private Node mLeft, mRight;
		 
		 public Node(T content, Node left, Node right) {
			 mContent = content;
			 mLeft = left;
			 mRight = right;