Skip to content

Instantly share code, notes, and snippets.

View poseidon4o's full-sized avatar

Lyubomir poseidon4o

84 followers · 21 following
  • Sofia Bulgaria
View GitHub Profile
@poseidon4o
poseidon4o / stack-futures.cpp
Last active March 3, 2021 22:54
#include <thread>
#include <future>
#include <fstream>
#include <optional>
#include <variant>
#include <vector>
#include <condition_variable>
struct Error {
int code;
@poseidon4o
poseidon4o / ackerman.cpp
Last active November 18, 2020 09:29
ackerman.cpp
#include <cstdio>
#include <cstdint>
// Compile time recursive Fibonacci implementation
namespace {
// Recursive case
template <int M, int N>
struct ackerman {
enum : uint64_t {
@poseidon4o
poseidon4o / fibonacci.cpp
Created November 17, 2020 21:49
fibonacci.cpp
#include <cstdio>
#include <cstdint>
// Compile time recursive Fibonacci implementation
namespace {
// Recursive case
template <int N>
struct fib {
enum : uint64_t {
@poseidon4o
poseidon4o / TieredVector.hpp
Created January 5, 2020 16:14
#pragma once
#include "../common/Misc.h"
#include <vector>
#include <shared_mutex>
/// Double ended queue with fixed size, does not support resize when full
/// The sequence of elements supports O(1) indexing and O(n) insert at index
/// Support O(1) insert and remove at the start and end of the sequence
@poseidon4o
poseidon4o / HardestGame.h
Last active November 27, 2019 18:37
#include <vector>
const int PLAYER_SPEED = 10;
const int ENEMY_SPEED = 15;
struct Point {
int x;
int y;
};
@poseidon4o
poseidon4o / DFS.cpp
Created November 25, 2019 20:42
#include <cstring>
const char WALL = 'X';
const int SIZE = 10;
/// Trivial recursive implementation passing all state trough arguments
namespace Trivial
{
bool hashPathDFS(const char map[SIZE][SIZE], bool visited[SIZE][SIZE], int startX, int startY, int endX, int endY) {
if (startX < 0 || startX >= SIZE || startY < 0 || startY >= SIZE) {
return false;
@poseidon4o
poseidon4o / hw-examples.md
Last active March 19, 2018 16:28

Корекция:

  • attract-investors - дава информация за 10-те най богати (спрямо количеството монети) потребителя в системата, за всеки от тях показва количеството монети, броят извършени заявки транзакции, времето на първата и последната заявка транзакция извършени от тях.

Допълнение

Пример 1:

Приемаме че има създадени 3 портфейла с ид-та (100, 101 и 102), файлът с нарежданията е празен и изискванията за следните команди (налични пари и монети са изпълнени):

	make-order BUY 3 100 // създаваме нареждане с тип BUY за 3 моенти от портфейл 100
	make-order BUY 5 101 // създаваме нареждане с тип BUY за 5 моенти от портфейл 101
@poseidon4o
poseidon4o / mistery.cpp
Created December 19, 2017 14:32
#include <cstdio>
#include <cstdlib>
int main() { while (putchar(47 + (int)(rand() / 3.2767e4 + 0.5) * 45)); }
@poseidon4o
poseidon4o / ds.tmLanguage
Created September 4, 2017 14:37
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<dict>
<key>comment</key>
<string>Houdini Dialog Scripts</string>
<key>fileTypes</key>
<array>
<string>ds</string>
</array>
@poseidon4o
poseidon4o / flags.cpp
Last active July 12, 2017 13:10
Template class for array of flags
#include <vector>
template <typename FlagEnum, FlagEnum N> class FlagsArray;
template <typename FlagEnum, FlagEnum N>
struct Flags {
FlagsArray<FlagEnum, N> & data;
int index;
void set(FlagEnum flag) {