Skip to content

Instantly share code, notes, and snippets.

View StarOrpheus's full-sized avatar

Zahar Koval StarOrpheus

  • Limassol, Cyprus
View GitHub Profile
@StarOrpheus
StarOrpheus / kek.hs
Last active October 17, 2020 09:23
Monad & monad transformer complete example
import Control.Monad.Trans.State
import Control.Monad.Trans.Except
data StackState a = StackState
{ stackData :: [a]
, stackDoneOps :: Int
, stackOpsLimit :: Int
} deriving (Show)
newStackState :: Int -> StackState a
import os
print(os.path.dirname(__file__))
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <map>
#include <string>
#include <cstring>
//#include <unordered_map>
#include <queue>
#include <algorithm>
class pt:
def __init__(self):
self.x, self.y = 0, 0
def __init__(self, tx, ty):
self.x = tx
self.y = tx
class line:
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.*;
public class WordStatLineIndex {
public static final char[] buf = new char[256];
template<typename T>
class Vector {
private:
T *array;
size_t cap;
size_t end; // last element pointer
public:
Vector() : Vector(1) {}
explicit Vector(size_t initialCap) {
template<typename T, size_t n, size_t m>
using matrix = array<array<T, m>, n>;
template<typename T, size_t n >
matrix<T, n, n> get_one_matrix()
{
matrix<T, n, n> res;
for (size_t i = 0; i < n; i++)
for (size_t j = 0; j < n; j++)
res[i][j] = 0;
int bl_sz = 1;
class query
{
int l;
int r;
int id;
}
bool comp(const query& a, const query& b)
10000
/berq/az/
/berq/hqa/cyx/
/berq/hqa/dove/mxfm/
/berq/hqa/dove/puxu/es/
/berq/hqa/dove/puxu/xqe/
/berq/hqa/mti/
/berq/hqa/qoqc/
/berq/hqa/tcc/
/berq/pll/si/eh/dq/oa/
This file has been truncated, but you can view the full file.
10000
/afu/
/cu/flj/bj/dk/
/cu/flj/bj/yh/ishm/
/cu/flj/lp/mbasj/prjhq/ij/hwq/
/cu/flj/lp/mbasj/prjhq/ij/iap/n/hxp/
/cu/flj/lp/mbasj/prjhq/ij/ri/
/cu/flj/lp/mbasj/prjhq/ij/syvf/wil/aek/
/cu/flj/lp/mbasj/prjhq/ij/syvf/wil/buw/is/
/cu/flj/lp/mbasj/prjhq/ij/syvf/wil/buw/wlhe/avz/chwd/