Skip to content

Instantly share code, notes, and snippets.

View iderex's full-sized avatar

Nils Lehnen iderex

  • Düsseldorf, Germany
View GitHub Profile
services:
# ============================================================
# Reverse Proxy / Auth
# ============================================================
traefik:
image: traefik:latest
container_name: traefik
restart: unless-stopped
env_file:
- .env
@iderex
iderex / bcsm_103_Teilaufgabe.py
Last active September 8, 2022 18:40
bcsm_103_Teilaufgabe.py
# 254 Zeilen reiner Code, ohne Kommentare
import os
import sys
import pygame
import random
import csv
from pygame.math import Vector2
class Snake:
@iderex
iderex / dec.py
Created May 2, 2022 00:33
aufg2-dec
class Decryptor:
def __init__(self):
self.flag = '134af6e1297bc4a96f6a87fe046684e8047084ee046d84c5282dd7ef292dc9'
self.arr = []
self.xored = b""
self.key = [Decryptor.find_key("13", "H"), Decryptor.find_key("4a", "T"), Decryptor.find_key("f6", "B"),
Decryptor.find_key("e1", "{")]
def run(self):
def decryption(nachricht):
dec = []
for char in nachricht:
dec.append(179 * (char - 18) % 256)
return bytes(dec)
with open('nachricht.enc') as f:
print(decryption(bytes.fromhex(f.read())))
@iderex
iderex / PiholeStack.txt
Last active September 30, 2021 20:41
Pihole Stack
version: "2"
services:
pihole:
container_name: pihole
image: pihole/pihole:latest
ports:
- 53:53/tcp #DNS Port
- 53:53/udp #DNS Port
- 67:67/udp #DHCP Port
- 83:80/tcp #Dashboard Port
@iderex
iderex / DuplicatiStack.txt
Created September 30, 2021 02:12
Duplicati Stack
version: "2.1"
services:
duplicati:
image: linuxserver/duplicati
container_name: duplicati
environment:
- PUID=1000
- PGID=1000
- TZ=Europe/Berlin
volumes:
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#define DELIM " \n\r"
enum op {OP_RET, OP_PUSH, OP_ADD, OP_MUL, OP_EQ};
static long
IDENTIFICATION DIVISION.
PROGRAM-ID. 'Anton'
ANLAGENDATUM =
DATA DIVISION.
WORKING-STORAGE SECTION.
01 DATUM.
05 VON PIC 9(8).
05 BIS PIC 9(8).
public static void QuickSortRecursive(ref int[] data, int left, int right)
{
if (left < right)
{
int q = Partition(ref data, left, right);
QuickSortRecursive(ref data, left, q - 1);
QuickSortRecursive(ref data, q + 1, right);
}
}
Imports Microsoft.VisualBasic
Public Structure RGB
Private r As Byte
Private g As Byte
Private b As Byte
Public Sub New(r As Byte, g As Byte, b As Byte)
Me.r = r
Me.g = g