thamma

From Coq Require Import List.
Require Import Arith Lia.
Import ListNotations.
(** R1 **)
Print sum.

Goal forall A B a b, ~ (inleft A a = inright B b).
Proof.
  intros A B a b H.
  change (match (inleft A a) with inleft _ a => False | inright _ b => True end).

thamma

#!/bin/bash
notify-send "$1 finished downloading"

thamma

λ a = [0..9]
λ b = [(o,n,e,f,i,v,t,w) | o <- [1..9], n  <- a, e <- a, f <- [1..9], i <- a, v <- a, t <- a, w <- a]
λ f = \(o,n,e,f,i,v,t,w) -> (round $ 100*t+10*w+o) `mod` 2 == 0 && (100*o+10*n+e)/(1000*f+100*i+10*v+e)*1000 == 100*t + 10*w + o
λ filter f b
[(2.0,0.0,0.0,6.0,2.0,5.0,0.0,3.0),(2.0,1.0,0.0,5.0,0.0,0.0,0.0,4.0),(2.0,2.0,5.0,3.0,1.0,2.0,0.0,7.0),(2.0,3.0,0.0,2.0,5.0,0.0,0.0,9.0),(2.0,4.0,0.0,1.0,2.0,5.0,1.0,9.0),(2.0,4.0,0.0,7.0,5.0,0.0,0.0,3.0),(2.0,6.0,0.0,5.0,0.0,0.0,0.0,5.0),(2.0,7.0,0.0,3.0,7.0,5.0,0.0,7.0),(2.0,8.0,0.0,2.0,5.0,0.0,1.0,1.0),(2.0,8.0,0.0,8.0,7.0,5.0,0.0,3.0),(2.0,8.0,5.0,1.0,8.0,7.0,1.0,5.0),(2.0,9.0,0.0,1.0,2.0,5.0,2.0,3.0),(4.0,0.0,0.0,6.0,2.0,5.0,0.0,6.0),(4.0,1.0,0.0,2.0,5.0,0.0,1.0,6.0),(4.0,2.0,0.0,5.0,0.0,0.0,0.0,8.0),(4.0,3.0,0.0,1.0,2.0,5.0,3.0,4.0),(4.0,5.0,5.0,4.0,3.0,7.0,1.0,0.0),(4.0,6.0,0.0,2.0,5.0,0.0,1.0,8.0),(4.0,7.0,0.0,5.0,0.0,0.0,0.0,9.0),(4.0,8.0,0.0,1.0,2.0,5.0,3.0,8.0),(4.0,8.0,0.0,7.0,5.0,0.0,0.0,6.0),(4.0,9.0,5.0,1.0,8.0,7.0,2.0,6.0)^T,(6.0,0.0,0.0,6.0

thamma

#!/bin/bash
lh="ls -lFhav --group-directories-first" #size,show type,human readable
l1="ls -lFhav --group-directories-first --color=always $1 #| grep -v '*' && $lh --color=always $1 | grep '*'"
l2="$lh --color=always | grep -v '*'&& $lh --color=always | grep '*'"


if [[ -n "$1" ]]; then #non-null
   ls -lFhav --group-directories-first --color=always $1 | grep -v '*'
   ls -lFhav --group-directories-first --color=always $1 | grep '*'
else

thamma

nums = [(a,b,c,d,e,f) | a <- [0..9], b <- [0..9], c <- [0..9], d <- [0..9], e <- [0..9], f <- [0..9]]

(%) = mod

(⇒) a b =  (not a) || b

clauses = [	\(a,b,c,d,e,f) -> c == 1,
	\(a,b,c,d,e,f) -> e % 2 == 0,
	\(a,b,c,d,e,f) -> c < e,
	\(a,b,c,d,e,f) -> b == 2*e,

thamma

public final class HelloWorld {
   public static void main(String[] var0) {
      _0(new byte[30000], 0);
      System.out.flush();
   }

   private static int _0(byte[] var0, int var1) {
      for(var0[var1] = (byte)(var0[var1] + 13); 0 != var0[var1]; var1 = _1(var0, var1)) {
         ;
      }

thamma

Dominic Z:
jobwelchsel, aka spezifizierungen, etwa alle 20 level, mit dem benefit, dass man alle skillpoints/die skillpoints des vorherigen jobs (auch die alter jobs) reskillen kann?

Kai Vogelgesang:
würd reskillen immer erlauben

Dominic Z:
for free?

thamma

iteration 1  
Coordinate{x=2, y=2}
iteration 2  
Coordinate{x=3, y=2}
iteration 3  
Coordinate{x=1, y=2}
iteration 4  
Coordinate{x=3, y=1}
iteration 5  
Coordinate{x=0, y=2}

thamma

iteration 1  
Coordinate{x=2, y=2}
iteration 2  
Coordinate{x=3, y=2}
iteration 3  
Coordinate{x=1, y=2}
iteration 4  
Coordinate{x=3, y=1}
iteration 5  
Coordinate{x=0, y=2}

thamma

    #           #               
 + $# $   .     # .   ##$ +     
 $   #        ^^ #     #___#_   
  $ #  x  $  $$  # $$________   
$$  #         x   ##__#__#____. 
   ~#   $ x  $$.   #_____#__#_  
~~~~~#$  ^   #      #_____#__#_ 
~~~~~# . ^  #    x  #_____#____ 
# %%      ^ #   $    #__#__#___ 
###  x $   ## x     #_________^