I hereby claim:
- I am primenumber on github.
- I am primenumber (https://keybase.io/primenumber) on keybase.
- I have a public key whose fingerprint is 3E1F C759 158C C59C 94B5 6293 9E6F 6717 E092 576B
To claim this, I am signing this object:
# encoding: utf-8 | |
require 'json' | |
require 'nkf' | |
require 'unf' | |
def func(name) | |
fx = name.gsub(/♂/u, "オス") | |
fx = fx.gsub(/♀/u, "メス") | |
fx = fx.gsub(/2/u, "ツー") | |
fx = fx.gsub(/Z/u, "ゼット") |
# -*- coding: utf-8 -*- | |
Plugin.create(:tanzaku_filter) do | |
filter_show_filter do |msgs| | |
msgs = msgs.select {|m| | |
/(┏|★)(┷|┻)┓\n(┃[[:print:]]?┃\n)+┗━(┛|★)/.match(m.to_s) == nil | |
} | |
[msgs] | |
end | |
end |
#include "a.hpp" | |
#include <cmath> | |
A::size_type find(const A &lhs, const A &rhs) { | |
if (lhs.n >= rhs.n) return 0; | |
else return A::npos; | |
} | |
A replace(const A &dest, const A &pattern, const A &rep) { | |
A::size_type count = dest.n / pattern.n; |
>>>>>>+++++>+++>++++++>+++>+>+>+>+>+>+>+>+++++>++>+>+>+>+>+>+>+>+>+>+++>++++>++++++>++>++++>+++++++>+++++++>+++++++>+++++++>+++++++>+++>+++>+>+>+>+>+>+>+++++>++>+>+>+>+>+>+>+>+++>++++>++++++>++>+>++>++>+++++>+++>+++++++>++>+++++>+++>+++>+++++++>+++>+>++>++>++>++++>++++++>+++>+++++>++>+>+++>++++>++++++>+++>+++++>++>+>+++>++++>++++++>++>++>++>++++++>+++>+++>+++>+++>+++++>+++>++++++>++>+++++>+++>+>++>++++>+++++>++++>+++++>++++>+++++>++++>+++++>++++>+++++>++++>+++++>+++>+>+>+>+>+++++>++>+>+>+>+>+>+>+>+>+>+++>++++>++++++>++>+++++++>+++++>++++>++++++>++++++>+++>+++++>+>+>+>+>+>+>+>+>+++++>++>+>+>+>+>+>+>+>+>+>+>+++>++++>++++++>++>+>+>+>+++++++>+++++>++++>++++++>+++>++++++>++>++++++>+++>+++++>+>+>+>+>+>+>+>+>+++++>++>+>+>+>+>+>+>+>+>+>+>+++>++++>++++++>++>+>+++++++>+++++>++++>++++++>+++>++++++>++>++++++>+++>+++++>+>+>+>+>+++++>++>+>+>+>+>+>+>+>+>+>+++>++++>++++++>++>+++++++>+++++>++++>++++++>+++>++++++>++>++++++>+++>+++++>+>+>+>+>+>+++++>++>+>+>+>+>+>+>+>+>+>+>+++>++++>++++++>++>+++++++>+++++>++++>++++++>+++>++++++> |
#include <iostream> | |
#include <x86intrin.h> | |
#include <boost/timer/timer.hpp> | |
inline __m128i mm_delta_swap_epi64(__m128i a, __m128i mask, int delta) { | |
__m128i x = _mm_and_si128(_mm_xor_si128(a, _mm_srli_epi64(a, delta)), mask); | |
return _mm_xor_si128(_mm_xor_si128(a, x), _mm_slli_epi64(x, delta)); | |
} | |
inline __m128i mm_unpacklo_epb_unpack_dswap(__m128i a, __m128i b) { |
// author: prime (prime@kmc.gr.jp) | |
// License: MIT License | |
#include <iostream> | |
#include <vector> | |
#include <bitset> | |
#include <x86intrin.h> | |
#include <boost/timer/timer.hpp> | |
inline __m256i bsr_256_8_naive(__m256i x); | |
inline __m256i bsr_256_8_cvtfloat(__m256i x); |
// CUDA Othello Solver | |
// License: GPL 3 | |
#include <cstdio> | |
#include <cassert> | |
constexpr int threadsPerBlock = 128; | |
constexpr int simdWidth = 4; | |
constexpr int nodesPerBlock = threadsPerBlock/simdWidth; | |
constexpr int MAX_DEPTH = 10; |
def relu(x): | |
return max(x, 0) | |
def linear1(x, n): | |
return [x, 2.0 * x - 2 ** n] | |
def linear2(x): | |
return x[0] + -1.0 * x[1] | |
def block(x, n): |
I hereby claim:
To claim this, I am signing this object:
12345678 | |
8|________ | |
7|________ | |
6|________ | |
5|___o*___ | |
4|___*o___ | |
3|________ | |
2|________ | |
1|________ | |
12345678| black:2, white:2 |