Post History

Golf the MarkFuncs program

# Introduction

I wrote a Python program where it basically takes input of a string then something else if it's necessary, then it will solve a specific challenge, kinda like HQ9+. The program lies on a GitHub repo named [MarkFuncs](https://github.com/JoyrenceMatthewAgas/MarkFuncs) as the proglang's name if it even would exist.

As of the posting of this, the program looks like this, which is the basis you'll be following for this challenge:

```python
s = input()

if s.lower() == "hello":
	print("Hello, World!")

elif s.lower() == "bottle":
	for i in range(99, 0, -1):
		if i == 1:
			print(i, "bottle of beer on the wall,", i, "bottle of beer.\nGo to the store and buy some more, 99 bottles of beer on the wall.")
			break
		if i == 2:
			print(i, "bottles of beer on the wall,", i, "bottles of beer.\nTake one down and pass it around,", i - 1, "bottle of beer on the wall.\n")
			continue
		print(i, "bottles of beer on the wall,", i, "bottles of beer.\nTake one down and pass it around,", i - 1, "bottles of beer on the wall.\n")

elif s.lower() == "square":
	for i in range(1, 1001):
		print(i ** 2)

elif s.lower() == "fibonacci":
	a = 1; b = 1; c = 1
	while a + b <= 1000000:
		print(a)
		c = a + b
		a = b
		b = c

elif s.lower() == "quine":
	print(s)

elif s.lower() == "factorial":
 	x = 1; y = 1
	while x <= 1000000:
		x *= y
		print(x)
		y += 1

elif s.lower() == "rot13":
	a = input()
	print(a.translate(str.maketrans("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz", "NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm")))

elif s.lower() == "luhn":
	n = input(); a = []
	for i in range(1, len(n) + 1):
		a.append(int(n[len(n) - i]))
	i = 1
	while True:
		try:
			a[i] *= 2
			i += 2
			continue
		except:
			break
	b = []; c = None
	for j in range(len(n)):
		c = str(a[j])
		for k in range(len(c)):
			b.append(c[k])
	x = 0
	for l in range(len(b)):
		x += int(b[l])
	if x % 10 == 0:
		print("Valid")
	else:
		print("Invalid")

elif s.lower() == "fizzbuzz":
	for i in range(1, 101):
		if i % 3 == 0:
			if i % 5 == 0:
				print("FizzBuzz")
				continue
			print("Fizz")
		elif i % 5 == 0:
			print("Buzz")
		else:
			print(i)

elif s.lower() == "oddeven":
	n = int(input())
	if n % 2 == 0:
		print("Even")
	else:
		print("Odd")

elif s.lower() == "numpyramid":
	print("                           0\n                          0 0\n                         0 1 0\n                        0 1 1 0\n                       0 1 2 1 0\n                      0 1 2 2 1 0\n                     0 1 2 3 2 1 0\n                    0 1 2 3 3 2 1 0\n                   0 1 2 3 4 3 2 1 0\n                  0 1 2 3 4 4 3 2 1 0\n                 0 1 2 3 4 5 4 3 2 1 0\n                0 1 2 3 4 5 5 4 3 2 1 0\n               0 1 2 3 4 5 6 5 4 3 2 1 0\n              0 1 2 3 4 5 6 6 5 4 3 2 1 0\n             0 1 2 3 4 5 6 7 6 5 4 3 2 1 0\n            0 1 2 3 4 5 6 7 7 6 5 4 3 2 1 0\n           0 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 0\n          0 1 2 3 4 5 6 7 8 8 7 6 5 4 3 2 1 0\n         0 1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1 0\n        0 1 2 3 4 5 6 7 8 8 8 8 7 6 5 4 3 2 1 0\n       0 1 2 3 4 5 6 7 7 7 7 7 7 7 6 5 4 3 2 1 0\n      0 1 2 3 4 5 6 6 6 6 6 6 6 6 6 6 5 4 3 2 1 0\n     0 1 2 3 4 5 5 5 5 5 5 5 5 5 5 5 5 5 4 3 2 1 0\n    0 1 2 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 3 2 1 0\n   0 1 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 2 1 0\n  0 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 0\n 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0")

else:
	print("Invalid text: No function exists")
```

The program, depending on the input, solves the following:

- Basic "Hello, World!"
- 99 Bottles of Beer
- All perfect squares
- Fibonacci sequence
- Quine
- Factorials
- ROT13
- Luhn algorithm
- [1, 2, Fizz, 4, Buzz!](https://codegolf.codidact.com/posts/279365)
- Checking if `int` is odd or even
- [Numerical pyramid](https://codegolf.codidact.com/posts/279169)

### [Try it online!](https://tio.run/##xZZbd9o4EMef4VNMfU7PMSnhANnuLml56L3d3vaSXmkeZFsUBSE5lhwMXz6rsXB8waiXl6IHx9JvRv8ZzciJN3ohxcn1tYIpMBGn2u91u2wOasDlmiZ@D6ZT8BaUc@mddjtxwoT2vef43ocPMuHRLc9YUL5nE0itOUWjuUyAGe@QEPGV@pNJH4Z9OB71zFrH2DHkR/iy88/6hTnIOQSUJiAF6AWFNeG87/Vhnxh8Ec8kaJljSsuEAhERBOkGlFxRWJmZPkwmYM1Um@eBCcWICBJKlhVp41Zp6tvaVEXcGVkarYJCJNcilxYTpYBpIIlMRZRbwjGMnLEbR1ZjKIVmIqXdXyBMHVbWVgjqMiVJWyEYj6Ph0JbBLgg4OoJxu5s5C6QgYcjQEzHlOroHgX2E@Oh21gtmskbgjpm/P0Xf@Cu9E8wcsjli/kYv@EQ3YeumlykTtCx8dUAaCU3BMcINCZ3MitpURWUNQRkcTWFzoyxDZRu4gxZtGyRSj06KuIs2LaIaaJNOxYmmvtLJYGXOM5/xvQcPHz1@8vTZ8xd/vXz1@s3bv//597@zd@8/fPz0mQRhROdfF@xiyVdCxpeJ0unVOttszWl7NbTmpIbWnHi9XntyeLoQKF2U0u8BxjE7b6sIToUveuaAbF2QAYljKiIfQxWz3eoxsHOzXYdVc3yWpBRNdLLJG5bM2DmmeYwvDJM7bnQOzUIa69NKzwe5LltRb0xTWIUXpUIrIJeGjEm4T2YX53h@SC7rZGjJTlBEEc6WyGKJDK1vXrcIrEWGcjHkYMbRwGQ1g9umgjCllZL23hPOIrwSKFe0Mv9CXO1W2ntpuw3S7fZQU1au5ttwcrNnMXO3nCn2e2o8PkSP@e1UTXKVyFdzPQ03O@bGQxFNcS@0hyGjiF7RSnUZ0laYTZkwm4ybGXuCFvsJexsdSpZIV/EmISuTzfILCId/wy/CsehcHsLItY7LLgDXxy7CAi7EEicupkBcUMH85qJKyIWV1F0XV8VcYJX73UXWQRdaJ/9wsU3UBTfZP130PuzC9@mJi29z7tpgP8pytFo0c90c@yb1424fDZtqublG1ais9W@PG6uiy753WDPb3D82jN0QfmrYuy6/AetfDNA006fm4wfzVISamX/xaMaUVl7v@vp/)

# Challenge

Write a program on any language to re-represent the MarkFuncs "interpreter". 

- It should take input of a string, and if the string is `rot13`, `oddeven` or `luhn`, take another input.
- Make any custom error message if something fails in the function, not when the input doesn't match with the others since that's already dealt with.
- Functions and built-ins can be used.
- Don't rely on [loopholes](https://codegolf.codidact.com/posts/282788) to make the golfed "interpreter".
- You can reuse **already golfed** code for the program, in other words, code you already wrote for answers in code challenge sites.
- As a <a class="badge is-tag">code-golf</a> challenge, the shortest "interpreter" wins.

# Suggestions

- Any more tags to apply?
- Anything unclear?
- Any other errors to handle?