razimantv

#include <iostream>
#include <map>
#include <random>
#include <tuple>
#include <vector>

std::random_device rd;
std::mt19937 gen(rd());

typedef std::vector<std::string> pattern;

razimantv

razimantv

razimantv

#include <iostream>
#include <iterator>
#include <numeric>
#include <queue>
#include <string>
#include <vector>

bool notblocked(const std::string& str, char c) {
  int L = str.size();
  if (L < 2) return true;

razimantv

#include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <vector>

// RGB values
// Add arithmetic operations to take means squared deviations
struct rgb {

razimantv

primes = [2, 3, 5, 7]
parent = [-1, -1, -1, -1]
digits = [1, 3, 7, 9]

def isprime(N):
    i = 2
    while i * i <= N:
        if N % i == 0:
            return False
        i += 1

razimantv

#include <algorithm>
#include <iostream>
#include <numeric>
#include <set>
#include <vector>

typedef std::vector<int> triplet;

// List all ways to choose K-element subsets of an N-element vector
// By abusing next_permutation

razimantv

#include <algorithm>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>

std::string all = "0123456789";
std::random_device rd;
std::mt19937 gen(rd());

razimantv

/* Signpost solver
 * Author: Raziman T V
 *
 * (Game can be found at
 * http://www.chiark.greenend.org.uk/~sgtatham/puzzles/js/signpost.html)
 *
 * Board is to be input as
 * H W
 * v_i dir_i
 * where v_i is the value of ith cell (0 for unknown)

razimantv

#include <cmath>
#include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>

using namespace std;

random_device rd;
mt19937_64 gen(rd());