user21944

## .gitkeep


## debian.txt
┏━━━━━━━━━━━━━━━┫ [!] Configuring popularity-contest ┣━━━━━━━━━━━━━━━┓
┃ The system may anonymously supply the distribution developers with statistics about the   ┃
┃ most used packages on this system. This information influences decisions such as which    ┃
┃ packages should go on the first distribution CD.                                          ┃
┃                                                                                           ┃
┃ If you choose to participate, the automatic submission script will run once every week,   ┃
┃ sending statistics to the distribution developers. The collected statistics can be viewed ┃
┃ on https://popcon.debian.org/.                                                            ┃
┃                                                                                           ┃
┃ This choice can later be modified by running "dpkg-reconfigure popularity-contest"        ┃

## h e l l o.c
#\
i\
n\
c\
l\
u\
d\
e\
 \
<\

## pfetch-no-palette-newline.diff
diff --git a/pfetch b/pfetch
index 039a898..9d350a1 100755
--- a/pfetch
+++ b/pfetch
@@ -1038,10 +1038,8 @@ get_palette() {
         palette="$palette$e"
     }

-    # Print the palette with a new-line before and afterwards.
-    printf '\n' >&6

## mkmit
#!/bin/bash

mkmit() {
    [[ -e LICENSE ]] && printf "A LICENSE file already exists\n" && return

    cat << EOF > LICENSE
MIT License

Copyright (c) $(date +%Y) $([[ -n $1 ]] && printf "%s " "$@" || whoami)

## middle_square_method_hex.c
#include <stdint.h>
#define DIGITS 4 /* number of bits in a hex digit */
static inline uint64_t hex_digits(uint64_t n);

uint64_t hexmsm_next(uint64_t n)
{
    uint64_t seedlen, sqrlen;
    seedlen = hex_digits(n);
    n *= n;
    sqrlen = hex_digits(n);

## string-factorizer.py
string = [*input()]
for i, char in enumerate(string):
    string[i] = ord(char)

# print(string)

def factorize(n):
    x = 0
    y = 0
    for i in range(2, (n // 2) + 1):

## brainfuck-string-generator.py
string = [*input()]
for i, char in enumerate(string):
    string[i] = ord(char)

# print(string)

def factorize(n):
    x = 0
    y = 0
    for i in range(2, (n // 2) + 1):

## aa ab ac ad ae af ag ah ai aj ak al am an ao ap aq ar as at au av aw ax ay az ba bb bc bd be bf bg bh bi bj bk bl bm bn bo bp bq br bs bt bu bv bw bx by bz ca cb cc cd ce cf cg ch ci cj ck cl cm cn co cp cq cr cs ct cu cv cw cx cy cz da db dc dd de d
#include <stdio.h>
#include <stdlib.h>

int main(void)
{
    unsigned i, j;
    for (i = 0; i < 26; ++i) {
        for (j = 0; j < 26; ++j) printf("%c%c ", i + 97, j + 97);
    }
    putchar('\n');

## Bruh!.b
>>++++++++[<++++++++>-]<++>>++++++++++[<+++++++++++>-]<++++>>++++++++++[<++++++++++++>-]<--->>+++++++++[<+++++++++++>-]<+++++>>+++++[<++++++>-]<+++<<<<<,[>.>.>.>.>.<<<<<,]
	┏━━━━━━━━━━━━━━━┫ [!] Configuring popularity-contest ┣━━━━━━━━━━━━━━━┓
	┃ The system may anonymously supply the distribution developers with statistics about the ┃
	┃ most used packages on this system. This information influences decisions such as which ┃
	┃ packages should go on the first distribution CD. ┃
	┃ ┃
	┃ If you choose to participate, the automatic submission script will run once every week, ┃
	┃ sending statistics to the distribution developers. The collected statistics can be viewed ┃
	┃ on https://popcon.debian.org/. ┃
	┃ ┃
	┃ This choice can later be modified by running "dpkg-reconfigure popularity-contest" ┃
	diff --git a/pfetch b/pfetch
	index 039a898..9d350a1 100755
	--- a/pfetch
	+++ b/pfetch
	@@ -1038,10 +1038,8 @@ get_palette() {
	palette="$palette$e"
	}

	- # Print the palette with a new-line before and afterwards.
	- printf '\n' >&6
	#!/bin/bash

	mkmit() {
	[[ -e LICENSE ]] && printf "A LICENSE file already exists\n" && return

	cat << EOF > LICENSE
	MIT License

	Copyright (c) $(date +%Y) $([[ -n $1 ]] && printf "%s " "$@" \|\| whoami)
	#include <stdint.h>
	#define DIGITS 4 /* number of bits in a hex digit */
	static inline uint64_t hex_digits(uint64_t n);

	uint64_t hexmsm_next(uint64_t n)
	{
	uint64_t seedlen, sqrlen;
	seedlen = hex_digits(n);
	n *= n;
	sqrlen = hex_digits(n);
	string = [*input()]
	for i, char in enumerate(string):
	string[i] = ord(char)

	# print(string)

	def factorize(n):
	x = 0
	y = 0
	for i in range(2, (n // 2) + 1):
	#include <stdio.h>
	#include <stdlib.h>

	int main(void)
	{
	unsigned i, j;
	for (i = 0; i < 26; ++i) {
	for (j = 0; j < 26; ++j) printf("%c%c ", i + 97, j + 97);
	}
	putchar('\n');