Be aware that malicious scripts can steal your account.
| import numpy | |
| from numpy.linalg import norm | |
| import math | |
| earth_radius = 6.3781e6 | |
| gravity = 9.81 | |
| def lla2cart(lat, long, alt=earth_radius): | |
| lat, long = math.radians(lat), math.radians(long) | |
| x = math.cos(long) * math.cos(lat) |
| input: output: | |
| ┏━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━┓ ┏━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━┓ | |
| ┃▓▓▓▓▓▓▓▓▓ ▓▓ ▓ ▓▓ ▓▓ ▓┃ ┃ ▓▓▓▓ ▓▓ ┃ | |
| ┃ ▓ ▓▓ ▓▓ ▓ ▓▓▓ ▓▓ ▓ ▓ ▓▓▓▓┃ ┃ ▓▓▓▓ ▓▓▓ ▓▓▓ ▓▓ ▓▓ ┃ | |
| ┃▓▓ ▓▓▓ ▓▓▓ ▓ ▓▓▓ ▓▓▓ ▓ ▓ ▓ ┃ ┃ ▓▓▓▓ ▓▓▓ ▓▓▓ ▓▓ ▓▓ ┃ | |
| ┃▓ ▓ ▓▓ ▓▓ ▓ ▓ ▓ ▓ ▓ ▓ ▓ ▓┃ ┃ ▓▓▓ ░░ ▓▓▓▓▓ ┃ | |
| ┃ ▓▓ ▓▓▓▓ ▓▓ ▓ ▓ ▓ ▓▓▓▓▓▓┃ ┃ ▓▓▓▓ ░░ ▓▓▓▓▓▓┃ | |
| ┃ ▓ ▓ ▓ ▓▓ ▓ ▓▓ ▓▓▓▓ ▓ ▓▓ ▓┃ ┃ ▓▓▓▓▓▓ ▓▓▓ ▓▓▓▓▓▓┃ | |
| ┃ ▓▓ ▓▓ ▓▓ ▓ ▓ ▓▓▓ ▓ ▓ ▓┃ ┃ ▓▓▓ ▓▓▓▓▓▓▓▓ ▓▓▓▓▓▓┃ | |
| ┃ ▓ ▓▓▓ ▓▓▓ ▓▓▓▓▓▓▓ ▓ ▓▓ ▓▓ ▓┃ ┃ ▓▓▓ ▓▓▓▓▓▓▓▓ ▓▓▓▓▓▓┃ |
| const char DIGIT_PAIRS[] = | |
| "00" "01" "02" "03" "04" "05" "06" "07" "08" "09" | |
| "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" |
| def genPrimes(n): | |
| found = [] | |
| found_lo = [] | |
| for x in range(2,n+1): | |
| yas = True | |
| for y in found_lo: | |
| if x%y == 0: | |
| yas = False | |
| break | |
| if yas: |
| // ==UserScript== | |
| // @name Sufficient Velocity User Filter | |
| // @version 1.0 | |
| // @description Restyle the page and allow selective ignore of specific threads | |
| // @author Veedrac | |
| // @match https://forums.sufficientvelocity.com/* | |
| // @exclude https://forums.sufficientvelocity.com/watched/threads | |
| // @run-at document-start | |
| // @grant none | |
| // ==/UserScript== |
| #include <stdlib.h> | |
| #include <iostream> | |
| #include <memory> | |
| class Tree { | |
| std::unique_ptr<Tree> left; | |
| std::unique_ptr<Tree> right; | |
| public: | |
| Tree(int depth) { |
| use std::thread; | |
| static NEED: [u8; 21] = [43, 25, 20, 16, 15, 13, 12, 12, 11, 10, 10, 8, 8, 4, 4, 3, 3, 1, 1, 1, 1]; | |
| fn is_ok<F>(pred: F) -> bool | |
| where F: Fn(u8) -> u8 | |
| { | |
| let mut counts = [0; 256]; | |
| for tok in 0..256 { | |
| counts[pred(tok as u8) as usize] += 1; |
| from itertools import combinations, combinations_with_replacement, product | |
| need = 43, 25, 20, 16, 15, 13, 12, 12, 11, 10, 10, 8, 8, 4, 4, 3, 3, 1, 1, 1, 1 | |
| def is_ok(pred): | |
| # This is equivalent to the naïve Counter-based method, but | |
| # optimized to be fast on PyPy. | |
| counts = [0] * 256 | |
| for tok in range(256): |