tomsik68

#!/bin/bash

if [ $# -ne 1 ]; then
    echo "Usage: $0 [code.c]"
    exit 1
fi

DIR=`dirname $0`

FLAGS1="-rda ss"

tomsik68

digraph Beats {
"zealot" -> "marauder"
"zealot" -> "zergling"
"zealot" -> "immortal"

"adept" -> "zergling"
"adept" -> "zealot"
"adept" -> "marine"

"sentry" -> "zergling"

tomsik68

CFLAGS=-Wall -Wextra -pedantic
MINGW_GCC32=i686-w64-mingw32-g++
MINGW_GCC64=x86_64-w64-mingw32-g++
SOURCES=main.cpp

linux: sdltest_linux

windows: sdltest_win32.exe sdltest_win64.exe

sdltest_linux: $(SOURCES)

tomsik68

Keybase proof

I hereby claim:

• I am tomsik68 on github.
• I am tomsik68 (https://keybase.io/tomsik68) on keybase.
• I have a public key whose fingerprint is 8C45 E05C 1620 7D37 F27A 6799 CA1D 3571 B193 4B34

To claim this, I am signing this object:

tomsik68

#!/usr/bin/env python3
import sqlite3

db1 = sqlite3.connect('storage_original.db')
db2 = sqlite3.connect('storage_new.db')

out = sqlite3.connect('storage_out.db')
outCursor = out.cursor()

# denied, helpers, settings, trusted

tomsik68

from math import sin, cos, sqrt, pi
# funkcie, objekty
class KomplexneCislo:
    def __init__(self, modul, fi):
        self.modul = modul
        self.fi = fi
    def toString(self):
        return "cos(%2.4f) + i*sin(%2.4f) = %2.4f + %2.4fi" % (self.fi, self.fi, cos(self.fi), sin(self.fi))

def ntaKomplexnaOdmocnina(komplexneCislo, n):

tomsik68

from lxml import etree

htmlTree = etree.parse('roz_1415_0915.xml')

def atributyPrvkov(xpath):
	result = []
	elems = htmlTree.xpath(xpath)
	for elem in elems:
		result.append(elem.attrib)
	return result

tomsik68

init();
        while (true) {
            long time = System.currentTimeMillis();
            tick();
            long now = System.currentTimeMillis();
            long elapsed = (now - time);
            long sleepTime = 1000 / getMaxFPS() - elapsed;
            try {
                if (sleepTime > 0) {
                    Thread.sleep(sleepTime);

tomsik68

def faktorial(n):
    result = 1
    nums = range(1,n)
    for i in nums:
        result *= i
    return result
def kombinacneCislo(n, k):
    return faktorial(n)/(faktorial(k)*faktorial(n-k))
cisla = [kombinacneCislo(1999,1000), kombinacneCislo(2000,1000),kombinacneCislo(2001,2000),kombinacneCislo(2000,1001)]
pismena = ['A','B','C','D']