a a
ὐ a
--- expected HTML
+++ actual HTML
@@ -1,3 +1,2 @@
-<pre><code>a a
-ὐ a
+a a ὐ a
#!/bin/bash | |
# Script by Patrick M. Elsen <[email protected]> | |
# Updates your dedyn.io dynamic DNS, only if your IP address has changed. | |
# Licensed under MIT license. | |
# Uses openDNS IP lookup. Ideally, put this script into a cron job and run hourly. | |
set -euo pipefail | |
# dns credentials | |
dnsuser=yourdedyniousername | |
dnstoken=yourdedyniotoken |
# which APT packages to install | |
# nodejs | |
PACKAGES += nodejs | |
PACKAGES += yarn | |
PACKAGES += npm | |
PACKAGES += nodejs-dev node-gyp | |
# tools (dev) | |
PACKAGES += git |
// file: decrypt.m | |
// "decrypts" a single base64-encoded string from a shitty macos malware. | |
// compile with: clang -o decrypt -framework Foundation decrypt.m | |
#import <Foundation/Foundation.h> | |
#include <stdint.h> | |
int main (int argc, const char * argv[]) { | |
//NSString *string = @"TRYEGVoFAQ0HD1sGCg=="; | |
NSString *string = [NSString stringWithUTF8String: argv[1]]; |
CFLAGS += $(shell pkg-config --cflags glib-2.0) | |
LDFLAGS += $(shell pkg-config --libs glib-2.0) | |
all: task |
#include <range/v3/all.hpp> | |
#include <vector> | |
#include <array> | |
#include <iostream> | |
using std::cout; | |
using std::endl; | |
using namespace ranges; | |
auto is_six = [](int i) -> bool { return i == 6; }; |
template<class InputIt> | |
using value_type = typename std::iterator_traits<InputIt>::value_type; | |
template<class InputIt> | |
using iterator_category = typename std::iterator_traits<InputIt>::iterator_category; | |
template<class InputIt> | |
using difference_type = typename std::iterator_traits<InputIt>::difference_type; | |
template<class InputIt> |
#ifndef C21_H | |
#define C21_H | |
#include <stdbool.h> | |
#include <inttypes.h> | |
typedef int8_t i8; | |
typedef uint8_t u8; | |
typedef int16_t i16; | |
typedef uint16_t u16; |
let factorials max = | |
let rec next_factorial cur = | |
match cur with | |
| 0 -> [1] | |
| _ -> | |
match next_factorial (cur - 1) with | |
| prev :: rest -> cur * prev :: prev :: rest | |
| _ -> [] | |
in | |
next_factorial max |> List.rev |
use std::vec::Vec; | |
pub struct Prime { | |
list: Vec<u64> | |
} | |
impl Prime { | |
pub fn new() -> Self { | |
Prime { | |
list: vec![2, 3] |