all stats

moshikoi's stats

guessed the most

namecorrect guessesgames togetherratio
seshoumara661.000
Olivia5120.417
kimapr250.400
IFcoltransG250.400
olus20005140.357
luatic260.333
taswelll160.167
soup girl170.143
Palaiologos180.125
LyricLy2170.118
razetime1100.100
GNU Radio Shows040.000
JJRubes060.000
olive040.000

were guessed the most by

namecorrect guessesgames togetherratio
kimapr260.333
LyricLy6180.333
Olivia4120.333
soup girl270.286
luatic270.286
taswelll270.286
Palaiologos160.167
JJRubes170.143
olus20002140.143
razetime1110.091
GNU Radio Shows040.000
seshoumara060.000
olive040.000
IFcoltransG050.000

entries

round #59

submitted at
2 likes

guesses
comments 0

post a comment


indigo.cpp ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#include <algorithm>
#include <format>
#include <iostream>
#include <map>
#include <numeric>
#include <print>
#include <ranges>
#include <stack>
#include <string>
#include <string_view>
#include <vector>

class Interpreter {
  std::reference_wrapper<std::vector<Interpreter>> _interpreters;

  std::stack<int> _stack;
  std::stack<std::size_t> _reps;
  std::stack<std::size_t> _jmps;
  std::size_t _ic = 0;
  bool _finished = false;
  double _weight = 0.0;
  std::string_view _code;

  std::vector<int> _memory;

public:
  Interpreter(std::vector<Interpreter> &interpreters, std::string_view code)
      : _interpreters{interpreters}, _code{code}, _memory(0xffffff) {}

  int pop() {
    if (_stack.empty()) {
      return 0;
    }
    auto const value = _stack.top();
    _stack.pop();
    return value;
  }

  bool step() {
    if (_ic >= _code.length()) {
      return false;
    }

    char const ch = _code[_ic++];
    switch (ch) {
    case '#':
      _stack.push(0);
      break;
    case '+':
      ++_stack.top();
      break;
    case '@': {
      auto const address = pop();
      _stack.push(_memory[address]);
      break;
    }
    case '!': {
      auto const address = pop();
      auto const value = pop();
      _memory[address] = value;
      break;
    }
    case '?': {
      auto const value = pop();
      _interpreters.get().append_range(make_copies(value));
      break;
    }
    case '[': {
      auto const value = _stack.top();
      _reps.push(value);
      _jmps.push(_ic);
      break;
    }
    case ']':
      --_reps.top();
      _ic = _jmps.top();
      break;
    case '|': {
      auto const value = _stack.top();
      if (value == 0 or _reps.top() == 0) {
        _reps.pop();
        _jmps.pop();
        int braces = 1;

        while (true) {
          if (_code[_ic] == '[') {
            ++braces;
          } else if (_code[_ic] == ']') {
            if (braces == 0) {
              break;
            } else {
              --braces;
            }
          }
          ++_ic;
        }
        ++_ic;
      }
    }
    default:
      throw std::runtime_error(std::format("Invalid character {}", ch));
    }
    return true;
  }

  std::vector<Interpreter> make_copies(int n) {
    return to<std::vector>(std::ranges::views::iota(n) |
                           std::ranges::views::transform([&](auto i) {
                             auto copy = *this;
                             copy._weight = _weight / (n + 1);
                             copy._stack.push(_ic);
                             return copy;
                           }));
  }

  double weight() { return _weight; }
};

int interpret(std::string_view code) {
  std::vector<Interpreter> interpreters;
  std::vector<Interpreter> finished_interpreters;

  interpreters.emplace_back(interpreters, code);

  while (not interpreters.empty()) {
    for (int i = 0; i < interpreters.size();) {
      if (not interpreters[i].step()) {
        finished_interpreters.push_back(interpreters[i]);
        interpreters.erase(interpreters.begin() + i);
      } else {
        ++i;
      }
    }
  }

  std::map<int, double> outputs;
  for (auto &&interpreter : finished_interpreters) {
    outputs[interpreter.pop()] += interpreter.weight();
  }

  return std::ranges::max_element(
             outputs, [](auto &p1, auto &p2) { return p1.second < p2.second; })
      ->first;
}

int main() {
  std::string line;
  std::getline(std::cin, line);
  std::println("{"
               "}",
               interpret(line));
}

round #56

submitted at
1 like

guesses
comments 0

post a comment


rejects.c ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

static bool entry_impl(const char **const ptr, char **const out) {
  char *const savepoint = out ? *out : nullptr;
  bool success = true;
  while (**ptr && **ptr != ')') {
    switch (**ptr) {
    case '\\': (*ptr)++;
    default:
      const char c = **ptr;
      if (*++*ptr == '*')
        (*ptr)++;
      else if (out)
        *(*out)++ = c;
      break;
    case '[':
      (*ptr) += 2;
      if (**ptr == '*')
        (*ptr)++;
      else
        success = false;
      break;
    case '(': {
      (*ptr)++;
      char *const savepoint = out ? *out : nullptr;
      bool inner_success = entry_impl(ptr, out);
      (*ptr)++;
      if (!inner_success) {
        if (**ptr == '*') {
          (*ptr)++;
          if (out) *out = savepoint;
        } else
          success = false;
      }
      break;
    }
    case '|':
      (*ptr)++;
      if (success || !out) {
        entry_impl(ptr, nullptr);
        break;
      } else {
        *out = savepoint;
        return entry_impl(ptr, out);
      }
    }
  }
  return success;
}

bool entry(const char *regex, char *out) {
  if (entry_impl(&regex, &out)) {
    *out = 0;
    return true;
  }
  return false;
}

int run(char *regex, size_t len) {
  char *res = malloc(len);
  if (entry(regex, res)) {
    puts(res);
    free(res);
    return 0;
  } else {
    fputs("No valid string", stderr);
    free(res);
    return 1;
  }
}

int main(int argc, char **argv) {
  int ret;
  switch (argc) {
  case 1:
    const int INPUT_LIMIT = 1'000;
    char * const input = malloc(INPUT_LIMIT);
    if (!fgets(input, INPUT_LIMIT, stdin)) {
      puts("Couldn't read input");
      return 1;
    }
    ret = run(input, strlen(input) + 1);
    free(input);
    return ret;
  case 2:
    size_t buffer_capacity = 2048;
    size_t buffer_size = 0;
    char *buffer = malloc(buffer_capacity);

    FILE *file;
    if (!(file = fopen(argv[1], "r"))) {
      fprintf(stderr, "Failed to read from %s", argv[1]);
      return 1;
    }
    size_t read_count;
    while (1) {
      if (buffer_size == buffer_capacity - 1) buffer = realloc(buffer, buffer_capacity *= 2);
      read_count = fread(buffer + buffer_size, 1, buffer_capacity - 1 - buffer_size, file);
      if (!read_count) break;
      buffer_size += read_count;
    }
    buffer[buffer_size] = 0;
    ret = run(buffer, buffer_size + 1);
    free(buffer);
    return ret;
  case 3: return run(argv[2], strlen(argv[2]) + 1);
  }
}

round #55

submitted at
1 like

guesses
comments 0

post a comment


dir src
CMakeLists.txt ASCII text
1
2
3
4
5
6
add_executable(main)

target_sources(main
    PUBLIC
        FILE_SET modules TYPE CXX_MODULES
        FILES main.cpp tile.cpp traveler.cpp)
main.cpp ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
module;

#include <format>
#include <fstream>
#include <generator>
#include <iostream>
#include <print>
#include <string>

export module main;

import tile;
import traveler;

std::generator<std::string const &>
lines(std::istream &is) {
	std::string line;
	while (std::getline(is, line)) {
		co_yield line;
	}
	co_return;
}

bool
has_victory(std::vector<std::vector<Tile>> &grid) {
	auto const width = std::ranges::max(grid | std::views::transform([](auto const &row) { return row.size(); }));
	auto const height = grid.size();

	for (int row = 0; row < grid.size(); ++row) {
		for (int col = 0; col < grid[row].size(); ++col) {
			Tile &tile = grid[row][col];

			if (tile.connection(Direction::North) != Direction::North) {
				Traveler traveler{row, col, Direction::South};
				traveler.travel(grid);

				if (traveler.row == row && traveler.col == col) {
					return true;
				}

				if (traveler.direction == Direction::South && height > 7 && traveler.row - row == height) {
					return true;
				}
			}

			if (tile.connection(Direction::West) != Direction::West) {
				Traveler traveler{row, col, Direction::East};
				traveler.travel(grid);

				if (traveler.row == row && traveler.col == col) {
					return true;
				}

				if (traveler.direction == Direction::East && width > 7 && traveler.col - col == width) {
					return true;
				}
			}
		}
	}
	return false;
}

int
entry(std::istream &is) {
	std::vector<std::vector<Tile>> grid;

	for (auto const &line : lines(is)) {
		std::vector<Tile> row;

		for (char ch : line) {
			switch (ch) {
			case ' ': row.push_back(Tile::Blank); break;
			case '+': row.push_back(Tile::Cross); break;
			case '/': row.push_back(Tile::Slash); break;
			case '\\': row.push_back(Tile::Backslash); break;
			default: throw std::runtime_error{std::format("Invalid character '{}'", ch)};
			}
		}

		grid.push_back(row);
	}

	if (has_victory(grid)) {
		std::println("Victory");
	} else {
		std::println("No victory");
	}

	return 0;
}

int
main(int argc, char const **argv) {
	try {
		if (argc < 2) {
			entry(std::cin);
		} else {
			std::ifstream is(argv[1]);
			entry(is);
		}
	} catch (std::exception ex) {
		std::println(std::cerr, "{}", ex.what());
		return 1;
	}
}
tile.cpp ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
module;

#include <cstdint>
#include <utility>

export module tile;

export enum class Direction : std::uint8_t {
	East = 0b00,
	North = 0b01,
	West = 0b10,
	South = 0b11,
};

export Direction
opposite(Direction direction) {
	switch (direction) {
	case Direction::East: return Direction::West;
	case Direction::North: return Direction::South;
	case Direction::West: return Direction::East;
	case Direction::South: return Direction::North;
	default: std::unreachable();
	}
}

export class Tile {
  public:
	static Tile const Blank;
	static Tile const Cross;
	static Tile const Slash;
	static Tile const Backslash;

	Direction connection(Direction entry) const;
	void remove_connection(Direction entry);
	bool empty() const { return good != 0b00; }

  private:
	std::underlying_type_t<Direction> direction : 2;
	std::uint8_t good : 2;

	Tile(Direction east) : direction{std::to_underlying(east)}, good{0b11} {}
};

Tile const Tile::Blank{Direction::East};
Tile const Tile::Cross{Direction::West};
Tile const Tile::Slash{Direction::South};
Tile const Tile::Backslash{Direction::North};

Direction
Tile::connection(Direction entry) const {
	Direction const exit = static_cast<Direction>(direction ^ std::to_underlying(entry));
	bool const is_good = (good >> (entry == Direction::East || exit == Direction::East)) & 1;
	return is_good ? exit : entry;
}

void
Tile::remove_connection(Direction entry) {
	Direction const exit = static_cast<Direction>(direction ^ std::to_underlying(entry));
	good &= ~(1 << (entry == Direction::East || exit == Direction::East));
}
traveler.cpp ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
module;

#include <vector>

export module traveler;

import tile;

export class Traveler {
  public:
	int row;
	int col;
	Direction direction;

	Traveler(int row, int col, Direction direction) : row{row}, col{col}, direction{direction} {}

	void travel(std::vector<std::vector<Tile>> &grid);

  private:
	bool step(std::vector<std::vector<Tile>> &grid);
};

void
Traveler::travel(std::vector<std::vector<Tile>> &grid) {
	while (0 <= row && row < grid.size() && 0 <= col && col < grid[row].size()) {
		if (!step(grid)) {
			break;
		}
	}
}

bool
Traveler::step(std::vector<std::vector<Tile>> &grid) {
	Tile &current_tile = grid[row][col];

	Direction entry = opposite(direction);
	Direction const next = current_tile.connection(entry);

	if (entry == next) {
		return false;
	}

	current_tile.remove_connection(entry);
	direction = next;

	switch (direction) {
	case Direction::East: col += 1; break;
	case Direction::North: row -= 1; break;
	case Direction::West: col -= 1; break;
	case Direction::South: row += 1; break;
	default: std::unreachable();
	}

	return true;
}

round #45

submitted at
0 likes

guesses
comments 0

post a comment


main.cpp ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
#include <cstddef>
#include <iostream>
#include <limits>
#include <memory>
#include <stdexcept>
#include <string>
#include <type_traits>
#include <utility>

enum class Color {
	None = 0,
	White = 1,
	Black = 2,
};

Color
opposite(Color color) {
	return color == Color::White ? Color::Black : Color::White;
}

class Board {
	static constexpr auto transposition_table_size = 2 << 10;
	static constexpr auto win_score = 10000;

	Color currentColor;
	int height[7];
	Color grid[7][6];

	struct Transposition {
		bool valid;
		int score;
		std::size_t hash;
	};

	std::unique_ptr<Transposition[]> transposition_table;

  public:
	Board() : height{}, grid{{Color::None}}, currentColor{Color::White} { transposition_table = std::make_unique<Transposition[]>(transposition_table_size); }

	int get_best_move() {
		int bestColumn = 0;
		int bestScore = -win_score;

		for (int column = 0; column < 7; ++column) {
			if (height[column] == 6) {
				continue;
			}
			drop(column);
			int score = is_win(opposite(currentColor), column, height[column] - 1) ? win_score : -negamax(6, -win_score, win_score);
			undrop(column);

			if (score > bestScore) {
				bestColumn = column;
				bestScore = score;
			}
		}

		return bestColumn;
	}

	void drop(int column) {
		auto &columnHeight = height[column];
		if (columnHeight >= 6) {
			throw std::runtime_error{"Attempted to drop a tile on a full column"};
		}
		grid[column][columnHeight] = currentColor;
		currentColor = opposite(currentColor);
		++columnHeight;
	}
	void undrop(int column) {
		auto &columnHeight = height[column];
		--columnHeight;
		grid[column][columnHeight] = Color::None;
		currentColor = opposite(currentColor);
	}

	int negamax(int depth, int alpha, int beta) {
		auto const hash = state_hash();
		auto &entry = transposition_table[hash % transposition_table_size];
		if (entry.valid && entry.hash == hash) {
			return entry.score;
		}
		if (depth < 0) {
			return eval();
		}

		for (int column = 0; column < 7; ++column) {
			if (height[column] == 6) {
				continue;
			}
			drop(column);
			int score = is_win(opposite(currentColor), column, height[column] - 1) ? win_score : -negamax(depth - 1, -beta, -alpha);
			undrop(column);
			if (score > beta) {
				return beta;
			}
			if (score > alpha) {
				alpha = score;
			}
		}

		entry.valid = true;
		entry.hash = hash;
		entry.score = alpha;

		return alpha;
	}

	int eval() { return advantage(currentColor) - advantage(opposite(currentColor)); }

	int advantage(Color color) {
		int total = 0;
		for (int column = 0; column < 7; ++column) {
			int count = 0;
			for (int row = height[column] - 1; row >= 0 && grid[column][row] == color; --row) {
				++count;
			}

			total += count;
		}

		return total;
	}

	bool is_win(Color color, int column, int row) {
		std::pair<int, int> deltas[] = {
		    {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1},
		};

		for (auto const &[deltaX, deltaY] : deltas) {
			for (int offset = 0; offset < 4; ++offset) {
				auto const offsetColumn = column + deltaY * offset;
				auto const offsetRow = row + deltaX * offset;
				if (offsetColumn < 0 || offsetColumn >= 7 || offsetRow < 0 || offsetRow >= 6 || grid[offsetColumn][offsetRow] != color) {
					goto next;
				}
			}
			return true;
		next:
			continue;
		}

		return false;
	}

	std::size_t state_hash() {
		std::size_t hash = 0;
		for (int column = 0; column < 7; ++column) {
			for (int row = 5; row >= 0; --row) {
				hash = hash * 3 + static_cast<std::underlying_type_t<Color>>(grid[column][row]);
			}
		}
		return hash;
	}
};

int
main(int argc, char const **argv) {
	char turn;
	std::cin >> turn;

	Board board{};

	try {
		switch (turn) {
			while (true) {
			case 'f': {
				int move = board.get_best_move();
				std::cout << move << std::endl;
				board.drop(move);
				[[fallthrough]];
			}
			case 's': {
				int move;
				std::cin >> move;
				board.drop(move);
			}
			}
		}
	} catch (std::exception const ex) { std::cerr << ex.what() << std::endl; }
}

round #43

submitted at
0 likes

guesses
comments 2
razetime

(R r d)←⍺. You can thank me later


moshikoi *known at the time as [author of #1] replying to razetime

ok i will thank you later


post a comment


spiro.apls Unicode text, UTF-8 text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
e  ¯1

cycloid  {
  R  1
  r  2
  d  3
  x  ((R - r) × (2  )) + d × 2   × (R - r) ÷ r
  y  ((R - r) × (1  )) - d × 1   × (R - r) ÷ r
  x y
}

plot  {
  bin  (  )   ( ÷ 2) + 
  (   1 + bin)  ' o'
}

draw  {
  size  1
  resolution  2
  R  1
  r  2
  d  3
  cycle  | 2 × resolution × (R  r) ÷ R
  size plot ↓⍉↑ ((size ÷ 2) ÷ R + d + |r) ×  cycloid ( cycle) ÷ resolution
}

  (50 50) draw (8 ¯2 0.3) 

round #42

submitted at
3 likes

guesses
comments 0

post a comment


main.go ASCII text, with CRLF line terminators
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
package main

import (
	"cmp"
	"image/color"
	"log"
	"math"
	"math/rand"
	"slices"
	"strconv"

	"golang.org/x/image/font"
	"golang.org/x/image/font/opentype"

	"github.com/hajimehoshi/ebiten/v2"
	"github.com/hajimehoshi/ebiten/v2/examples/resources/fonts"
	"github.com/hajimehoshi/ebiten/v2/inpututil"
	"github.com/hajimehoshi/ebiten/v2/text"
)

var (
	tileImage *ebiten.Image
	tileFont  font.Face
)

const (
	fontSize              = 48
	innerTileSize         = 90
	tileSize              = 100
	tileSpeed     float64 = 1

	tilePadding = (tileSize - innerTileSize) / 2
)

type Direction int

const (
	DirectionNone Direction = iota
	DirectionLeft
	DirectionRight
	DirectionUp
	DirectionDown
)

type Tile struct {
	screenPos struct{ x, y float64 }
	value     int
	hasMerged bool
}

type Game struct {
	tiles  [4][4]Tile
	isLoss bool

	pressedKeys []ebiten.Key
}

func init() {
	ttf, err := opentype.Parse(fonts.MPlus1pRegular_ttf)

	if err != nil {
		log.Fatal(err)
	}

	tileFont, err = opentype.NewFace(ttf, &opentype.FaceOptions{
		DPI:     72,
		Size:    fontSize,
		Hinting: font.HintingVertical,
	})

	if err != nil {
		log.Fatal(err)
	}

	tileImage = ebiten.NewImage(innerTileSize, innerTileSize)
}

func (g *Game) updateLoss() {
	copy := *g
	g.isLoss = !(copy.stepTiles(DirectionLeft) ||
		copy.stepTiles(DirectionRight) ||
		copy.stepTiles(DirectionUp) ||
		copy.stepTiles(DirectionDown))
}

func (g *Game) IsFull() bool {
	for _, row := range g.tiles {
		for _, tile := range row {
			if tile.value == 0 {
				return false
			}
		}
	}
	return true
}

func (g *Game) SpawnTile() {
	if g.IsFull() {
		g.isLoss = true
		return
	}

	x := rand.Intn(len(g.tiles))
	y := rand.Intn(len(g.tiles[x]))

	for g.tiles[y][x].value != 0 {
		x = rand.Intn(len(g.tiles))
		y = rand.Intn(len(g.tiles[x]))
	}
	if rand.Intn(10) == 0 {
		g.tiles[y][x].value = 4
	} else {
		g.tiles[y][x].value = 2
	}
}

func (g *Game) stepTiles(direction Direction) (hasChanged bool) {
	switch direction {
	case DirectionLeft:
		for y := range g.tiles {
			for x := 1; x < len(g.tiles[y]); x++ {
				if g.tiles[y][x-1].value == 0 {
					g.tiles[y][x-1] = g.tiles[y][x]
					g.tiles[y][x] = Tile{}
					hasChanged = true
				} else if g.tiles[y][x-1].value == g.tiles[y][x].value && !g.tiles[y][x-1].hasMerged && !g.tiles[y][x].hasMerged {
					g.tiles[y][x-1].value *= 2
					g.tiles[y][x-1].hasMerged = true
					g.tiles[y][x] = Tile{}
					hasChanged = true
				}
			}
		}
	case DirectionRight:
		for y := range g.tiles {
			for x := len(g.tiles[y]) - 2; x >= 0; x-- {
				if g.tiles[y][x+1].value == 0 {
					g.tiles[y][x+1] = g.tiles[y][x]
					g.tiles[y][x] = Tile{}
					hasChanged = true
				} else if g.tiles[y][x+1].value == g.tiles[y][x].value && !g.tiles[y][x+1].hasMerged && !g.tiles[y][x].hasMerged {
					g.tiles[y][x+1].value *= 2
					g.tiles[y][x+1].hasMerged = true
					g.tiles[y][x] = Tile{}
					hasChanged = true
				}
			}
		}
	case DirectionUp:
		for y := 1; y < len(g.tiles); y++ {
			for x := range g.tiles[y] {
				if g.tiles[y-1][x].value == 0 {
					g.tiles[y-1][x] = g.tiles[y][x]
					g.tiles[y][x] = Tile{}
					hasChanged = true
				} else if g.tiles[y-1][x].value == g.tiles[y][x].value && !g.tiles[y-1][x].hasMerged && !g.tiles[y][x].hasMerged {
					g.tiles[y-1][x].value *= 2
					g.tiles[y-1][x].hasMerged = true
					g.tiles[y][x] = Tile{}
					hasChanged = true
				}
			}
		}
	case DirectionDown:
		for y := len(g.tiles) - 2; y >= 0; y-- {
			for x := range g.tiles[y] {
				if g.tiles[y+1][x].value == 0 {
					g.tiles[y+1][x] = g.tiles[y][x]
					g.tiles[y][x] = Tile{}
					hasChanged = true
				} else if g.tiles[y+1][x].value == g.tiles[y][x].value && !g.tiles[y+1][x].hasMerged && !g.tiles[y][x].hasMerged {
					g.tiles[y+1][x].value *= 2
					g.tiles[y+1][x].hasMerged = true
					g.tiles[y][x] = Tile{}
					hasChanged = true
				}
			}
		}
	}

	return
}

func (g *Game) MoveTiles(direction Direction) {
	for y := range g.tiles {
		for x := range g.tiles[y] {
			g.tiles[y][x].hasMerged = false
		}
	}

	for {
		old := g.tiles
		g.stepTiles(direction)
		if slices.Equal(g.tiles[:], old[:]) {
			break
		}
	}
}

func (g *Game) Animate() {
	for y, row := range g.tiles {
		for x := range row {
			var targetX = float64(x*tileSize + tilePadding)
			var targetY = float64(y*tileSize + tilePadding)
			g.tiles[y][x].screenPos.x += float64(cmp.Compare(targetX, g.tiles[y][x].screenPos.x)) * tileSpeed
			g.tiles[y][x].screenPos.y += float64(cmp.Compare(targetY, g.tiles[y][x].screenPos.y)) * tileSpeed
		}
	}
}

func (g *Game) Update() error {
	g.Animate()
	g.pressedKeys = inpututil.AppendJustPressedKeys(g.pressedKeys[:0])

	var direction Direction = DirectionNone

Loop:
	for _, key := range g.pressedKeys {
		switch key {
		case ebiten.KeyLeft:
			direction = DirectionLeft
			break Loop

		case ebiten.KeyRight:
			direction = DirectionRight
			break Loop

		case ebiten.KeyUp:
			direction = DirectionUp
			break Loop

		case ebiten.KeyDown:
			direction = DirectionDown
			break Loop
		}
	}

	if direction != DirectionNone {
		old := g.tiles
		g.MoveTiles(direction)
		if !slices.Equal(g.tiles[:], old[:]) {
			g.SpawnTile()
		}
		g.updateLoss()
	}

	return nil
}

func (g *Game) Draw(screen *ebiten.Image) {
	for _, row := range g.tiles {
		for _, tile := range row {
			drawOptions := ebiten.DrawImageOptions{}
			drawOptions.GeoM.Translate(tile.screenPos.x, tile.screenPos.y)

			tileImage.Fill(color.RGBA{R: uint8(50 * math.Log2(float64(tile.value))), G: 0, B: 0, A: 255})

			if tile.value != 0 {
				str := strconv.Itoa(tile.value)
				textBound := text.BoundString(tileFont, str)

				text.Draw(
					tileImage,
					str,
					tileFont,
					innerTileSize/2-textBound.Dx()/2,
					innerTileSize/2+textBound.Dy()/2,
					color.White,
				)
			}

			screen.DrawImage(tileImage, &drawOptions)
		}
	}

	if g.isLoss {
		str := "You lost"
		textBound := text.BoundString(tileFont, str)
		text.Draw(
			screen,
			str,
			tileFont,
			screen.Bounds().Dx()/2-textBound.Dx()/2,
			screen.Bounds().Dy()/2+textBound.Dy()/2,
			color.White,
		)
	}
}

func (g *Game) Layout(outsideWidth, outsideHeight int) (screenWidth, screenHeight int) {
	return 4 * tileSize, 4 * tileSize
}

func main() {
	ebiten.SetWindowSize(640, 640)
	ebiten.SetWindowTitle("Hello, World!")

	game := Game{}
	game.SpawnTile()

	if err := ebiten.RunGame(&game); err != nil {
		log.Fatal(err)
	}
}

round #41

submitted at
1 like

guesses
comments 0

post a comment


dir src
compiler.ts ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
import { TextEncoder } from "util";
import { AstNode, AstType } from "./parser.js";

function exhaustive(x: never): never {
    throw new Error(`Expected all cases to be handled, but got ${x} instead`);
}

function encode_string(str: string): [number, string] {
    const encoder = new TextEncoder();
    const enc = [...encoder.encode(str)];
    const enc_str = enc.map(code => {
        let hex = code.toString(16)
        if (hex.length === 1) { hex = '0' + hex; }
        return '\\' + hex;
    }).join('');
    return [enc.length + 1, enc_str + '\\00'];
}

function varName(name: string) {
    return `@var_${name}`;
}

function astEqual(a: AstNode['value'], b: AstNode['value']) {
    if (typeof a !== typeof b) { return false; }
    if (!(a instanceof Array && b instanceof Array)) { return a === b; }
    if (a.length !== b.length) { return false; }

    for (let i = 0; i < a.length; i++) {
        if (a[i].type !== b[i].type) {
            return false
        }

        return astEqual(a[i].value, b[i].value);
    }

    return true;
}

class TemporaryGenerator {
    #id: number = 1;
    #template: (id: number) => string
    constructor(template: string | ((id: number) => string)) {
        if (typeof template === 'string') {
            this.#template = id => template + id.toString();
        }
        else {
            this.#template = template;
        }
    }
    next() {
        return this.#template(this.#id++);
    }
}

function definePush(name: string, type: string) {
    return `
define void ${name}(${type} %value) {
entry:
  %stack_size = load i64, i64* @stack_size
  %stack_capacity0 = load i64, i64* @stack_capacity
  %cond = icmp eq i64 %stack_size, %stack_capacity0
  br i1 %cond, label %increase_capacity, label %set_value
  
increase_capacity:
  %buffer0 = load ptr, ptr @stack
  %new_capacity = shl i64 %stack_capacity0, 1
  %new_buffer_size = mul i64 %new_capacity, 8
  %new_buffer = call ptr @realloc(ptr %buffer0, i64 %new_buffer_size)
  store ptr %new_buffer, ptr @stack
  store i64 %new_capacity, i64* @stack_capacity
  br label %set_value

set_value:
  %buffer1 = load ptr, ptr @stack
  %top = getelementptr %union.FalseValue, %union.FalseValue* %buffer1, i64 %stack_size
  %cast = bitcast %union.FalseValue* %top to ${type}*
  store ${type} %value, ${type}* %cast
  %new_size = add i64 %stack_size, 1
  store i64 %new_size, i64* @stack_size
  ret void
}`
}

function definePop(name: string, type: string) {
    return `
define ${type} ${name}() {
entry:
  %stack_size = load i64, i64* @stack_size
  %new_size = sub i64 %stack_size, 1
  store i64 %new_size, i64* @stack_size
  %buffer = load ptr, ptr @stack
  %top = getelementptr %union.FalseValue, ptr %buffer, i64 %new_size
  %cast = bitcast %union.FalseValue* %top to ${type}*
  %value = load ${type}, ptr %cast
  ret ${type} %value
}`
}

function definePeek(name: string, type: string) {
    return `
define ${type} ${name}(i32 %depth) {
entry:
  %stack_size = load i64, i64* @stack_size
  %0 = sext i32 %depth to i64
  %1 = sub i64 %stack_size, %0
  %peek_size = sub i64 %1, 1
  %buffer = load ptr, ptr @stack
  %top = getelementptr %union.FalseValue, ptr %buffer, i64 %peek_size
  %cast = bitcast %union.FalseValue* %top to ${type}*
  %value = load ${type}, ptr %cast
  ret ${type} %value
}`
}

const head = `
@.fmt = private unnamed_addr constant [3 x i8] c"%s\\00"
@.num = private unnamed_addr constant [3 x i8] c"%d\\00"

declare ptr @malloc(i64)
declare ptr @realloc(ptr, i64)
declare void @free(ptr)
declare i32 @putchar(i32)
declare i32 @getchar()
declare i32 @printf(i8*, ...)

%union.FalseValue = type { [8 x i8] }

@stack = global %union.FalseValue* null
@stack_size = global i64 0
@stack_capacity = global i64 0

define void @stack_init() {
entry:
  store i64 16, i64* @stack_capacity
  %stack_capacity = load i64, i64* @stack_capacity
  %buffer_size = mul i64 %stack_capacity, 8
  %buffer = call ptr @malloc(i64 %buffer_size)
  store i64 0, i64* @stack_size
  store ptr %buffer, %union.FalseValue** @stack
  ret void
}

${definePush('@stack_push_any', '%union.FalseValue')}
${definePush('@stack_push_int', 'i32')}
${definePush('@stack_push_ref', '%union.FalseValue*')}
${definePush('@stack_push_quote', 'void()*')}

${definePop('@stack_pop_any', '%union.FalseValue')}
${definePop('@stack_pop_int', 'i32')}
${definePop('@stack_pop_ref', '%union.FalseValue*')}
${definePop('@stack_pop_quote', 'void()*')}

${definePeek('@stack_peek_any', '%union.FalseValue')}
${definePeek('@stack_peek_int', 'i32')}
${definePeek('@stack_peek_ref', '%union.FalseValue*')}
${definePeek('@stack_peek_quote', 'void()*')}

define void @stack_free() {
entry:
  %buffer = load ptr, ptr @stack
  call void @free(ptr %buffer)
  ret void
}

${[...'abcdefghijklmnopqrstuvwxyz']
        .map(a => `${varName(a)} = private global %union.FalseValue { [8 x i8] zeroinitializer }`)
        .join('\n')}
`

class Compiler {

    #functions: [nodes: AstNode[], name: string, compiled: string][] = []
    #strings: Map<string, string> = new Map();

    #compile(nodes: AstNode[]): string {
        const temporaryGenerator = new TemporaryGenerator('%t');
        const labelGenerator = new TemporaryGenerator('label_');

        const instructions: string[] = [];

        function basicOp(op: string): void {
            const second = temporaryGenerator.next();
            const first = temporaryGenerator.next();
            const result = temporaryGenerator.next();
            instructions.push(
                `${second} = call i32 @stack_pop_int()`,
                `${first} = call i32 @stack_pop_int()`,
                `${result} = ${op} i32 ${first}, ${second}`,
                `call void @stack_push_int(i32 ${result})`);
        }

        function cmp(op: string): void {
            const second = temporaryGenerator.next();
            const first = temporaryGenerator.next();
            const result = temporaryGenerator.next();
            const cast = temporaryGenerator.next();
            instructions.push(
                `${second} = call i32 @stack_pop_int()`,
                `${first} = call i32 @stack_pop_int()`,
                `${result} = icmp ${op} i32 ${first}, ${second}`,
                `${cast} = sext i1 ${result} to i32`,
                `call void @stack_push_int(i32 ${cast})`);
        }

        for (const node of nodes) {
            switch (node.type) {
                case AstType.Variable:
                    instructions.push(`call void @stack_push_ref(%union.FalseValue* ${varName(node.value)})`);
                    break;
                case AstType.String: {
                    const strName = this.#getConstString(node.value);
                    instructions.push(`call i32 @printf(i8* @.fmt, i8* ${strName})`);
                    break;
                }

                case AstType.Integer:
                    instructions.push(`call void @stack_push_int(i32 ${node.value})`);
                    break;
                case AstType.Quote: {
                    const name = this.#getFunction(node.value);
                    instructions.push(`call void @stack_push_quote(void()* ${name})`);
                    break;
                }

                case AstType.GetVar: {
                    const varRef = temporaryGenerator.next();
                    const value = temporaryGenerator.next();
                    instructions.push(
                        `${varRef} = call %union.FalseValue* @stack_pop_ref()`,
                        `${value} = load %union.FalseValue, %union.FalseValue* ${varRef}`,
                        `call void @stack_push_any(%union.FalseValue ${value})`);
                    break;
                }

                case AstType.SetVar: {
                    const varRef = temporaryGenerator.next();
                    const value = temporaryGenerator.next();
                    instructions.push(
                        `${varRef} = call %union.FalseValue* @stack_pop_ref()`,
                        `${value} = call %union.FalseValue @stack_pop_any()`,
                        `store %union.FalseValue ${value}, %union.FalseValue* ${varRef}`);
                    break;
                }

                case AstType.Dup: {
                    const value = temporaryGenerator.next();
                    instructions.push(
                        `${value} = call %union.FalseValue @stack_peek_any(i32 0)`,
                        `call void @stack_push_any(%union.FalseValue ${value})`);
                    break;
                }

                case AstType.Discard:
                    instructions.push(`call %union.FalseValue @stack_pop_any()`);
                    break;
                case AstType.Swap: {
                    const first = temporaryGenerator.next();
                    const second = temporaryGenerator.next();
                    instructions.push(
                        `${first} = call %union.FalseValue @stack_pop_any()`,
                        `${second} = call %union.FalseValue @stack_pop_any()`,
                        `call void @stack_push_any(%union.FalseValue ${first})`,
                        `call void @stack_push_any(%union.FalseValue ${second})`);
                    break;
                }

                case AstType.Rotate: {
                    const first = temporaryGenerator.next();
                    const second = temporaryGenerator.next();
                    const third = temporaryGenerator.next();
                    instructions.push(
                        `${first} = call %union.FalseValue @stack_pop_any()`,
                        `${second} = call %union.FalseValue @stack_pop_any()`,
                        `${third} = call %union.FalseValue @stack_pop_any()`,
                        `call void @stack_push_any(%union.FalseValue ${second})`,
                        `call void @stack_push_any(%union.FalseValue ${first})`,
                        `call void @stack_push_any(%union.FalseValue ${third})`);
                    break;
                }

                case AstType.Take: {
                    const depth = temporaryGenerator.next();
                    const value = temporaryGenerator.next();
                    instructions.push(
                        `${depth} = call i32 @stack_pop_int()`,
                        `${value} = call %union.FalseValue @stack_peek_any(i32 ${depth})`,
                        `call void @stack_push_any(%union.FalseValue ${value})`);
                    break;
                }

                case AstType.Plus: basicOp('add'); break;
                case AstType.Minus: basicOp('sub'); break;
                case AstType.Mul: basicOp('mul'); break;
                case AstType.Div: basicOp('sdiv'); break;
                case AstType.Negate: {
                    const value = temporaryGenerator.next();
                    const temp = temporaryGenerator.next();
                    instructions.push(
                        `${value} = call i32 @stack_pop_int()`,
                        `${temp} = sub i32 0, ${value}`,
                        `call void @stack_push_int(i32 ${temp})`);
                    break;
                }

                case AstType.BitAnd: basicOp('and'); break;
                case AstType.BitOr: basicOp('or'); break;
                case AstType.BitInvert: {
                    const value = temporaryGenerator.next();
                    const temp = temporaryGenerator.next();
                    instructions.push(
                        `${value} = call i32 @stack_pop_int()`,
                        `${temp} = xor i32 -1, ${value}`,
                        `call void @stack_push_int(i32 ${temp})`);
                    break;
                }

                case AstType.Equal: cmp('eq'); break;
                case AstType.GreaterThan: cmp('sgt'); break;
                case AstType.Execute: {
                    const value = temporaryGenerator.next();
                    instructions.push(
                        `${value} = call void()* @stack_pop_quote()`,
                        `call void ${value}()`);
                    break;
                }

                case AstType.ExecuteIf: {
                    const iftrue = labelGenerator.next();
                    const iffalse = labelGenerator.next();
                    const quote = temporaryGenerator.next();
                    const value = temporaryGenerator.next();
                    const cond = temporaryGenerator.next();

                    instructions.push(
                        `${quote} = call void()* @stack_pop_quote()`,
                        `${value} = call i32 @stack_pop_int()`,
                        `${cond} = icmp ne i32 ${value}, 0`,
                        `br i1 ${cond}, label %${iftrue}, label %${iffalse}`,
                        `${iftrue}:`,
                        `call void ${quote}()`,
                        `br label %${iffalse}`,
                        `${iffalse}:`);
                    break;
                }

                case AstType.While: {
                    const loop = labelGenerator.next();
                    const iftrue = labelGenerator.next();
                    const iffalse = labelGenerator.next();
                    const body = temporaryGenerator.next();
                    const cond_quote = temporaryGenerator.next();
                    const value = temporaryGenerator.next();
                    const cond = temporaryGenerator.next();

                    instructions.push(
                        `${body} = call void()* @stack_pop_quote()`,
                        `${cond_quote} = call void()* @stack_pop_quote()`,
                        `br label %${loop}`,
                        `${loop}:`,
                        `call void ${cond_quote}()`,
                        `${value} = call i32 @stack_pop_int()`,
                        `${cond} = icmp ne i32 ${value}, 0`,
                        `br i1 ${cond}, label %${iftrue}, label %${iffalse}`,
                        `${iftrue}:`,
                        `call void ${body}()`,
                        `br label %${loop}`,
                        `${iffalse}:`);
                    break;
                }

                case AstType.Getc: {
                    const temp = temporaryGenerator.next();
                    instructions.push(
                        `${temp} = call i32 @getchar()`,
                        `call void @stack_push_int(i32 ${temp})`);
                    break;
                }

                case AstType.Putc: {
                    const temp = temporaryGenerator.next();
                    instructions.push(
                        `${temp} = call i32 @stack_pop_int()`,
                        `call i32 @putchar(i32 ${temp})`);
                    break;
                }

                case AstType.PrintInt: {
                    const temp = temporaryGenerator.next();
                    instructions.push(
                        `${temp} = call i32 @stack_pop_int()`,
                        `call i32 @printf(i8* @.num, i32 ${temp})`);
                    break;
                }

                default:
                    exhaustive(node);
            }
        }
        return instructions.join('\n');
    }

    compile(ast: AstNode[]) {
        const topLevel = this.#compile(ast);

        const strings = [...this.#strings.entries()]
            .map(([str, name]) => {
                const [len, enc] = encode_string(str);
                return `${name} = private unnamed_addr constant [${len} x i8] c"${enc}"`
            });

        return head + [
            ...strings,
            ...this.#functions.map(x => x[2]),
            'define i32 @main() {',
            'call void @stack_init()',
            topLevel,
            'call void @stack_free()',
            'ret i32 0',
            '}',
        ].join('\n');
    }

    #lambdaNameGenerator = new TemporaryGenerator('@lambda_');
    #stringNameGenerator = new TemporaryGenerator('@str_');

    #getFunction(nodes: AstNode[]) {
        const name = this.#functions.find(([value]) => astEqual(nodes, value))?.[1];
        if (name) {
            return name;
        }
        else {
            const name = this.#lambdaNameGenerator.next();
            const compiled = `define void ${name}() {\nentry:\n${this.#compile(nodes)}\nret void\n}`;
            this.#functions.push([nodes, name, compiled]);
            return name;
        }
    }

    #getConstString(str: string) {
        const name = this.#strings.get(str);
        if (name) {
            return name;
        }
        else {
            const name = this.#stringNameGenerator.next();
            this.#strings.set(str, name);
            return name;
        }
    }
}

export function compile(source: AstNode[]): string {
    return new Compiler().compile(source);
}
false.ts ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#!/usr/bin/env node

// FALSE -> LLVM IR Compiler
// Requirements:
//  - Node.js
//  - Typescript Compiler
//  - LLC or equivalent (something to compile LLVM IR)

import { readFile, writeFile } from "fs/promises";
import { compile } from "./compiler.js";
import { parse } from "./parser.js";

async function main() {
	const filename = process.argv[2];
	if (!filename) {
		console.error('Filename required');
		process.exit(1);
	}

	const source = await readFile(filename, 'utf-8');
	const outFile = process.argv[3] ?? filename.replace(/\..+$/, '.ll');

	const ast = parse(source);
	console.info('Parsed AST');
	const IR = compile(ast);
	await writeFile(outFile, IR);
	console.info('Compiled to ' + outFile)
}

await main();
parser.ts ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
import { Token, TokenType, Tokenizer } from "./tokenizer.js"

export enum AstType {
	Variable,
	String,
	Integer, // Including chars such as 'A
	Quote,
	GetVar,
	SetVar,
	Dup,
	Discard,
	Swap,
	Rotate,
	Take,
	Plus,
	Minus,
	Mul,
	Div,
	Negate,
	BitAnd,
	BitOr,
	BitInvert,
	Equal,
	GreaterThan,
	Execute,
	ExecuteIf,
	While,
	Getc,
	Putc,
	PrintInt,
}

type ValueAst =
	| { type: AstType.Variable, value: string }
	| { type: AstType.String, value: string }
	| { type: AstType.Integer, value: number }
	| { type: AstType.Quote, value: AstNode[] }

type NonValueAst = { type: Exclude<AstType, ValueAst['type']>, value: undefined }

export type AstNode = ValueAst | NonValueAst

class Parser {
	#tokenizer: Iterator<Token>
	#currentToken: Token | null = null

	constructor(tokenizer: Iterator<Token>) {
		this.#tokenizer = tokenizer;
		this.#next();
	}

	parseStatements(): AstNode[] {
		const statements: AstNode[] = [];

		const _this = this;
		function instr<const T extends ValueAst>(type: T['type'], value: T['value']): void;
		function instr<const T extends NonValueAst>(type: T['type']): void;
		function instr(type: any, value?: any): void {
			statements.push({ type, value });
			_this.#next();
		}

		loop:
		while (this.#currentToken) {
			switch (this.#currentToken.type) {
				case TokenType.Variable: instr(AstType.Variable, this.#currentToken.value); break;
				case TokenType.String: instr(AstType.String, this.#currentToken.value); break
				case TokenType.Integer: instr(AstType.Integer, this.#currentToken.value); break;
				case TokenType.OpenBracket: this.#next(); instr(AstType.Quote, this.parseStatements()); break;
				case TokenType.CloseBracket: break loop;
				case TokenType.GetVar: instr(AstType.GetVar); break;
				case TokenType.SetVar: instr(AstType.SetVar); break;
				case TokenType.Dup: instr(AstType.Dup); break;
				case TokenType.Discard: instr(AstType.Discard); break;
				case TokenType.Swap: instr(AstType.Swap); break;
				case TokenType.Rotate: instr(AstType.Rotate); break;
				case TokenType.Take: instr(AstType.Take); break;
				case TokenType.Plus: instr(AstType.Plus); break;
				case TokenType.Minus: instr(AstType.Minus); break;
				case TokenType.Mul: instr(AstType.Mul); break;
				case TokenType.Div: instr(AstType.Div); break;
				case TokenType.Negate: instr(AstType.Negate); break;
				case TokenType.BitAnd: instr(AstType.BitAnd); break;
				case TokenType.BitOr: instr(AstType.BitOr); break;
				case TokenType.BitInvert: instr(AstType.BitInvert); break;
				case TokenType.Equal: instr(AstType.Equal); break;
				case TokenType.GreaterThan: instr(AstType.GreaterThan); break;
				case TokenType.Execute: instr(AstType.Execute); break;
				case TokenType.ExecuteIf: instr(AstType.ExecuteIf); break;
				case TokenType.While: instr(AstType.While); break;
				case TokenType.Getc: instr(AstType.Getc); break;
				case TokenType.Putc: instr(AstType.Putc); break;
				case TokenType.PrintInt: instr(AstType.PrintInt); break;
				case TokenType.Flush: this.#next(); break; // no-op
				case TokenType.Asm:
					this.#next();
					// @ts-ignore https://github.com/Microsoft/TypeScript/issues/9998
					if (this.#currentToken.type === TokenType.Integer) {
						this.#next();
						throw new Error(`Assembly is not supported`);
					}
					else {
						throw new Error(`Syntax error: Expected a short`);
					}
			}
		}

		return statements;
	}

	#next() {
		const { value, done } = this.#tokenizer.next();
		this.#currentToken = done ? null : value;
	}
}

export function parse(source: string) {
	const tokenizer = new Tokenizer(source);
	const parser = new Parser(tokenizer);
	return parser.parseStatements();
}
tokenizer.ts ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
export enum TokenType {
	Variable,
	String,
	Integer, // Including chars such as 'A
	OpenBracket,
	CloseBracket,
	GetVar,
	SetVar,
	Dup,
	Discard,
	Swap,
	Rotate,
	Take,
	Plus,
	Minus,
	Mul,
	Div,
	Negate,
	BitAnd,
	BitOr,
	BitInvert,
	Equal,
	GreaterThan,
	Execute,
	ExecuteIf,
	While,
	Getc,
	Putc,
	PrintInt,
	Flush,
	Asm,
}

type ValueToken =
	| { type: TokenType.Variable, value: string }
	| { type: TokenType.String, value: string }
	| { type: TokenType.Integer, value: number }

type NonValueToken = { type: Exclude<TokenType, ValueToken['type']> }

export type Token = ValueToken | NonValueToken

export class Tokenizer implements Iterable<Token>, Iterator<Token, null>{
	static readonly symbols: ReadonlyMap<string, NonValueToken> =
		new Map<string, NonValueToken>(([
			['[', TokenType.OpenBracket],
			[']', TokenType.CloseBracket],
			[';', TokenType.GetVar],
			[':', TokenType.SetVar],
			['$', TokenType.Dup],
			['%', TokenType.Discard],
			['\\', TokenType.Swap],
			['@', TokenType.Rotate],
			['O', TokenType.Take],
			['+', TokenType.Plus],
			['-', TokenType.Minus],
			['*', TokenType.Mul],
			['/', TokenType.Div],
			['_', TokenType.Negate],
			['&', TokenType.BitAnd],
			['|', TokenType.BitOr],
			['~', TokenType.BitInvert],
			['=', TokenType.Equal],
			['>', TokenType.GreaterThan],
			['!', TokenType.Execute],
			['?', TokenType.ExecuteIf],
			['#', TokenType.While],
			['^', TokenType.Getc],
			[',', TokenType.Putc],
			['.', TokenType.PrintInt],
			['B', TokenType.Flush],
			['`', TokenType.Asm],
		] as const).map(([sym, type]) => [sym, { type }]))

	#source: string;
	#pos: number;

	get #currentChar(): string { return this.#source[this.#pos]; }

	constructor(source: string) {
		this.#source = source;
		this.#pos = 0;
	}

	[Symbol.iterator](): Tokenizer { return this; }

	next(): IteratorResult<Token, null> {
		while (this.#pos < this.#source.length) {
			if (/\s/.test(this.#currentChar)) { ++this.#pos; continue; }
			if (this.#currentChar === '{') { this.#skipComment(); continue; }

			if (this.#currentChar === '\'') { return { value: this.#nextChar() }; }
			if (this.#currentChar === '"') { return { value: this.#nextString() }; }
			if ('0' <= this.#currentChar && this.#currentChar <= '9') { return { value: this.#nextNumber() }; }
			if ('a' <= this.#currentChar && this.#currentChar <= 'z') { return { value: this.#nextVariable() }; }

			const sym = Tokenizer.symbols.get(this.#currentChar);
			if (sym) {
				++this.#pos;
				return { value: sym };
			}

			throw new Error(`Invalid character: ${this.#currentChar}`);
		}
		return { value: null, done: true };
	}

	#nextVariable(): Token {
		const variable = this.#currentChar;
		++this.#pos;
		return {
			type: TokenType.Variable,
			value: variable
		};
	}

	#skipComment(): void {
		while (this.#pos < this.#source.length && this.#currentChar !== '}') {
			++this.#pos;
		}
		this.#eat('}', "Unclosed comment");
	}

	#nextNumber(): Token {
		const start = this.#pos;
		while ('0' <= this.#currentChar && this.#currentChar <= '9') {
			++this.#pos;
		}
		return {
			type: TokenType.Integer,
			value: parseInt(this.#source.substring(start, this.#pos))
		};
	}

	#nextChar(): Token {
		this.#eat('\'');
		if (this.#currentChar) {
			const value = this.#currentChar.charCodeAt(0);
			++this.#pos;
			return { type: TokenType.Integer, value };
		}
		else {
			throw new Error(`Expected a character`);
		}
	}

	#nextString(): Token {
		this.#eat('"');
		const start = this.#pos;
		while (this.#pos < this.#source.length && this.#currentChar !== '"') {
			++this.#pos;
		}
		const result = this.#source.substring(start, this.#pos);
		this.#eat('"');

		return {
			type: TokenType.String,
			value: result
		};
	}

	#eat(char: string, errorMessage?: string): void {
		if (this.#currentChar === char) {
			++this.#pos;
		}
		else {
			throw new Error(errorMessage ?? `Expected ${char}, got ${this.#currentChar} instead`);
		}
	}
}

round #38

submitted at
0 likes

guesses
comments 0

post a comment


calc.js ASCII text, with no line terminators
1
entry=s=>{while(s!=(s=s.replace(/-?[1-9]+[-+*/]-?[1-9]+/g,eval).replace(/ ( *)/g,(_,x)=>x)));return s;}

round #37

submitted at
1 like

guesses
comments 0

post a comment


entry.c Unicode text, UTF-8 text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
// Any language can be used, it said
// Tôi đã sử dụng google dịch cho tất cả những điều này vì vậy nó có thể sai tất
// cả និយាយតាមត្រង់ ខ្ញុំភ្លេចថាខ្ញុំប្រើប៉ុន្មានភាសា

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

// Мы определяем следующие макросы

# define ਜੇਕਰ if
# define kol while
# define para for
# define hāʻawi return
# define Ganzzahl int
# define 字 char
# define αμετάβλητο const
# define מצביע *
# define dimensione sizeof
# define 主 main

Ganzzahl entry(Ganzzahl מצביע senarai_bilangan, Ganzzahl bilangan_bilangan, Ganzzahl );

// program <radix> <nums...>
Ganzzahl (Ganzzahl パラメター数,  αμετάβλητο מצביע מצביע パラメター) {
  Ganzzahl radix = atoi(パラメター[1]);
  Ganzzahl bilangan_bilangan = パラメター数 - 2;
  Ganzzahl מצביע nombres = malloc(bilangan_bilangan * dimensione());

  para(Ganzzahl i = 0; i < bilangan_bilangan; ++i) nombres[i] = atoi(パラメター[i + 2]);

  printf("%d", entry(nombres, bilangan_bilangan, radix));

  free(nombres);
  hāʻawi 0;
}

Ganzzahl entry(Ganzzahl מצביע senarai_bilangan, Ganzzahl bilangan_bilangan, Ganzzahl ) {
  ਕਰ(bilangan_bilangan == 1) { hāʻawi senarai_bilangan[0]; }

  Ganzzahl tapeke = 0;
  para(Ganzzahl i = 0; i < bilangan_bilangan; ++i) { tapeke += senarai_bilangan[i]; }

  Ganzzahl bilangan_bilangan_seterusnya = 0;
  kol(tapeke > 0) {
    senarai_bilangan[bilangan_bilangan_seterusnya] = tapeke % ;
    tapeke /= ;
    ++bilangan_bilangan_seterusnya;
  }

  para(Ganzzahl i = 0; i < bilangan_bilangan_seterusnya / 2; ++i) {
    Ganzzahl tmp = senarai_bilangan[i];
    senarai_bilangan[i] = senarai_bilangan[bilangan_bilangan_seterusnya - 1 - i];
    senarai_bilangan[bilangan_bilangan_seterusnya - 1 - i] = tmp;
  }

  hāʻawi entry(senarai_bilangan, bilangan_bilangan_seterusnya, );
}

round #34

submitted at
5 likes

guesses
comments 0

post a comment


main.rs ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
/*
Copyright (C) 2023
                   GNU GENERAL PUBLIC LICENSE
                       Version 3, 29 June 2007

 Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
 Everyone is permitted to copy and distribute verbatim copies
 of this license document, but changing it is not allowed.

                            Preamble

  The GNU General Public License is a free, copyleft license for
software and other kinds of works.

  The licenses for most software and other practical works are designed
to take away your freedom to share and change the works.  By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users.  We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors.  You can apply it to
your programs, too.

  When we speak of free software, we are referring to freedom, not
price.  Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.

  To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights.  Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.

  For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received.  You must make sure that they, too, receive
or can get the source code.  And you must show them these terms so they
know their rights.

  Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.

  For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software.  For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.

  Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so.  This is fundamentally incompatible with the aim of
protecting users' freedom to change the software.  The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable.  Therefore, we
have designed this version of the GPL to prohibit the practice for those
products.  If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.

  Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary.  To prevent this, the GPL assures that
patents cannot be used to render the program non-free.

  The precise terms and conditions for copying, distribution and
modification follow.

                       TERMS AND CONDITIONS

  0. Definitions.

  "This License" refers to version 3 of the GNU General Public License.

  "Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.

  "The Program" refers to any copyrightable work licensed under this
License.  Each licensee is addressed as "you".  "Licensees" and
"recipients" may be individuals or organizations.

  To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy.  The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.

  A "covered work" means either the unmodified Program or a work based
on the Program.

  To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy.  Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.

  To "convey" a work means any kind of propagation that enables other
parties to make or receive copies.  Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.

  An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License.  If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.

  1. Source Code.

  The "source code" for a work means the preferred form of the work
for making modifications to it.  "Object code" means any non-source
form of a work.

  A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.

  The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form.  A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.

  The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities.  However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work.  For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.

  The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.

  The Corresponding Source for a work in source code form is that
same work.

  2. Basic Permissions.

  All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met.  This License explicitly affirms your unlimited
permission to run the unmodified Program.  The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work.  This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.

  You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force.  You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright.  Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.

  Conveying under any other circumstances is permitted solely under
the conditions stated below.  Sublicensing is not allowed; section 10
makes it unnecessary.

  3. Protecting Users' Legal Rights From Anti-Circumvention Law.

  No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.

  When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.

  4. Conveying Verbatim Copies.

  You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.

  You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.

  5. Conveying Modified Source Versions.

  You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:

    a) The work must carry prominent notices stating that you modified
    it, and giving a relevant date.

    b) The work must carry prominent notices stating that it is
    released under this License and any conditions added under section
    7.  This requirement modifies the requirement in section 4 to
    "keep intact all notices".

    c) You must license the entire work, as a whole, under this
    License to anyone who comes into possession of a copy.  This
    License will therefore apply, along with any applicable section 7
    additional terms, to the whole of the work, and all its parts,
    regardless of how they are packaged.  This License gives no
    permission to license the work in any other way, but it does not
    invalidate such permission if you have separately received it.

    d) If the work has interactive user interfaces, each must display
    Appropriate Legal Notices; however, if the Program has interactive
    interfaces that do not display Appropriate Legal Notices, your
    work need not make them do so.

  A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit.  Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.

  6. Conveying Non-Source Forms.

  You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:

    a) Convey the object code in, or embodied in, a physical product
    (including a physical distribution medium), accompanied by the
    Corresponding Source fixed on a durable physical medium
    customarily used for software interchange.

    b) Convey the object code in, or embodied in, a physical product
    (including a physical distribution medium), accompanied by a
    written offer, valid for at least three years and valid for as
    long as you offer spare parts or customer support for that product
    model, to give anyone who possesses the object code either (1) a
    copy of the Corresponding Source for all the software in the
    product that is covered by this License, on a durable physical
    medium customarily used for software interchange, for a price no
    more than your reasonable cost of physically performing this
    conveying of source, or (2) access to copy the
    Corresponding Source from a network server at no charge.

    c) Convey individual copies of the object code with a copy of the
    written offer to provide the Corresponding Source.  This
    alternative is allowed only occasionally and noncommercially, and
    only if you received the object code with such an offer, in accord
    with subsection 6b.

    d) Convey the object code by offering access from a designated
    place (gratis or for a charge), and offer equivalent access to the
    Corresponding Source in the same way through the same place at no
    further charge.  You need not require recipients to copy the
    Corresponding Source along with the object code.  If the place to
    copy the object code is a network server, the Corresponding Source
    may be on a different server (operated by you or a third party)
    that supports equivalent copying facilities, provided you maintain
    clear directions next to the object code saying where to find the
    Corresponding Source.  Regardless of what server hosts the
    Corresponding Source, you remain obligated to ensure that it is
    available for as long as needed to satisfy these requirements.

    e) Convey the object code using peer-to-peer transmission, provided
    you inform other peers where the object code and Corresponding
    Source of the work are being offered to the general public at no
    charge under subsection 6d.

  A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.

  A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling.  In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage.  For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product.  A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.

  "Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source.  The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.

  If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information.  But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).

  The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed.  Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.

  Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.

  7. Additional Terms.

  "Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law.  If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.

  When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it.  (Additional permissions may be written to require their own
removal in certain cases when you modify the work.)  You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.

  Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:

    a) Disclaiming warranty or limiting liability differently from the
    terms of sections 15 and 16 of this License; or

    b) Requiring preservation of specified reasonable legal notices or
    author attributions in that material or in the Appropriate Legal
    Notices displayed by works containing it; or

    c) Prohibiting misrepresentation of the origin of that material, or
    requiring that modified versions of such material be marked in
    reasonable ways as different from the original version; or

    d) Limiting the use for publicity purposes of names of licensors or
    authors of the material; or

    e) Declining to grant rights under trademark law for use of some
    trade names, trademarks, or service marks; or

    f) Requiring indemnification of licensors and authors of that
    material by anyone who conveys the material (or modified versions of
    it) with contractual assumptions of liability to the recipient, for
    any liability that these contractual assumptions directly impose on
    those licensors and authors.

  All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10.  If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term.  If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.

  If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.

  Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.

  8. Termination.

  You may not propagate or modify a covered work except as expressly
provided under this License.  Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).

  However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.

  Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.

  Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License.  If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.

  9. Acceptance Not Required for Having Copies.

  You are not required to accept this License in order to receive or
run a copy of the Program.  Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance.  However,
nothing other than this License grants you permission to propagate or
modify any covered work.  These actions infringe copyright if you do
not accept this License.  Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.

  10. Automatic Licensing of Downstream Recipients.

  Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License.  You are not responsible
for enforcing compliance by third parties with this License.

  An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations.  If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.

  You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License.  For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.

  11. Patents.

  A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based.  The
work thus licensed is called the contributor's "contributor version".

  A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version.  For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.

  Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.

  In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement).  To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.

  If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients.  "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.

  If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.

  A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License.  You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.

  Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.

  12. No Surrender of Others' Freedom.

  If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License.  If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all.  For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.

  13. Use with the GNU Affero General Public License.

  Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work.  The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.

  14. Revised Versions of this License.

  The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time.  Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.

  Each version is given a distinguishing version number.  If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation.  If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.

  If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.

  Later license versions may give you additional or different
permissions.  However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.

  15. Disclaimer of Warranty.

  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.

  16. Limitation of Liability.

  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.

  17. Interpretation of Sections 15 and 16.

  If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.

                     END OF TERMS AND CONDITIONS

            How to Apply These Terms to Your New Programs

  If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.

  To do so, attach the following notices to the program.  It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.

    <one line to give the program's name and a brief idea of what it does.>
    Copyright (C) <year>  <name of author>

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <https://www.gnu.org/licenses/>.

Also add information on how to contact you by electronic and paper mail.

  If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:

    <program>  Copyright (C) <year>  <name of author>
    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
    This is free software, and you are welcome to redistribute it
    under certain conditions; type `show c' for details.

The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License.  Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".

  You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<https://www.gnu.org/licenses/>.

  The GNU General Public License does not permit incorporating your program
into proprietary programs.  If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library.  If this is what you want to do, use the GNU Lesser General
Public License instead of this License.  But first, please read
<https://www.gnu.org/licenses/why-not-lgpl.html>.
 */

use std::ops::Rem;

trait ZZ<const MODULUS: u128> {
    fn zz(self) -> Option<()>;
}

impl<T, const MODULUS: u128> ZZ<MODULUS> for T
where
    T: Rem<u128>,
    T::Output: PartialEq<u128>,
{
    fn zz(self) -> Option<()> {
        if self % MODULUS == 0 {
            Some(())
        } else {
            None
        }
    }
}

fn main() {
    (1..=100)
        .map(|i| {
            ZZ::<15>::zz(i)
                .and(Some(Box::new(|| println!("FizzBuzz")) as Box::<dyn Fn()>))
                .or(ZZ::<3>::zz(i).and(Some(Box::new(|| println!("Fizz")))))
                .or(ZZ::<5>::zz(i).and(Some(Box::new(|| println!("Buzz")))))
                .unwrap_or(Box::new(move || println!("{}", i)))
        })
        .for_each(|x| x());
}

round #33

submitted at
1 like

guesses
comments 0

post a comment


abcout.c ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/**
 * Usage: abcout <file> [no. cells printed] [no. cells printed in debug]
 */

#define __STDC_WANT_LIB_EXT1__ 1

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

uint8_t const HALT_CONDITION[] = {0x00, 0x00, 0x00, 0x00, 0x7F, 0xFF};

int run(FILE *file, uint16_t result_limit, uint16_t debug_limit) {
  uint8_t cells[UINT16_MAX] = {0, 1};
  uint8_t instr[6];

  while (true) {
    size_t const read_bytes = fread(instr, sizeof(*instr), 6, file);
    if (read_bytes == 0) {
      break;
    }

    if (read_bytes != 6) {
      fprintf(stderr, "Misaligned ROM\n");
      return 1;
    }

    if (memcmp(HALT_CONDITION, instr, 6) == 0) {
      if (debug_limit) {
        printf("\n\tHALT\n");
      }
      break;
    }

    uint16_t const a = instr[0] * 256 + instr[1];
    uint16_t const b = instr[2] * 256 + instr[3];
    uint16_t const c = instr[4] * 256 + instr[5];

    cells[a] += cells[b];

    if (cells[a] < cells[b])
      fseek(file, c, SEEK_SET);

    if (debug_limit) {
      printf("\n\t%d %d %d\n", a, b, c);
      for (long i = 0; i != debug_limit; ++i)
        printf("%.2x ", cells[i]);
      putchar('\n');
    }
  }

  for (long i = 0; i != result_limit; ++i)
    printf("%.2x ", cells[i]);
  putchar('\n');

  return 0;
}

int main(int argc, char const **argv) {
  if (argc < 2) {
    fprintf(stderr, "Usage: abcout <file>");
    return 1;
  }

  char const *file_name = argv[1];
  uint16_t result_limit = 100;
  uint16_t debug_limit = 0;

  if (argc > 2)
    result_limit = atoi(argv[2]);

  if (argc > 3)
    debug_limit = atoi(argv[3]);

  FILE *file;
  if (fopen_s(&file, file_name, "rb")) {
    printf("Couldn't open %s\n", file_name);
    return 1;
  }
  printf("Running %s (showing first %d cells)\n", file_name, result_limit);
  run(file, result_limit, debug_limit);
  fclose(file);
}

round #30

submitted at
0 likes

guesses
comments 0

post a comment


entry.ndf ASCII text
1
2
3
4
5
6
7
% Pointfree implementation ;
entry IS fork [
    0 = tally first, tally second,
    0 = tally second, tally first,
    match EACH first, entry EACH rest,
    1 + min EACH entry [[first, rest second], [rest first, second], [rest first, rest second]]
];

round #27

submitted at
0 likes

guesses
comments 0

post a comment


entry.c ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <inttypes.h>

#define FLOOD for (size_t i = 0; i < w; ++i) {
#define FILL for (size_t j = 0; j < h; ++j) {
#define DRAIN }
#define DOWNPOUR while (rain(m, w, h));
#define M(i) m[(i)*h + j]

enum { W, A, G };

int rain(char *m, size_t w, size_t h) {
  int d = 0;
  FLOOD
  FILL int l = i > 0 && M(i - 1) != A;
  int r = i < w - 1 && M(i + 1) != A;
  if (M(i) == W && !(l && r)) { M(i) = A; d = 1; }
  DRAIN
  DRAIN
  return d;
}

unsigned entry(unsigned *const t, size_t w) {
  unsigned h = 0;
  FLOOD
  h ^= (h < t[i]) * (t[i] ^ h);
  DRAIN
  char m[w * h];
  FLOOD
  FILL M(i) = j < t[i] ? G : W;
  DRAIN
  DRAIN
  DOWNPOUR
  int c = 0;
  FLOOD
  FILL c += M(i) == W;
  DRAIN
  DRAIN
  return c;
}

#undef FLOOD
#undef FILL
#undef DRAIN
#undef DOWNPOUR
#undef M

round #26

submitted at
1 like

guesses
comments 0

post a comment


Entry.hs ASCII text, with CRLF line terminators
1
2
3
4
5
6
7
module Entry where

import Data.Foldable (maximumBy)
import Data.Function (on)

entry :: String -> String -> String
entry a b | a == "" || b == "" = "" | otherwise = maximumBy (compare `on` length)  [map fst $ takeWhile (uncurry (==)) $ zip a b, entry (tail a) b, entry a (tail b)]

round #25

submitted at
0 likes

guesses
comments 0

post a comment


entry.py ASCII text, with CRLF line terminators
1
entry = lambda m, a, b: (f := lambda m, q, b: q[:-1] if (c := q[-2] if len(q) > 1 else a) == b else x if m[c][i := q.pop()] and i not in q and (x := f(m, q + [i, 0], b)) is not None else f(m, q + [i + 1], b) if i + 1 < len(m) else None)(m, [0], b)

round #23

submitted at
0 likes

guesses
comments 1
razetime

olus? I can only think that olus would write so much C code willingly


post a comment


main.c ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>

#include "polydivide.h"

// Prints a double array terminated by INFINITY
void print_array(double const *a) {
  putchar('{');
  for (; !isinf(*a); ++a) { printf(" %.2f", *a); }
  printf(" }");
}

// Compares using Total Squared Error; passes if error < tolerance
bool test(double const *a, double const *b, double const *expected_q,
          double const *expected_r, double const tolerance) {

  printf("\nTEST: a = ");
  print_array(a);

  printf(", b = ");
  print_array(b);
  putchar('\n');

  double *r;
  double *q = entry(a, b, &r);

  bool success = true;

  double error = 0;
  for (double const *qi = q, *eqi = expected_q; !isinf(*eqi); ++qi, ++eqi) {
    double const residual = *qi - *eqi;
    error += residual * residual;
  }
  if (error < tolerance) {
    printf("Q SUCCESS (error: %f): Q = ", error);
    print_array(q);
    putchar('\n');
  } else {
    printf("Q FAILED (error: %f): \n  EXPECTED: ", error);
    print_array(expected_q);
    printf("\n  GOT: ");
    print_array(q);
    putchar('\n');
    success = false;
  }

  error = 0;
  for (double const *ri = r, *eri = expected_r; !isinf(*eri); ++ri, ++eri) {
    error += (*ri - *eri) * (*ri - *eri);
  }
  if (error < tolerance) {
    printf("R SUCCESS (error: %f): R = ", error);
    print_array(r);
    putchar('\n');
  } else {
    printf("R FAILED (error: %f): \n  EXPECTED: ", error);
    print_array(expected_r);
    printf("\n  GOT: ");
    print_array(r);
    putchar('\n');
    success = false;
  }

  free(r);
  free(q);

  return success;
}

struct test_case {
  double const *a;
  double const *b;
  double const *expected_q;
  double const *expected_r;
};

int main(int argc, char const *argv[]) {
  double const tolerance = .000000001;

  struct test_case const test_suite[] = {
      // Basic tests
      {(double const[]){-42, 0, -12, 1, INFINITY},
       (double const[]){-3, 1, INFINITY},
       (double const[]){-27, -9, 1, INFINITY},
       (double const[]){-123, INFINITY}},

      {(double const[]){-21, -5, 4, INFINITY},
       (double const[]){-3, 1, INFINITY}, (double const[]){7, 4, INFINITY},
       (double const[]){0, INFINITY}},

      {(double const[]){12, 30, 40, INFINITY},
       (double const[]){1, 3, 4, INFINITY}, (double const[]){10, INFINITY},
       (double const[]){2, 0, INFINITY}},

      // Testing a case where the remainder isn't degree 0
      {(double const[]){-13, 2, -9, 0, 4, 2, INFINITY},
       (double const[]){1, -2, 1, INFINITY},
       (double const[]){11, 14, 8, 2, INFINITY},
       (double const[]){-24, 10, INFINITY}},

      // Testing a case that actually gives fractions
      {(double const[]){0, 0, 0, 1, INFINITY},
       (double const[]){1, -2, 3, INFINITY},
       (double const[]){2.0 / 9.0, 1.0 / 3.0, INFINITY},
       (double const[]){-2.0 / 9.0, 1.0 / 9.0, INFINITY}},

      // Testing a numerator with a lower degree than the denominator
      {(double const[]){1, 2, INFINITY},
       (double const[]){-3, 1, 2, 1, INFINITY}, (double const[]){INFINITY},
       (double const[]){1, INFINITY}},

      // Testing empty numerator
      {(double const[]){INFINITY}, (double const[]){-3, 1, INFINITY},
       (double const[]){INFINITY}, (double const[]){INFINITY}}};

  int const num_tests = sizeof test_suite / sizeof *test_suite;
  int num_success = 0;

  for (int test_index = 0; test_index < num_tests; ++test_index) {
    struct test_case const test_case = test_suite[test_index];

    num_success += test(test_case.a, test_case.b, test_case.expected_q,
                        test_case.expected_r, tolerance);
  }

  printf("\n%d of %d tests passed\n", num_success, num_tests);

  return 0;
}
polydivide.h ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#ifndef POLYDIVIDE_H
#define POLYDIVIDE_H

#include <math.h>
#include <stdlib.h>
#include <string.h>

// Takes two polynomials a, b, ordered in order of increasing power, terminated
// by INFINITY and a pointer to a pre-allocated remainder polynomial r.
// Allocates memory to q and r
double *entry(double const *a, double const *b, double **r) {
  // We first need to find the end of the polynomial
  // This is because polynomial division starts at the highest power
  // This also lets us compute the length of the polynomials,
  // important because we to compute the length of the quotient
  // to allocate memory for it.
  double const *a_end = a, *b_end = b;

  while (!isinf(*a_end)) { ++a_end; }
  while (!isinf(*b_end)) { ++b_end; }

  // The number of coeffients (excludes INFINITY terminator)
  // This is one more than the degree of the polynomial
  size_t const a_len = a_end - a;
  size_t const b_len = b_end - b;

  // Handle the numerator having lower degree than denominator
  if (a_len < b_len) {
    double *const q = malloc(1 * sizeof *q);
    *q = INFINITY;

    // Just create a copy of the numerator as the remainder
    *r = malloc((a_len + 1) * sizeof **r);
    memcpy(*r, a, (a_len + 1) * sizeof **r);

    return q;
  }

  size_t const q_len = a_len - b_len + 1;

  double *const q = malloc((q_len + 1) * sizeof *q);
  double *q_end = q + q_len;

  // Terminate the quotient polynomial
  *q_end = INFINITY;
  --q_end;

  // Move back to the coefficient before INFINITY
  --a_end;
  --b_end;

  // temporary values for computation
  double *temps = malloc(b_len * sizeof *temps);
  double *const temps_end = temps + b_len - 1;
  memcpy(temps, a_end - b_len + 1, b_len * sizeof *temps);

  // a_end - a + 1 = number of coefficients left in a
  while (a_end - a + 1 >= b_len) {
    double const a_lead = *temps_end;
    double const b_lead = *b_end;

    double const lead_factor = a_lead / b_lead;

    *q_end = lead_factor;

    // Recalculate temporaries
    // Basically subtracting b * lead_factor from temps,
    // shifting over by one,
    // and then getting the next coefficient from a
    double *tptr;
    double const *bptr;
    for (tptr = temps_end, bptr = b_end; tptr != temps; --tptr, --bptr) {
      *tptr = *(tptr - 1) - lead_factor * *(bptr - 1);
    }

    // Last iteration
    // Since it's the last iteration, there are no more coefficients in a
    if (a_end - a + 1 == b_len) {
      break;
    }

    *temps = *(a_end - b_len);

    --a_end;
    --q_end;
  }

  // Temps now basically contains the remainder, just needs some touching up
  // meaning shifting it over by one and adding the INFINITY terminator
  memmove(temps, temps + 1, (b_len - 1) * sizeof *temps);
  *temps_end = INFINITY;

  *r = temps;
  return q;
}

#endif

round #21

submitted at
1 like

guesses
comments 0

post a comment


floodfill.py ASCII text, with CRLF line terminators
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
def str_to_grid(g: str):
    return [*map(lambda l: [*map(lambda c: c == '#', l)], g.split('\n'))]

def fill_coord(g: str):
    return 

def grid_to_str(g: list[list[bool]]):
    return '\n'.join(map(lambda r: ''.join('#' if b else '.' for b in r), g))

def entry(grid: list[list[bool]], x: int, y: int):
    # Basic flood-fill algorithm;
    # if the cell is filled, add its adjacent cells to the to-be-filled list
    # repeat until no more cells are to be filled.

    queue = [(y, x)] # stored in row-major order

    while queue:
        (row, col) = queue.pop(0)
        if (0 <= row < len(grid)
        and 0 <= col < len(grid[row])
        and not grid[row][col]):
            grid[row][col] = True
            queue.append((row + 1, col))
            queue.append((row - 1, col))
            queue.append((row, col + 1))
            queue.append((row, col - 1))

    return grid

round #17

submitted at
5 likes

guesses
comments 0

post a comment


primality.py New Line Delimited JSON text data
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
[0][0]#{ FALSE Polyglot because why not (Tested on TIO)
# All the [0][0]#{ are to create comments in FALSE
import sys

code = r'''
{ Get integer from stdin }
0^[$1_>]['0-\10*+^]#%
{ Store in a }
a:
{ Flag for primality }
a;1=b:
{ Loop from a to 2, if divisible then set flag }
a;[1-$1>][$$a;\/*a;=b;|b:]#
%
{ Print result (add one; -1 (not prime) => 0; 0 (prime) => 1) }
1b;+.
''' 
[0][0]#{

class Interpreter:
    class Variable:
        def __init__(self, name):
            self.name = name
    class Lambda:
        def __init__(self, code):
            self.code = code

    def __init__(self, code, vars = None, stack = None):
        self.code = code
        self.pos = 0

        self.vars = vars or dict()
        self.stack = stack or list()

        self.input = sys.stdin
        self.output = sys.stdout

    def set_input(self, inp):
        self.input = inp

    def set_output(self, out):
        self.output = out

    def run(self):
        while True:
            self.skip_whitespace()
            if self.current_char() == None:
                return
            elif self.current_char() == '{':
                self.skip_comment()
            elif self.current_char() == '\'':
                self.advance()
                self.stack.append(ord(self.current_char()))
                self.advance()
            elif self.current_char() == '$':
                self.stack.append(self.stack[-1])
                self.advance()
            elif self.current_char() == '%':
                self.stack.pop()
                self.advance()
            elif self.current_char() == '\\':
                self.swap()
                self.advance()
            elif self.current_char() == '@':
                self.rotate()
                self.advance()
            elif self.current_char() == 'ø':
                self.pick()
                self.advance()
            elif self.current_char() == '+':
                self.stack.append(self.stack.pop() + self.stack.pop())
                self.advance()
            elif self.current_char() == '-':
                a = self.stack.pop()
                self.stack.append(self.stack.pop() - a)
                self.advance()
            elif self.current_char() == '*':
                self.stack.append(self.stack.pop() * self.stack.pop())
                self.advance()
            elif self.current_char() == '/':
                q = self.stack.pop()
                self.stack.append(self.stack.pop() // q)
                self.advance()
            elif self.current_char() == '_':
                self.stack.append(-self.stack.pop())
                self.advance()
            elif self.current_char() == '&':            
                self.stack.append(self.stack.pop() & self.stack.pop()) 
                self.advance()
            elif self.current_char() == '|':            
                self.stack.append(self.stack.pop() | self.stack.pop()) 
                self.advance()
            elif self.current_char() == '~':            
                self.stack.append(~self.stack.pop())
                self.advance()
            elif self.current_char() == '>':         
                b = self.stack.pop()
                self.stack.append(-1 if self.stack.pop() > b else 0) 
                self.advance()
            elif self.current_char() == '=':         
                b = self.stack.pop()
                self.stack.append(-1 if self.stack.pop() == b else 0) 
                self.advance()
            elif self.current_char() == '[':         
                self.push_lambda()
            elif self.current_char() == '#':
                self.advance()
                self.while_loop()
            elif self.current_char().isdigit():
                self.push_num()
            elif self.current_char().isalpha():
                self.stack.append(__class__.Variable(self.current_char()))
                self.advance()
            elif self.current_char() == ':':
                var = self.stack.pop()
                self.vars[var.name] = self.stack.pop()
                self.advance()
            elif self.current_char() == ';':
                var = self.stack.pop()
                self.stack.append(self.vars[var.name])
                self.advance()
            elif self.current_char() == '^':
                ch = self.input.read(1)
                self.stack.append(ord(ch) if ch else -1)
                self.advance()
            elif self.current_char() == '.':
                self.output.write(str(self.stack.pop()))
                self.advance()
            else:
                raise Exception("Invalid character " + self.current_char())
    def push_lambda(self):
        self.advance()
        res = ''
        while self.current_char() != ']':
            res += self.current_char()
            self.advance()
        self.advance()
        self.stack.append(__class__.Lambda(res))

    def run_lambda(self, l):
        lambda_runner = Interpreter(l.code, self.vars, self.stack)
        lambda_runner.set_input(self.input)
        lambda_runner.set_output(self.output)
        lambda_runner.run()

    def while_loop(self):
        body = self.stack.pop()
        cond = self.stack.pop()
        while True:
            self.run_lambda(cond)
            if self.stack.pop() == 0:
                break
            else:
                self.run_lambda(body)

    def pick(self):
        i = self.stack.pop() + 1
        val = self.stack.pop(-i)
        self.stack.append(val)
    def rotate(self):
        a = self.stack.pop(0)
        self.stack.append(a)

    def swap(self):
        a = self.stack.pop()
        b = self.stack.pop()
        self.stack.append(a)
        self.stack.append(b)

    def push_num(self):
        res = 0

        while self.current_char() and self.current_char().isdigit():
            res = res * 10 + int(self.current_char())
            self.advance()

        self.stack.append(res)

    def skip_whitespace(self):
        while self.current_char() and self.current_char().isspace():
            self.advance()

    def skip_comment(self):
        while self.current_char() != '}':
            [0][0]#{
            self.advance()
        self.advance()

    def current_char(self):
        try:
            return self.code[self.pos]
        except:
            return None

    def advance(self):
        self.pos += 1

from io import StringIO

def entry(n):
    interpreter = Interpreter(code)
    inp = StringIO(str(n))
    out = StringIO()
    interpreter.set_input(inp)
    interpreter.set_output(out)
    interpreter.run()
    return out.getvalue() == '1'

[0][0]# If you're reading this you're a cool person :) }