cloudwu

#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <stdio.h>

#define N (100000063/64)

struct bitset {
	uint64_t bits[N];

cloudwu

#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>

#define CHUNK_N 64

struct eid_chunk {
	uint64_t id[2];

cloudwu

#include <stdio.h>
#include <stdint.h>
#include <assert.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>

// .size is size of sec[]
// .size * 8 >= .section_n * 8 + .n

cloudwu

#include <lua.h>
#include <lualib.h>
#include <lauxlib.h>
#include <stdio.h>

const char * source = "print 'A' ; coroutine.yield() ; print 'B'";

int
main() {
	lua_State *L = luaL_newstate();

cloudwu

#include <stdbool.h>
#include <stdlib.h>
#include <stdio.h>

struct set {
	int n;
	int count;
};

static int

cloudwu

// See: https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/
#include <stdio.h>

#define MAXN 40
#define MAXSTEP (40*40)

struct coord {
	unsigned char x;
	unsigned char y;
};

cloudwu

// Linux: gcc -Wall -o period period.c -lpthread
// Mingw: gcc -Wall -o period.exe period.c 

#include <stdio.h>

#define PERIOD 100	// 100 ms

#if defined(_MSC_VER) || defined(__MINGW32__) || defined(__MINGW64__)

#include <windows.h>

cloudwu

// 'xoshiro256**' algorithm from lua 5.4 implementation
#include "random.h"
#include <stdint.h>
#include <assert.h>

static inline uint64_t *
state(struct prn_state *P) {
	assert(sizeof(*P) == sizeof(uint64_t) * 4);
	return (uint64_t *)P;
}

cloudwu

#ifndef lazy_memory_h
#define lazy_memory_h

#include <stdint.h>
#include <string.h>

#define CacheLine 64
#define WordSize (sizeof(uint64_t) * 8)	// 64 (bits)

#define AlignN(s, n) (( s + n - 1) / n * n)

cloudwu

#include "psystem.h"
#include <cstddef>
#include <cstdio>
#include <algorithm>
#include <vector>
#include "psystem_manager.h"
#define REMAP_CACHE 128

namespace {