nyuuzyou/wikis huggingface dataset:
Braktif

Braktif is a 28-state cellular automaton, defined in ALPACA by Chris Pressey in 2005, which simulates the action of a language very similar to both Smallfuck (in terms of instruction set) and Archway (in terms of program structure). It was ostensibly designed as yet another test of the wire-crossing problem, but it is far more likely it was just done for entertainment.
==Example program==
The Smallfuck program
 *[>>*[*]*]
corresponds to the Braktif program
 *
 <<*[--]*
 000000000000000000 *[----- --]
 -----------------d-i-- --------
The above program demonstrates some of the features of Braktif. The symbols []><* represent instructions, in the manner of Smallfuck. The i represents the instruction pointer, which reacts to the instructions. The d represents the the data pointer and the series of 0's represents the data store (which may be considered extending infinitely to the left.) The series of -'s represent a bus along which the data pointer and the instruction pointer communicate by sending each other messages. The code must be structured a certain way, with each nested while loop "one level up" from the loop that contains it, in the manner of Archway.
==External resources==
* 
Category:Languages
Category:Implemented
Category:Cellular automata
Category:Two-dimensional languages
Category:Brainfuck derivatives
Category:2005
Branch (Johnki)

Branch is an esoteric programming language devised by User:Johnki in late 2011. The structure of programs is a visual representation of "branch if" statements, only each branch branches to two operations that run parallel to each other.
There are two dialects of Branch: Branch and Branch Unmanaged.
Currently, no interpreters exist, though one is in the works.
==External resources==
* 
Category:Languages
Category:Implemented
Category:Concurrent_programming
Category:Two-dimensional_languages
Category:2011
Branjunk

Branjunk is a brainfuck derivative created by User:Ractangle. It also uses the whole uppercase alphabet... yaaaaaaay? It also uses two variables.
== Commands ==
Command	It's action
+ 	Adds one to the 1 cell memory.
- 	Subtracts one from the 1 cell memory.
' 	Prints the 1 cell memory value as charecter in the at variable.
` 	Gets user input and sets the 1 cell memory to that value.
^ 	Pushes the value to the one stack memory. Also the value is set to 0. So you can use them as shortcuts.
v 	Sets the one memory cell to the value from the one stack memory.
== Examples ==
=== Hello World ===
 +++++++'^++++'v+++++++'++++++++'--------'+++'^+++++++++++'--------'
== See also ==
* Branjunk folder in Thewierd repo
* Brainuck
Category:LanguagesCategory:Brainfuck derivativesCategory:2024Category:ImplementedCategory:Unusable for programmingCategory:Total
Brianfuck

==Brainfuck Info==
Brainfuck operates on an array of memory cells, also referred to as the tape, each initially set to zero. There is a pointer, initially pointing to the first memory cell. The commands are:
Command	Description
> 	Move the pointer to the right
< 	Move the pointer to the left
+ 	Increment the memory cell under the pointer
- 	Decrement the memory cell under the pointer
. 	Output the character signified by the cell at the pointer
, 	Input a character and store it in the cell at the pointer
[ 	Jump past the matching ] if the cell under the pointer is 0
] 	Jump back to the matching [ if the cell under the pointer is nonzero
==Brianfuck Adds==
:This section is not detailed enough and needs to be explained. Please help us by adding some more information.
 F
factorial
 P
check if a sentence is palindrome.
 c
convert from roman to decimal
 U
Underload
 B
Beer program
 R
ROT13
 D
Display printable characters ASCII table
 r
Reverse order of lines in input
 O
Reverse order of characters on each line in input
 b
BrainFuck interpreter (use @ at end of program)
 C
Count how many of each letters
 S
Set-theoretic definition of natural numbers
==Example Code==
Factorial
 F
Check if sentence is palindrome
 P
Convert from Ruman numerals to Decimal
 c
Underload
 U
Beer program
 B
ROT13
 R
Display printable characters ASCII table
 D
Reverse order of lines in input
 r
Reverse order of characters on each line in input:
 O
BrainFuck interpreter (use @ at end of program): 
 b
Count how many of each letters: 
 C
Set-theoretic definition of natural numbers
 S
===In all of the questions, Brianfuck has only 1 byte, but FlogScript has a lot.===
====Brianfuck WINS!!!====
Category:Languages
Category:Brainfuck derivatives
Category:Golfing language
Briefscript

==Briefscript==
Briefscript is created to be as short-code as possible. It always had shorter code than Microscript.
==Syntax==
 1
 Jump to the 1st character in code
 2
 square CX and print it
 i
 input a number into CX
 o
 output CX
 O
 output 1
 Q
 print Q
 z
 print 0
 s
 selection jump(jump to the 2nd byte in code if AX=1, else halts program.)
 I
 input 2 numbers into CX and BX
 R
 convert roman numerals to decimal
 a
 add CX and BX , store it in CX and print it
 [
 If CX == 0, jump over ].
 ]
 subtract CX by 1. Jump to [ if CX != 0.
 F
 find the factorial of CX
 C
 coin program(Print 1 if input is "heads", -1 if input is "tails")
 H
 print "Hello, world!"
 9
 print the "99 bottles of beer"
 C
 check if CX is a palindrome
 U
 Underload
 S
 Stramge numbers
==Example==
===Infinite Loop(1 byte)===
 1
===Truth-machine(3 bytes)===
 ios
===Sum of 2 inputs(2 bytes)===
 Ia
===Calculate square of input(2 bytea)===
 i2
===CAT program(2 bytes)===
 io
===Take input and print 1, followed br that many 0s(5 bytes)===
 iO[z]
===reverse quine(1 byte)===
 Q
===Quine(1 byte)===
 Q
===Factorial(2 bytes)===
 iF
===Print 1 if input is "heads", -1 if input is "tails"(1 byte)===
 C
===Hello, world!(1 byte)===
 H
===Beer program(1 byte)===
 9
===Check if a number is palindrome(2 bytes)===
 iC
===Convert roman numerals to decimal(1 byte)===
 R
===Underload===
 U
===Strange numbers===
 S
Category:LanguagesCategory:Stack-basedCategory:2015Category:ImplementedCategory:Turing complete
Broccoli

Broccoli is a stack-based, semi-concatenative programming language created by mathieucaroff. It has a JS interpreter.
* Hello world example:
 "Hello World!" output
* All operators have the same precedence. Computations are carried left to right. The below code prints 18, not 12:
 3 + 3 * 3 output
* Factorial computer:
 input number = a
 1 = b
 
 {
 a * b = b
 a - 1 = a
 }
 { a > 0 }
 while
 
 b output
* Truth machine:
 { 0 output }
 { { 1 output } { true } while }
 input number == 0
 if
* Copy input on output until an empty line is met or until the input ends:
 input
 { output input }
 { = a a a }
 while
* Copy input on output (cat program):
 stdin .read
 stdout .write
== External resources ==
* Source Code
Category:Languages
Category:2022
Category:Implemented
Category:Turing complete
Category:Stack-based
Broken Gdy Brainfuck

Broken-Gdy-Brainfuck is a derivate of Brainfuck but with ABCDEFG.
This is Gdy_Brainfuck with the ability to generate random errors and force termination.
== Commands ==
Brainfuck	GdyBrainfuck
+ 	a
- 	b
. 	d(text) e(number)
, 	None
< 	A
> 	B
None 	c
None 	f
None 	F
None 	g
None 	G
[ 	None
] 	None
None 	h
None 	i
None 	I
 
== Examples ==
===Hello, World!===
gbf2
cHceclclcoc,c cWcocrclcdc!c
dC
===1+1=2===
gbf2
c1c+c1c=dC
aaAaafAe
===hey===
gbf2
cHcecyc,cWchcactc cac cycocucrc cncacmcec?c dC
hcNcicccec ctcoc cmcecectc cycocuc,c dD
==Interpreter==
Interpreter in C++.
#include <cstdio>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <windows.h>
int main(int argc, char **argv) {
 FILE* file_wr;
 int errpst=10000;
 std::vector<char> run_list;
 std::vector<char> run_list_count;
 int power = 0;
 int int_cp = 0;
 std::vector<float> fl_p;
 std::vector<char> str_p;
 std::string str2_p;
 for (int i = 0; i < 200; i++)
 {
 fl_p.push_back(0);
 }
 
 std::ifstream file(argv[1]);
 int count = 0;
 if (file.is_open()) {
 char getstr;
 while (file.get(getstr)) {
 run_list.push_back(getstr);
 count++;
 }
 file.close();
 for (int i = 0; i < count; i++) {
 if(rand()%errpst<errpst/270){
 system("cls");
 system("color 47");
 for(int j = 0; j < 1000; j++){
 std::cout << "<?>";
 }
 system("color 07");
 system("cls");
 break;
 }
 errpst-=10;
 if(run_list[i]=='g' && run_list[i+1]=='b' && run_list[i+2] =='f' && run_list[i+3] =='2' && run_list[i+4] =='\n' && power == 0){
 power = 1;
 }
 if(power == 1){
 if (run_list[i]=='a'){
 fl_p[int_cp]++;
 }
 else if (run_list[i]=='b'){
 fl_p[int_cp]--;
 }
 else if (run_list[i]=='A'){
 int_cp++;
 }
 else if (run_list[i]=='B'){
 int_cp--;
 }
 else if (run_list[i]=='c'){
 str_p.push_back(run_list[i+1]);
 i++;
 } 
 else if (run_list[i]=='d'){
 for (char c : str_p) {
 std::cout << c;
 }
 }
 else if (run_list[i]=='D'){
 std::cout << str2_p;
 }
 else if (run_list[i]=='e'){
 std::cout << fl_p[int_cp];
 }
 else if (run_list[i] == 'C'){
 str_p.clear();
 str2_p.clear();
 }
 else if (run_list[i] == 'f'){
 fl_p[int_cp+1]=fl_p[int_cp-1]+fl_p[int_cp];
 }
 else if (run_list[i] == 'F'){
 fl_p[int_cp+1]=fl_p[int_cp-1]*fl_p[int_cp];
 }
 else if (run_list[i] == 'g'){
 fl_p[int_cp+1]=fl_p[int_cp-1]-fl_p[int_cp];
 }
 else if (run_list[i] == 'h'){
 std::getline(std::cin, str2_p);
 }
 else if (run_list[i] == 'i'){
 std::string str2_p(str_p.begin(), str_p.end());
 }
 else if (run_list[i] == 'I'){
 std::vector<char> str_p(str2_p.begin(), str2_p.end());
 }
 }
 }
 } else {
 std::cout << "[ERR]\tFileOpen" << std::endl;
 }
 return 0;
}
Category:Languages
Category:2023
Broken Tape

Broken Tape is an esolang made by User:Yes that uses a broken tape processor.
== The Tape ==
The tape is a 1D array of cells, like any other. But, the tape processor is broken.
At any time, the tape could stretch and damage or break cells. The tape could also get jammed and break the functionality of the program.
The tape processor also has an automatic "recovery" function, where it attempts to recover damaged cells by sticking ripped pieces together.
== Commands ==
 Caption text
Command	Literal Meaning	Description
CLL 	Cell Left 	Move the pointer left
CLR 	Cell Right 	Move the pointer right
INC 	Increment 	Increment cell under pointer
DEC 	Decrement 	Decrement the cell under the pointer
EMP 	Empty 	Set the cell under the pointer to zero
WNZ 	While Not Zero 	While cell under the pointer is not zero, execute commands in between next [ and ]
WHZ 	While Zero 	While cell under the pointer is zero, execute commands in between next [ and ]
[ 	_loopstart 	Starter for WHZ and WNZ loop
] 	_loopend 	Ender for WHZ and WNZ loop
END 	End Program 	End program/Terminate execution
RST 	Restart 	Restart the program
PRA 	Print Ascii 	Print value of cell under pointer as an ASCII character
PRN 	Print Number 	Print value of cell under pointer as a number
INP 	Input 	Get input and store ASCII value of input into cell under pointer
== Examples ==
Print ASCII value of input
INP
PRN
Print ASCII value of input but it has a chance to corrupt the cell and maybe also poorly stitch it back together
CLR
INP
WNZ
[
CLL
INC
CLR
DEC
]
PRN
The same program in bf
>,[<+>-].
Category:Languages
Category:Cell-based
Category:Nondeterministic
Broken stack element

Broken stack element(BSE) is a language by User:ChuckEsoteric08 inspired by Entropy.
==Description==
It has 1 stack as memory. Every time instruction which does somthing with stack element it could decay.
push x 	push x to the stack
pop x 	pop x and output
dup 	duplicate stack element
conc 	concatenate top two stack elements
goto x y	goto 1-indexed line x if top of the stack is x
Category:Languages Category:Stack-based
Brook

Brook is a language created by Nathan van Doorn in 2011 with the gimmick that the program can produce and immediately execute a potentially infinite length program written in Brook. It is unknown if it is Turing-complete or not.
==Structure==
A Brook program is made up of a sequence of characters, parsed as numbers when appropriate. If a number is not postfixed with ^ or a (...) contstruct, it is ignored. ^s and (...)s not prefixed with numbers are assumed to have an invisible zero before them, which makes comments possible with (...)s. All invalid characters are ignored, however this happens after the previous step, so 54¬^ is equivalent to 0^.
Data is stored in one ways: a queue, which is unique to each "continuity", or stream of code. Popping from an empty queue returns a zero.
Input and output are similar to Piet, in that they both exist for characters and numbers. However, Brook also has an extra output, which is not displayed, but instead executed, as soon as there is enough to execute unambiguously.
==Commands==
 n^ pushes n to the queue
 v pops a number from the queue and discards it
 U pops a number from the queue and pushes it twice
 @ pops a number from the queue and pushes it once
 + pops two numbers from the queue and pushes their sum
 - pops two numbers from the queue and pushes their absolute difference
 i pushes the ASCII (or Unicode, or whatever) value of the next character from input into the queue
 o pops a number from the queue and prints the character with it as its character code
 c pops a number from the queue and adds the character with it as its character code to the current continuity's subcontinuity
 I, O, and C work like their lower case equivalent but use numbers rather than characters
In addition to these there is also the n(...) construct, which repeats ... n times. This, in almost any other language, would be rather redundant, although possibly nice for sufficiently large values of n, but in Brook is quite useful.
==Examples==
===Fibonacci===
 I2(1^@O)2^-2(1^@C94^@c)C40^c85^c43^c64^c85^c64^c79^c41^c
Calculates the first n Fibonacci numbers where n ≥ 2 (if n < 2, weird stuff happens)
===Truth-machine===
 I1^U-40^0^94^79^41^@40^49^94^50^51^40^85^57^52^94^41^79^50^51^40^64^67^99^41^50^51^40^99^41^CcCcccCc23(U94^)23(@Cc)23(c)41^c
==External resources==
* An online interpreter
==See also==
* Muriel
Category:LanguagesCategory:2011Category:Queue-basedCategory:Unknown computational classCategory:ImplementedCategory:Low-level
Brotlipython

Brotlipython was created to cheat in help with using Python in golfing challenges. A Brotlipython program is a Python 3 program compressed with the Brotli lossless compression algorithm. 
== Implementation ==
Here is an example interpreter, which requires python, brotli and coreutils. The Brotlipython source file is passed as the first command line argument.
#!/bin/sh
Q=$(mktemp)
brotli -d < $1 > $Q
python3 $Q
Here is a program to compile Python to Brotlipython (first argument is Python source, second argument is Brotlipython output):
#!/bin/sh
brotli -q 11 < $1 > $2
== Example code ==
Due to character set limitations the examples will be encoded with base64. Current Brotlipython interpreters will not automatically decode this.
Hello World: DwuAcHJpbnQoIkhlbGxvLCBXb3JsZCEiKQoD
Factorizer: H5cAUIzDuLF70AaUhRjcabCtDCUN9WYpuRz2WgopOjlg/3a8fAcLOAoA0ySnHESQliXNj+euAue8n9tpZnJ6+uD8v6aDArvCAZMlJJjppbpReauF4DeqJUGaG44bM2Z/KF6JggGvCFmHkCQMCNJ4EKMwJ+UOmuKUtka
Sum two integers: HyIA+B2pU587XqeAKKwMukSBq2sGBpEkHyUAGMY1ejI=
Brugtiohell

Brugtiohell is a esolang created by User:Yayimhere. its a jumble of other esolangs put together for some reason. the name is a pun of the danish words funktionel and brug, and the english word hell
== commands ==
these are the commands of Brugtiohell:
 x10, notated as Ex, (z)x00y notated as λz x y, and 1, from Jot
 
 ʎ̥, and ɤ̞, from FROSTWIRE-666
 
 I the identity function
 
 ` from Unlambda
 
 w, from Savage Operator
 
 
 
 01xʎ̥, notated as ωx, with the binary from BLC, and ʎ̥ from FROSTWIRE-666
 
 ʎ̥(x`(`)U), notated as ∀x, with ` from Unlambda, a from Savage Operator, and U from ()
 
 L(J`(`)(`))xʎ̥, notated as ∄x, with ` and c from Unlambda, L and J(jay) from CZTOLJDEFGKJSKI calculus, U from (), and ʎ̥ from FROSTWIRE-666
 
 1(ʎ̥(`))1ɤ̞x10y01(λ(`) (01) z)1(∄z) notated as ⁂x y z, with the binary from Jot, ɤ̞ and ʎ̥ from FROSTWIRE-666, ` from unlambda, and ∄ from well... this
all output capabilities are ignored. here are all the commands from seperate langs in lambda calculus and the already defined operators:
 ----
 S = λf.λg.λx. f x (g x)
 K = λx.λy.x
 B = λx.λy.λz.x (y z)
 U = λx.x(S)(K)
 01x y = `x y (BLC)
 L = λa.λb.a (b b)
 J = λa.λb.λc.λd.a b (a d c)
 ᶑ̊ = λx.λy.y x
 ꞎ = λx.λy.λz.B (ᶑ̊ x y) x z #spesifically for λx.λy.S (B x x x) (ꞎ y) not how it works in FROSTWIRE-666
 ^^^not commands^^^
 ----
 ʎ̥ = λx.B (K) x (S)
 ɤ̞ = λx.λy.S (B x x x) (ꞎ y)
 ` = λx.λy.x y #not how it is in Unlambda but wut ever
 w = λx.(x)
 since Jot is already defined in lambda calculus it works, and does not have to be defined(although we have the subset x10,z'x00y , and 1 only)
so the operators defined by other operators would be:
 ∀ = λq.ʎ̥(q`(`)U)
 ω = λq.01qʎ̥ (BLC binary)
 E = λq.q10 (jot binary)
 ∄ = λq.L(J`(`)(`))qʎ̥
 ⁂ = 1(ʎ̥(`))1ɤ̞x10y01(Y)1(∄z) #binary is Jot binary
Category:Languages Category:2024 Category:Functional paradigm Category:Unimplemented Category:Unknown computational class
Bruijndejx

Bruijndejx is esolang based on De Bruijn indexing.
The syntax is:
* Name = Can use letters, numbers, underscore, and apostrophe, but must start with a letter or underscore. Names are case-sensitive.
* Number = Specify by digits 0 to 9 in decimal notation.
* Program = Series of declarations separated by semicolons.
* Declaration = Name, equal sign, and the expression which is its definition.
* Comment = Start by # and end at a line break.
Expressions can be:
* [x] means a lambda expression returning x.
* A number is a De Bruijn index to use a lambda variable.
* A function application is two expressions followed by . to apply. If you have x y. then it means y is function and x is the argument.
* : is a shortcut for ...
* Inside of a expression if there is not enough . it add sufficient trailing . at the end, automatically.
* If there is too much . or empty expression then it can add 0 on the left as much as is required.
Free variables are permitted (for example, Free = [1]; has a free variable). They remain free when this name is used in another expression, unless you use $ as a prefix which treats it as a macro substitution instead of a value substitution.
Input/output is done by running the final declaration in the program; its value is one of these things decides what I/O to do. I/O functions:
* / is function taking one argument. Its result means to output a zero bit and then its argument is the next program.
* \ is like / but output a one bit instead.
* ? takes three arguments. Its result means to take a single bit of input, and continue with the first argument as the program if zero bit is input, second argument if one bit is input, and third argument if end of input.
* * takes no arguments, causing program to terminate.
==Examples==
Program to halt with no effects:
 *
Program copying input to output:
 main = *main\.main/.?;
Category:Languages
Category:2011
Bub

Bub (Brainfuck Ugly Bodge) is a variant of Brainfuck designed by Matthew Westcott. The essential difference is that Brainfuck's "while"-like instructions are replaced by "GOTO"-like ones.
Bub's claim to fame is that there is an interpreter for it written in Muriel, as a means of showing that Muriel is Turing-complete.
==External resources==
* 
* A Bub interpreter, a brainfuck to Bub translator, and a limited Bub to brainfuck translator -- all written in perl
* A translator that will convert any Bub program to brainfuck
Category:Languages
Category:Implemented
Category:Turing complete
Category:Brainfuck derivatives
Category:Unknown year
BubbleLang/Algorithm

BubbleLang
== Swap two numbers ==
function swap(x: int*, y: int*):
 var t: int* = x
 x = y
 y = t
Thus makes these things:
=== Bubble sort ===
function swap(x: int*, y: int*):
 var t: int* = x
 x = y
 y = t
function bubble_sort(array: list, x: int):
 for i in range(0, x):
 if array[i] > array[i + 1]:
 swap(array[i], array[i + 1])
=== Max function using swap ===
function swap(x: int*, y: int*):
 var t: int* = x
 x = y
 y = t
delete max
function max(x: int, y: int):
 if y > x: 
 swap(x, y)
 return x
== Print random character ==
When you try to char-ize the integer, you'll get the character that has ASCII of that integer.
from random import randint
var ascii = randint(0, 1114111)
print(char(ascii))
BubbleLang/Error

When you try to execute an illegal command, BubbleLang returns an error.
== SyntaxError ==
=== Default ===
print("So what does "pneumonoultramicroscopicsilicovolcanoconiosis" meaning?")
In this case, the results we hope to get is So what does "pneumonoultramicroscopicsilicovolcanoconiosis" meaning?, but the word "pneumonoultramicroscopicsilicovolcanoconiosis" is not in any string, and BubbleLang didn't has the command "pneumonoultramicroscopicsilicovolcanoconiosis", so it will output:
[Error 1]SyntaxError.Default: Invalid Syntax
=== Assignment ===
var True = "真"
In this case, we're trying to assign to a variable called "True", but "True" is the keyword of BubbleLang, so it will output:
[Error 2]SyntaxError.Assignment: Can't assign to a keyword
== NameError ==
=== Default ===
var a = 114514
print(b)
In this case, we're trying to access a variable called "b", but BubbleLang didn't found "b", so it will output:
[Error 3]NameError.Default: Name "b" is not undefined
== ValueError ==
=== List ===
var mylist = ["A", "N", "P", "M"]
mylist.remove("T")
In this case, we're trying to remove the element "T" from the list "my_list", but "T" is not an element of this list, so it will output:
[Error 4]ValueError.List: Element ""T"" is not in the list
=== Convert ===
var string = "b185091-2"
string = int(string)
In this case, we're tring to convert "b185091-2" to integer, but there are some illegal things in the string, so it will output:
[Error 5]ValueError.Convert: Illegal literal to convert to int: "b185091-2"
== CalculationError ==
=== ZeroDivision ===
var t = 5
var w = 0
print(t/w)
In this case, we're trying divide 5 by 0, but mathematic didn't defines that n÷0, so it will output:
[Error 6]CalculationError.Zerodivision: Division by 0
=== OutOfRange ===
from math import *
var x: float = 2
print(arcsin(x))
In this case, we're trying to get the sin-1(2), but sin-1(x) in BubbleLang is only defined for [-1,1], so it will output:
[Error 7]CalculationError.OutOfRange: arcsin(x) only works for the real number between -1 and 1
== FileError ==
=== NotFound ===
filename = "s.txt"
with open(filename, "r"):
 print(filename.content())
In this case, we're trying access s.txt, but s.txt is not in this workspace directory, so it will output:
[Error 8]FileError.NotFound: [WinError 2](The system could not find the specified file.): "s.txt"
== Others ==
I'll add them soon.
BubbleLang/Examples

Main page is BubbleLang.
== Random Number Generator ==
from random import randint
var x = randint(1, 6)
# randint(x, y) will generate a number between x and y.
print(x)
== Prime(x) ==
var x = input("请输入一个数字：")
x = int(x)
if x > 1:
 if x in (2, 3):
 print(f"{x}是质数。")
 else:
 for i in range(2, x):
 if x % i == 0:
 print(f"{x}是合数。")
 break
else:
 if x == -1:
 print(f"{x}是质数。")
 else:
 print(f"{x}是合数。")
== Get the value of x! ==
function fact(x):
 if x < 0:
 raise CalculationError.OutOfRange("fact(x) only work for the integer that above or equal to 0")
 elif x == 0:
 return 1
 else:
 return (x * fact(x-1))
var t = input("Please input a number: ")
t = int(t)
try:
 answer = fact(t)
except CalculationError.OutOfRange:
 print("Negative number didn't has a factorial.")
else:
 print(f"{t}!={fact(t)}")
== Disan count 3.0 ==
function prime(x):
 if x > 1:
 if x in (2, 3):
 return True
 else:
 for i in range(2, x):
 if x % i == 0:
 return False
 else:
 if x == -1:
 return True
 else:
 return False
var a = input()
a = int(a)
for i in range(1, a + 1, 1):
 if prime(i) == True:
 print(f"{i} is prime!\n")
 else:
 print(f"{i}\n")
== Divisors(x) ==
function divisors(x):
 var z = []
 if x > 0:
 for i in range(1, x):
 if x % i == 0:
 z.extra(i)
 return z
var a = input()
a = int(a)
print(divisors(a))
== Other ==
# I'll add that later, so please wait......
== Categories ==
Category:Examples