These are all short answers to various homework questions.
#include <stdbool.h>
bool is_odd(unsigned O) {
while (true) {
return ~-(O ^ -~O);
}
}
Enjoy the surprised pseudo-emoji.
if ((x < x - 20ull) << x % 20ull & 02424254)
{
// is prime
}
Original: How do I find a prime number below 20 in a single if statement in C++?
Gotta account for character sets such as EBCDIC, right?
#include <iostream>
int main() {
do;
while (!
std::operator<<(std::cout,
"ZYXWVUTSRQPONMLKJIHGFEDCBA\n")
);
}
Original: How do I write a do-while loop to display letters from Z to A using the C++ program?
I pulled the Dealer's Choice card and picked an assembly language OP isn't likely to know. The original task was to multiply two numbers and write the result to a specific address.
MVK.S2 0x2236, B0
|| MVK.S1 0x3421, A0
MVK.S2 0x5741, B0
|| MPYU.M1X A0, B0, A1
|| MVK.S1 0x89, B1
MPYU.M2X A0, B0, B0
|| SHL.S2 B1, 12, B1
SHRU.S1 A1, 16, A0
|| STH.D2T1 A1, *B1++
ADD.L1X B0, A0, A0
SHRU.S1 A0, 16, A0
|| STH.D2T1 A0, *B1
STH.D2T1 A0, *++B1
I don't get to write much Perl these days, so it was fun to stretch those legs again. This reads the input, breaks it into words, counts their frequency, and then prints them in alphabetical order with their frequency and frequency rank.
#!/usr/bin/env perl
print map{ $W=$W{$_}; "$_\t$W\t".(1+
(grep $W<$_, values %W))."\n" } sort
grep !$W{$_}++, map lc, split /\W+/,
join '',(<>)
Example:
- Input:
a b b c c d d d e e e e - Output:
a 1 5
b 2 3
c 2 3
d 3 2
e 4 1
What else can I say?
#include <stdio.h>
int main(int c, char **v) {
(c = getchar())
== EOF
|| putchar(c)
&& putchar(' ')
&& main(c, v);
}
One way to spot a homework question at 1000 yards is that it fits the pattern "do trivial thing using basic language feature" And so it is with this guy:
#include <cmath>
auto function_to_compute_factorial_that_i_totally_didnt_ask_the_internet_to_write_for_me_because_i_do_my_own_homework(unsigned long long x) {
return std::tgamma(++x);
}
Original: What is a program to find the factorial of a number using a function?
I played the dealer's choice card and used TMS9900.
For example, on the TMS9900, the C instruction (unrelated to the C programming language) can compare two values in registers, two values in memory, or some combination. To compare the number in the location
HMWKwith the number at the locationASGMT, do this:
C @HMWK, @ASGMT
Original: How do I compare two numbers by using an assembly language?
This was indeed truly pointless.
#include <stdexcept>
#include <string>
// Check if any letter is repeated in the word "algorithm."
bool has_repeated_letter(const std::string& s) {
if (s != "algorithm") {
throw std::invalid_argument(s);
}
return false;
}
Original: What is the algorithm that checks if any letter is repeated in the word “algorithm”?
int main() {
int x = 10;
// Decrease x to 0.
x = 0;
}
Your next programming lesson: Write proper specifications of the problem you’re trying to solve. This will have two impacts:
- If you ask for help, you are more likely to get correct and useful help if you can clearly state what is required, and what you’ve done to get there, and where you got stuck relative to the precise requirements.
- You will be less likely to actually need to ask for help. The process of stating what you’re trying to accomplish more precisely, and what pieces you understand, and what parts you’re stuck on, will likely point you in the direction you need to go to get yourself unstuck.
This solution uses recursion when it's not really called for.
void print_reverse(const char *const s) {
if (!*s) return;
print_reverse(s + 1);
putchar(*s);
}
Original: How do you write a C program to print individual characters of a string in a reverse order?
Heh... back to back with the previous quickie, this is a bit funny. My usual
dodge with linked lists in C++ is to use std::list<T>, as it's a
doubly-linked list implementation.
And, for something like this, there's a standard library function,
std::count, just begging to be used. Throw in a dash of templates and auto
and this is innoculated against being a helpful homework answer.
#include <algorithm>
#include <list>
template <typename T>
auto count_occurrences(const std::list<T>& list, const T& value) {
return std::count(list.cbegin(), list.cend(), value);
}
This is a case of just reading a question and shaking my head. The question:
By using pseudocode, how do you write an algorithm to populate a student and their phone number?
My answer:
As for populating the student, I assume their parents already took care of adding the student to the population. If you’re unsure of how that process works, perhaps consult with your parents, or in a pinch, some biology texts.
As for their phone number? Ma Bell (or its equivalent in your jurisdiction) assigns that. That’s likely “populated” already as well.
I thought this was supposed to be a programming question.
The original question asked "What are two utilities found in an operating system?"
I gave the following concise answer:
In POSIX compliant operating systems:
[. LinkIn Apple DOS 3.3:
MUFFIN. Link
I display both a string, and an integer... sorta.
Version 1:
#include <iostream>
int main() {
std::cerr << "the sum of the first 10 "
"odd multiples of 3\n";
}
Version 2:
#include <iostream>
int main() {
std::cout << sizeof("Do")
<< +!" your own "
<< -!"homework!"
<< std::endl;
}
Original: What is a program in C++ that displays the sum of the first 10 odd multiples of 3?
As I answered on Quora:
In base 2, there's only one number that fits the criteria: 1.
I'm a big fan of compile time evaluation, as I demonstrated here.
The OP's name is Ma. Heine Unday, and so I wrote:
#error Ma. Heine Unday
Ta da!
This is almost certainly not what they were looking for.
C
#include <stdio.h>
int main() {
const char output[] = "my name 10 times\n";
for (int i = 0; output[i]; ++i)
putchar(output[i]);
}
C++
#include <iostream>
#include <string_view>
int main() {
constexpr auto output = std::string_view("my name 10 times\n");
for (const auto c : output)
std::cout << c;
}
Original: How do I show my name 10 times by using a loop?
I'm pretty sure OP wanted to permute the digits of a number, since permuting a single number is pretty boring. If you're asked to permute a single number, there's only one permutation, the number itself!
I used an earlier version of Digit Adaptor for this answer. The more recent version linked here should also work. The resulting program was tiny as a result:
#include "digit_adaptor.hh"
#include <algorithm>
#include <iostream>
#include <iterator>
int main() {
using int_type = unsigned long long;
auto number = int_type{0};
std::cout << "Input a number: ";
std::cin >> number;
auto da = digit_adaptor<int_type, 10>{number};
std::sort(std::begin(da), std::end(da));
do {
for (const auto d : da) {
std::cout << d;
}
std::cout << '\n';
} while (std::next_permutation(std::begin(da), std::end(da)));
}
Original: How do I write a program to find the permutations of a number using C++?
This one, like the previous one, is also based on Digit Adaptor. It's such an efficient tool for these sorts of homework questions!
#include <iostream>
#include "digit_adaptor.hh"
int main() {
auto u = 1000u;
auto da = digit_adaptor<unsigned>{u};
for (u = 1000; u <= 9999; ++u)
if (da[0] > da[2] + da[3])
std::cout << u << '\n';
return 0;
}
My answer applies to multiple questions of this form, since it's agnostic to
$ALGORITHM.
_________________________
(__________Start__________)
|
V
__
_/ \_
_/ \_
_/ \_ +-------------------+
/ Is ASCII \___________\ | Type it in like |___
\_ art OK? _/ Yes / | this answer does. | |
\_ _/ +-------------------+ |
\_ _/ ^ |
\__/ | |
| | |
| No | |
V | |
__ | |
_/ \_ | |
_/ \_ | |
_/ \_ +-------------------+ |
/ Posting it \___________\ | Better stick to | |
\_ on Quora? _/ Yes / | ASCII anyway to | |
\_ _/ | avoid meme slap. | |
\_ _/ +-------------------+ |
\__/ |
| |
| No |
V |
+-----------------------------+ |
| Use pencil and paper or a | |
| vector-based drawing tool. | |
+-----------------------------+ |
| |
V |
_________________________ |
(___________Stop__________)<-------------------------------+
Original: How can I draw a flow chart for calculating average and sum by a multidimensional array?
A little creative interpretation leads me to:
MOV DX, message
MOV AH, 9
INT 021h
MOV AH, 04Ch
INT 021h
message:
DB "San Jose, CA$"
Why San Jose? As I said in the answer:
After all, San Jose is where I’m at currently, and so all of my input values will come from here.
Original: What is the assembly language code that prints the location of input value?
I'll just quote the original here, as it's short.
If you’re writing a computer program to do this, there’s an easy way to accomplish your goal.
Read your two integers into two variables. Let’s call them
aandb.Now print out
a, followed byb, followed bya.You’re guaranteed in that sequence, if one of the two variables is larger than the other, that you’ve printed the larger one before the smaller one within that sequence.
In the spirit of the previous answer, I offer this concise answer to a related question:
Write a c program to print the bigger number between two numbers without using conditional operators?
I’ll do you one better: I’ll print out both the larger and the smaller of the two numbers. Assume the two numbers are in
aandb.
printf(“%d %d\n”, a, b);That will print out both the larger of
aandb, and the smaller ofaandb!
The OP asked a simple question: "What are 5 examples of a microprocessor of RISC?" I gave a simple answer:
The original question asked for the program to be in "the simplest form." I say it's simplest to outsource the work to tools that know how to do this already.
#include <cstdlib>
#include <iostream>
#include <string>
int main() {
std::string bound;
std::cout << "Input the upper, non-inclusive bound: ";
std::cin >> bound;
std::string command =
std::string{"/usr/games/primes 1 "} + bound + "| tail -1";
std::system(command.c_str());
}
Of course, Alex Eustis came up with an even simpler interpretation:
int main() {
std::string num;
std::cout "Enter a number: 31 ";
std::cin >> num;
}
That will indeed print a prime number before whatever the user enters!
The hailstone sequence comes from the Collatz conjecture.. For our purposes, it doesn't matter whether all starting points end up reaching a cycle. What matters is that the sequence doesn't terminate, and doesn't change between the categories negative, zero, or positive.
Therefore, we can determine the sum of all terms from a given starting point quite trivially.
#include <math.h>
float sum_hailstone(int x) {
return x == 0 ? 0
: x < 0 ? -INFINITY
: INFINITY;
}
Original: What is the C program to find the sum of the Hailstone sequence?
The OP wanted a program in C that would read a 10 digit number. If the input exceeds or falls short of 10 digits, then it should be invalid.
Clearly a program in C is the antecedant of it, right?
#include <stdio.h>
int main() {
char num[11];
if (scanf("%[0-9]c%[0-9]c%[0-9]c%[0-9]c%[0-9]c"
"%[0-9]c%[0-9]c%[0-9]c%[0-9]c%[0-9]c%[0-9]c",
&num[0], &num[1], &num[2], &num[3], &num[4],
&num[5], &num[6], &num[7], &num[8], &num[9],
&num[10]) != 10) {
char *ptr = NULL;
++*ptr; // Undefined behavior.
}
num[10] = '\0';
return 0;
}
Et voilà! This program behaves correctly when given a 10 digit input. Otherwise, it has undefined behavior, rendering the program invalid.
You've gotta love questions that ask for an answer to an open question in mathematics with a straight face. Some of these are likely trolls. For this one it's hard to be sure. In any case, I'll just quote the original answer here, as it's short:
What function outputs the minimum length of a character string that, read left to right, contains every permutation of n characters? (e.g. for n = 2, y(n) = 3, because the string 'aba' contains every permutation of {a,b}.
This is called a superpermutation.
For 1 ≤ n ≤ 5, we know the lengths of the minimum length superpermutations. However, the easy stuff stops there. Quoting Wikipedia:
For the cases of n > 5, a smallest superpermutation has not yet been proved nor a pattern to find them, but lower and upper bounds for them have been found.
So, you've got yourself an open question, mathematically speaking.
Good luck!
Naturally, I went with Apple SOS and OS-65D.
Original: What are the names of any two operating systems?
The request doesn't require any computation. And in ECS BASIC, it doesn't require anything more than two empty lines of code. They just have to have the right line numbers.
Another homework question asking for assembly code without specifying an
architecture. So once again, I invoke dealer's choice! In this case,
I chose TMS320C64+, using COFF naming conventions. The request itself was to
transfer 5 bytes of data from offset 0000h to offset 0021h. I interpreted
"offset" as "from the start of data."
.data
.global _hmwk_2_7_data
_hmwk_2_7_data:
.byte 020h, 040h, 011h, 01Fh, 0CDh
.space 021h
.text
.global _hmwk_2_7_main
_hmwk_2_7_main:
MVKL .S2 _hmwk_2_7_data, B1
MVKH .S2 _hmwk_2_7_data, B1
LDNW .D2T1 *B1++(4), A0
LDBU .D2T1 *B1++(021h), A1
|| RETNOP .S2 B3, 3
STNW .D2T1 A0, *-B1(4)
STB .D2T1 A1, *B1
This asked to read two bytes of data from the last and first memory locations in the 8086 address map, and then write the result in the last even numbered location in that same address map.
The following code ought to do the trick on a true 8086.
XOR BX, BX
NOT BX
MOV SS, BX
SHR BX, 0CH
MOV SP, BX
POP AX
MOV CX, 0101H
IMUL CX
XCHG AH, [SS:BX - 1]
Quite how it performs its magic is another question. :-)
You've gotta love homework questions that expect you to display a known result, without asking you to compute that result. I'll just quote the the original post here:
I’d use a suitable text editor to enter my presumed solution to my homework assignment, perhaps consulting my notes from class if I wasn’t sure what to write. I’d then compile it (and edit it to fix any compile errors), and test it to ensure it met the assignment’s criteria.
I’d also iterate through edit/compile/debug until it was correct. Once it was correct, I’d work on cleaning up the formatting a bit so it doesn’t look like I just barfed a bunch of symbols from my keyboard.
I would probably even add a comment at the top indicating my name, the course number and section, the date, the assignment number, and possibly my student ID #, so the grader would know it’s my work and not someone elses. (My ID # was 99520… Yes, I still remember it 22 years later.)
What I would not do is ask Quorans to do my homework for me.
After all, I might end up with this technically correct answer…
#include <stdio.h>
int main() {
puts("I IV IX XVI XXV XXXVI XLIX LXIV LXXXI C");
}
…which may be fine as long as my professor is cool with Roman numerals, but is otherwise not going to do much good for my grade—neither on this assignment, nor on the midterm exam a week or two from now.
This is one of those questions that leaves you wondering "And then what?" The original question asked What is the program that will ask you to input a floating point number?. I'll quote my short answer here:
That’s pretty straightforward. I’ll implement it in bash:
#!/bin/bash
echo "Please input a floating point number:"
Now, this program is quite rude: It asks you to input the number, but it doesn’t bother to wait for your response.
But, then, that wasn’t part of the problem specification was it?
This is one of those questions that makes you ask:
Write an algorithm which takes a list of integers from 0 to 100 as arguments and returns the number which appears the most frequently in the list?
OK, let me get this straight: You want me to write an algorithm that takes a list of integers from 0 to 100, that is (0, 1, 2, 3, … 100), and then return which of those integers appears most often in that list.
None of the integers from 0 to 100 appears more frequently than any of the other integers in that list. Each of the 101 distinct values appears exactly once in that list.
You should ask your professor for a clarification on your homework assignment.
And, you should probably write the answer yourself, as you won’t get any pedagogical value from asking us here on Quora.
You might get some hilariously twisted code, though, if I write your homework answer for you.
This short answer does actually calculate the requested sum, and it does use
while and if statements.
int sum_evens_from_0_to_2n(const int n) {
while (true) {
if (true) {
return n * (n + 1);
}
}
}
Of course, Ira Perlow pointed out something I missed:
You realize that the range was not specified. So does that mean all even numbers? Does it include negative even numbers?
If it includes all positive and negative numbers, the sum is 0.
Otherwise it is infinity, which depending upon the language is represented different ways! :D
He's on the right track. However, Jonas Oberhaser threw a well deserved bucket of cold water on that reasoning, pointing out that the sum doesn't converge, because there's no particular reason you should pair values centered around zero.
That's what I thought — now suppose you take out the first 2 and add instead
your sum-2 = 0+ (-2)+4 + (-4)+6 + (-6)+8 +….. => infinity (by your logic)
Would you then say that 0-2 = infinity?
You can read more of that thread at the link below:
Original: How can I calculate the sum of even numbers using while loop and if statement using C++?
In this case, I offered unsastifying one line answers in 5 languages!
Perl:
@my_array = sort { $a <=> $b } @my_array;
Python:
my_array.sort();
C++:
std::sort(std::begin(my_array), std::end(my_array));
Bash:
my_array=($(echo "${my_array[@]}" | tr ' ' '\012' | sort -n))
Java:
import java.util.Arrays;
//....
Arrays.sort(my_array);
If I were to write this answer today, rather than many years ago, I might
focus on "a number" and offer a
digit_adaptor based solution
for sorting the digits within an integer.
Original: How can I write a program to sort a given number using an array?
I'm pretty sure they just wanted to know about fflush(stdout). But, I instead
interpreted this as "put all of my C source code for input and output on one
line."
#include <stdio.h>
#include <stdlib.h>
int main() { for (int c = 0; (c = getchar()) != EOF && putchar(c) != EOF; ) ; }
After all, it's funnier that way!
Original: How can I print input & output in the same line for C language?
I don't see many Pascal questions on Quora. Pascal has the interesting requirement that you name your program. I did not let that go unused.
Quoting my answer:
Easy:
program i_totally_didnt_ask_the_internet_to_do_my_homework_for_me;
begin
writeln(5050)
end.
OK, OK, you want it to compute the value. Fine. Let’s lean on good ol’ Carl Friedrich Gauss, then:
program i_wrote_this_myself_honest_and_didnt_get_it_from_quora;
begin
writeln(100 * (100 + 1) / 2) { Gauss' formula }
end.
This one ended up with a comment exchange with the OP:
Original Poster
aint funny
Joe Zbiciak
Neither is failing a class because you didn’t learn the lessons you’re intended to learn by doing your own homework.
They’re called exercises for a reason. They’re intended to make your skills stronger by having you exercise them.
If I lift weights, your muscles don’t get stronger. You have to lift the weights for that to happen.
Jonas Oberhauser
Or passing the class, then failing subsequent ones because the lessons you were intended to learn are used there in subtle ways… Not realizing why everyone else is moving past you so quickly while you’re having trouble with the most basic things… Very depressing to watch, because unlike not understanding one particular idea in class, it’s not something I can fix in 15 minutes.
Oleksandr Karimov
Disagree.
It is funny.
Of course, I answered:
C++, C, and FORTRAN are interpreted, and MATLAB is compiled.
- C++ interpreter.
- [C (and C++) interpreter](https://en.wikipedia.org/wiki/Ch_(computer_programming).
- MATLAB compiler.
- FORTRAN interpreter.
The opposite is also true.
Original: Which is interpreted language? a) C++. b) C. c) MATLAB. d) Fortran.
Quoting the original
#include <stdio.h>
int main() {
puts("I resign, you win.");
}
Oh, you want a strategy other than “give up”?
The original question had a comment as well:
You know, as opposed to running counter-clockwise. And who decided that?
My answer stated the obvious:
If they ran the other direction, that direction would be called clockwise.
🤔
The OP asked https://www.quora.com/What-kind-of-bank-doesnt-deal-with-money, to which I replied:
I can think of a few:
- River bank
- Memory bank
- A bank in the road
- Food bank
- Blood bank
- Sperm bank
- Seed bank
- Snow bank
I’m sure folks could come up with a few more.
The OP asked As a C programmer, what is one of the most useful functions you’ve ever written?. My answer was rather straightforward.
Without a doubt, I’d have to say
main().I’ve written many different versions of
main(), mind you. I customize it a little (or a lot) for each new C program I write.But, it’s so useful, every C program I write gets a copy of
main().
main(): Don’t go off to C without it.
The OP asked Can you implement any function recursively in C++? I suppose you could add trivial, meaningly recursion to anything. But I went a slightly different direction:
What would a recursive version of this function look like? How would you define its termination condition?
bool answer_to_this_question() {
return false;
}
Ta da.
The details of the question didn't really matter to my answer.
Hmmm. GW-BASIC?
cracks fingers
How quaint.
100 CLS
110 READ A: PRINT CHR$(A);: IF A > 10 GOTO 110
120 DATA 68, 111, 32, 121, 111, 117, 114, 32, 111, 119, 110
130 DATA 32, 104, 111, 109, 101, 119, 111, 114, 107, 33, 13, 10
If you guessed that prints Do your own homework!, collect your prize.
Here, I just reminded the OP that programming involves using what you already know. Quoting the original in its entirety:
You don’t need C++ for that. You need 5th grade algebra.
The average of a set of consecutive integers is equal to the largest integer plus the smallest integer in the range, divided by 2.
Work it out with pencil and paper: Pair the largest integer in the range with the smallest, and divide by 2. Now compare that to the result you get when you pair the next largest in the range with the next smallest. Wash, rinse, repeat.
What, you’re surprised programming involves reasoning outside the computer and working things out with pencil and paper? Don’t be. Programming isn’t just about typing.
The rest of your programming challenge is to define exactly what you mean by “first 10.”
I think once you work that out, you’ll realize you don’t have much of a program left to write. It’ll just print out the answer. But, that was your goal, right? No loop?
Original: How do I take the average of the first 10 integers in C++ without using a loop?
The OP asked In C++, why won’t it let you at certain times build and run the program?.
I devised a template that would succeed or fail compilation based on what time it was as one possible (if unlikely) explanation:
template <int i>
int heh() {
if constexpr (__TIME__[7] % 2) {
return i + heh<i - 1>();
}
return i;
}
int main() {
return heh<-1>();
}
And sure enough:
$ g++ -std=c++17 -c foo.cc
$ g++ -std=c++17 -c foo.cc
foo.cc: In instantiation of ‘int heh() [with int i = -900]’:
foo.cc:5:26: recursively required from ‘int heh() [with int i = -2]’
foo.cc:5:26: required from ‘int heh() [with int i = -1]’
foo.cc:11:18: required from here
foo.cc:5:26: fatal error: template instantiation depth exceeds maximum of 900 (use -ftemplate-depth= to increase the maximum)
return i + heh<i - 1>();
~~~~~~~~~~^~
$ g++ -std=c++17 -c foo.cc
$ g++ -std=c++17 -c foo.cc
$ g++ -std=c++17 -c foo.cc
foo.cc: In instantiation of ‘int heh() [with int i = -900]’:
foo.cc:5:26: recursively required from ‘int heh() [with int i = -2]’
foo.cc:5:26: required from ‘int heh() [with int i = -1]’
foo.cc:11:18: required from here
foo.cc:5:26: fatal error: template instantiation depth exceeds maximum of 900 (use -ftemplate-depth= to increase the maximum)
return i + heh<i - 1>();
~~~~~~~~~~^~
$ g++ -std=c++17 -c foo.cc
$
The OP asked: What is the number between 234,457.7 and 234,457.8?
Of course, I answered:
234,457.731415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989.
That is the number between 234,457.7 and 234,457.8. There is no other.
Ok, I take that back. Maybe there’s a few.
The OP wanted to make the speaker beep from assembly language. They didn't say anything about what platform they're on, what instruction set, or anything. Also, OP mentions a "beep function in C," but I wasn't aware C had such a thing.
I invoked Dealer's Choice of course, and I even provided three very different implementations. Here's my full answer:
You didn’t specify what machine or anything about the environment, so it’s dealer’s choice.
6502 on a 1MHz Apple ][:
oloop: BIT $C030
LDY #$FF
iloop: DEY
BNE iloop
BEQ oloop
CP-1610 on an Intellivision:
MVII #$100, R0
MVO R0, $1F0
SWAP R0
MVO R0, $1F4
MVII #$38, R0
MVO R0, $1F8
MVII #$F, R0
MVO R0, $1FB
CLRR R0
MVO R0, $1FC
MVO R0, $1FD
TMS9900 on the TI-99/4A: (Source.)
LI R0, >8400
LI R1, >8E0F
MOVB R1, *R0
SWPB R1
MOVB R1, *R0
LI R2, >9200
MOVB R2, *R0
Copyright © 2023, Joe Zbiciak [email protected]
SPDX-License-Identifier: CC-BY-SA-4.0