martian martian0x80

🐲

On vacation

(>_<)

martian0x80 / script.sh

Last active December 24, 2024 14:58

iptables forward port 80

	# enable forwarding for kernel
	#vim /etc/sysctl.conf
	#sudo sysctl --system

	iptables -t nat -A PREROUTING -p tcp --dport 80 -j REDIRECT --to-port xxxx
	apt-get install iptables-persistent

martian0x80 / comentario.css

Last active July 12, 2024 05:29

Comentario css

	@font-face {
	font-family: "Source Sans Pro";
	font-style: normal;
	font-display: swap;
	font-weight: 300;
	src: local("Source Sans Pro Light"), local("SourceSansPro-Light"),
	url([:q
	[.CdnPrefix]]]/en/fonts/source-sans-300-cyrillic-ext.woff2)
	format("woff2");
	unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F,

martian0x80 / partitions.jl

Created October 27, 2022 11:49

Partition function, coin-change problem, generating integer partitions in (anti-)/lexicographic order.

	using DataStructures
	using DSP
	#=
	ZS1 and ZS2 based on ALGORITHMS explained in :
	FAST ALGORITHMS FOR GENERATING
	INTEGER PARTITIONS
	ANTOINE ZOGHBIU and IVAN STOJMENOVIC*
	Bell Northern Research, P.O . Box 35 I I , Station C , Mail Stop 091 ,
	Ottawa, Ontario KIY 4H7, Canada;
	Computer Science Department, SITE, University of Ottawa,

martian0x80 / BerggrensTree.jl

Created October 26, 2022 17:36

Berggrens Tree to generate primitive triples. Some inefficient way to generate millions of triples. :)

	function primitive_triples(depth::Int64, max_sum::Int64 = 0, list::Bool = false)
	#=
	depth : tree depth
	each depth adds 3^i new triples each depth.
	total triples with depth 'd' : ∑_(i=0;d) 3^i

	max_sum : maximum perimeter of the right triangle formed by the triples, breaks if the limit (max_sum) is reached, but includes the last 3 triples one of which exceed the limit.
	0 is the default value, to ignore any restrictions.
	list : return a flat array of the triples
	=#