DanilAndreev

Add to .idea/misc.xml

<project version="4">
  ...
  <component name="CMakeWorkspace" PROJECT_DIR="$PROJECT_DIR$" />
  ...
</project>   

Thanks for solution to Martin Weber.

DanilAndreev

import sys


class ProgramArguments:
    def __init__(self):
        self.args = []
        self.flags = dict()

    def is_set(self, flag: str) -> bool:
        return str in self.flags

DanilAndreev

Docker cheat sheet

Remove all images at once

docker rmi $(docker images -q)

DanilAndreev

#ifndef EVENT_EMITTER_HPP
#define EVENT_EMITTER_HPP

#include <string>
#include <map>
#include <unordered_set>

namespace events {
    class event_emitter;

DanilAndreev

#!/bin/bash

#Deniz Ege Tunçay, 2019
#nrtkbb, 2018
#Neal Burger, 2017

#Autodesk Maya Installation Bash Script v1.0 for Ubuntu 18.04 based Linux Distributions
#if you have any issues, feel free tweet me // @egetun

#Make sure we’re running with root permissions.

DanilAndreev

Kruskal's algorithm (Minimum spanning tree)

Introduction

Kruskal's algorithm - efficient algorithm for constructing the minimum spanning tree of a weighted connected undirected graph. The algorithm is also used to find some approximations for the Steiner problem.

Task

The algorithm solves the problem of finding the minimum spanning tree (MST).

DanilAndreev

Linux docker install script

Overview

This script will automatically install docker and docker-compose and configure them for use without command sudo.

Usage

1. Copy setup.sh to your OS in any available way.

DanilAndreev

Finding paths on a 2D map (Dijkstra and A* algorithms)

Introduction

In this article, I want to talk about one of the easiest ways to find paths for a two-dimensional map. I do not take into account the greedy search algorithm because of its simplicity and not optimality. Today we will talk about the algorithm for finding the shortest paths from one vertex of the graph to all the others, proposed by the Dutch scientist Edsger Wybe Dijkstra. Also, I will show you A* algorithm, based on Dijkstra.

DanilAndreev

Rainbow tables

Introduction

A lot of water has flowed under the bridge since then, when the theme of rainbow tables was at its peak, but, nevertheless, the idea is entertaining. It is about this kind of intricate tables that I want to tell you.

Theory

Brute force method

DanilAndreev

Reverse Polish Notation (RPN)

There is an ancient tradition in mathematics to place an operator between the operands (x + y) rather than after the operands xy+. Form with an operator between operands is called infix notation. The form with an operator after the operands is called postfix, or Reverse Polish notation. It has a number of advantages over infix notation when expressing algebraic formulas:

1. Any formula can be expressed without parentheses.
2. It is convenient for calculating formulas on stacked machines.
3. Infix operators have precedence that is arbitrary and undesirable.