Hello i have this code thats not written out in the write form can someone rearrange it for me quickly Thank you

.file 1 “” .section .mdebug.abi32 .previous .nan legacy .module fp=32 .module nooddspreg .abicalls .rdata .align 2 $LC0: .ascii “Enter number of elements in array00” .align 2 $LC1: .ascii “%d00” .align 2 $LC2: .ascii “Enter %d integers1200” .align 2 $LC3: .ascii “Minimum element is present at location %d and its value ” .ascii “is %d.1200” .text .align 2 .globl main .set nomips16 .set nomicromips .ent main .type main, @function main: .frame $fp,448,$31 # vars= 416, regs= 2/0, args= 16, gp= 8 .mask 0xc0000000,-4 .fmask 0x00000000,0 .set noreorder .cpload $25 .set nomacro addiu $sp,$sp,-448 sw $31,444($sp) sw $fp,440($sp) move $fp,$sp .cprestore 16 movz $31,$31,$0 li $2,1 # 0x1 sw $2,32($fp) lw $2,%got($LC0)($28) nop addiu $4,$2,%lo($LC0) lw $2,%call16(puts)($28) nop move $25,$2 .reloc 1f,R_MIPS_JALR,puts 1: jalr $25 nop lw $28,16($fp) addiu $2,$fp,436 move $5,$2 lw $2,%got($LC1)($28) nop addiu $4,$2,%lo($LC1) lw $2,%call16(__isoc99_scanf)($28) nop move $25,$2 .reloc 1f,R_MIPS_JALR,__isoc99_scanf 1: jalr $25 nop lw $28,16($fp) lw $2,436($fp) nop move $5,$2 lw $2,%got($LC2)($28) nop addiu $4,$2,%lo($LC2) lw $2,%call16(printf)($28) nop move $25,$2 .reloc 1f,R_MIPS_JALR,printf 1: jalr $25 nop lw $28,16($fp) sw $0,28($fp) b $L2 nop $L3: addiu $3,$fp,36 lw $2,28($fp) nop sll $2,$2,2 addu $2,$3,$2 move $5,$2 lw $2,%got($LC1)($28) nop addiu $4,$2,%lo($LC1) lw $2,%call16(__isoc99_scanf)($28) nop move $25,$2 .reloc 1f,R_MIPS_JALR,__isoc99_scanf 1: jalr $25 nop lw $28,16($fp) lw $2,28($fp) nop addiu $2,$2,1 sw $2,28($fp) $L2: lw $2,436($fp) lw $3,28($fp) nop slt $2,$3,$2 bne $2,$0,$L3 nop lw $2,36($fp) nop sw $2,24($fp) li $2,1 # 0x1 sw $2,28($fp) b $L4 nop $L6: lw $2,28($fp) nop sll $2,$2,2 addiu $3,$fp,24 addu $2,$3,$2 lw $3,12($2) lw $2,24($fp) nop slt $2,$3,$2 beq $2,$0,$L5 nop lw $2,28($fp) nop sll $2,$2,2 addiu $3,$fp,24 addu $2,$3,$2 lw $2,12($2) nop sw $2,24($fp) lw $2,28($fp) nop addiu $2,$2,1 sw $2,32($fp) $L5: lw $2,28($fp) nop addiu $2,$2,1 sw $2,28($fp) $L4: lw $2,436($fp) lw $3,28($fp) nop slt $2,$3,$2 bne $2,$0,$L6 nop lw $6,24($fp) lw $5,32($fp) lw $2,%got($LC3)($28) nop addiu $4,$2,%lo($LC3) lw $2,%call16(printf)($28) nop move $25,$2 .reloc 1f,R_MIPS_JALR,printf 1: jalr $25 nop lw $28,16($fp) move $2,$0 move $sp,$fp lw $31,444($sp) lw $fp,440($sp) addiu $sp,$sp,448 j $31 nop .set macro .set reorder .end main .size main, .-main .ident “GCC: (Ubuntu 5.4.0-6ubuntu1~16.04.9) 5.4.0 20160609”

lore – Are there canonical examples of texts written in Elvish?

I am referring to the Elven language of the Forgotten Realms, generally written with the Espruar script. Are there examples of messages, poems, paragraphs, …? Specifically, those that make sense in the language, not just random letters from the Espruar script.

My first proof of linear algebra – is it accurate and written correctly?

This is the first proof exercise of "linear algebra as an introduction to abstract mathematics". This is also my first proof (apart from proving things like the properties of integers and trigonometric identities). I hope someone can criticize it and let me know what I did well or what I did wrong.

Problem: Let a, b, c and d be real numbers. Consider the system of equations (1):
$$ ax_1 + bx_2 = 0 $$
$$ cx_1 + dx_2 = 0 $$

Note that $ x_1 = x_2 = $ 0 is a solution for any choice of a, b, c and d.
Prove that, if $ ad-bc neq0 $, then $ x_1 = x_2 = $ 0 is the only solution.

Evidence: We will prove by contrapositive. Presume $ x_1 = x_2 = $ 0 is not the only solution. Presume
$$ A = begin {bmatrix} a & b \ c & d end {bmatrix}, X = begin {bmatrix} x_1 \ x_2 end {bmatrix}, 0 = begin {bmatrix} 0 \ 0 end {bmatrix} $$
Then the system of equations (1) is equivalent to the expression $ AX = 0 $. For $ AX = 0 $ to be true we must have either $ A = 0 $ or $ X = 0 $. Since we assume $ x_1 = x_2 = $ 0 is not the only solution, we assume $ X neq0 $. Then for $ AX = 0 $ to be true we must have $ A = 0 $, and so, $ a = b = c = d = 0 $. Yes $ a = b = c = d = 0 $, then $ ab-cd = 0 $. $ blacksquare $

What is the command to see which files in Linux are currently being written or read?

Just like the top command which indicates which process is running in the system and what does it do like
which process is running and takes CPU. I want to know in the running system what the system is currently doing with the file, like where is it writing to disk space? I don't want to use the watch command because I'm talking about the whole system as it is right now or in the whole file system any file is read or written. If reading is not available, I'm fine, but writing is really important to me.
I am trying to check the health of their system and I want to monitor which files are currently written to the file system.

Google SHEET script where the text TOTAL SALE "should be automatically written in the last non-empty cell of a column at night 1

DEAR HELP,
I want a ** Google SHEET script in which the text TOTAL SALE "should be automatically written in the last non-empty cell of a column
(H: H) at a specific time or at night 1
HELP ME> THANKS IN ADVANCE **
IRS

Snake game in the terminal, written in Python

I recently wrote a snake game. I wanted to keep it in a pure terminal, without libraries like pygame, tkinter or curses. It works fine, but I know the code could be improved. I am a rather junior programmer, and this is my first attempt at & # 39; gamedev & # 39;, because currently I am learning Django. I would be grateful if you would tell me what I should change 🙂 Here is my code:

#!/usr/bin/python3
import random
import time
import keyboard
import collections


class Board:
    def __init__(self, width: int, height: int, speed: float):
        self.WIDTH = width
        self.HEIGHT = height
        self.SPEED = speed
        self.board = self.__create_board()

    def __create_board(self) -> list:
        return (("□" for _ in range(self.WIDTH)) for _ in range(self.HEIGHT))

    def print_board(self) -> None:
        print('n')
        for row in self.board:
            print(row)


class Snake:
    def __init__(self, x_pos, y_pos):
        self.x_pos = x_pos
        self.y_pos = y_pos
        self.head_pos = (self.x_pos, self.y_pos)

        self.body_segments = collections.deque()  # doubly end operations, faster than lists
        self.length = 0
        self.apple_pos = (0, 0)
        self.coords = (0, 0)
        self.ate = False
        self.direction = 'up'
        self.spawn_apple()

    def set_empty_square(self) -> None:
        board_obj.board(self.y_pos)(self.x_pos) = "□"

    def set_head(self) -> None:
        board_obj.board(self.y_pos)(self.x_pos) = "■"

    def draw_body(self) -> None:
        self.body_segments.appendleft(self.coords)
        board_obj.board(self.body_segments(0)(1))(self.body_segments(0)(0)) = "&"
        if not self.ate:
            board_obj.board(self.body_segments(self.length)(1))(self.body_segments(self.length)(0)) = "□"
            self.set_head()
            self.body_segments.pop()

    def move(self) -> None:
        self.coords = (self.x_pos, self.y_pos)
        self.set_empty_square()

        if self.direction == "right":
            self.x_pos += 1
        if self.direction == "left":
            self.x_pos -= 1
        if self.direction == "up":
            self.y_pos -= 1
        if self.direction == "down":
            self.y_pos += 1

        self.set_head()
        if self.length >= 1:
            self.draw_body()

        self.head_pos = (self.x_pos, self.y_pos)

    def spawn_apple(self) -> None:
        x = random.randint(0, board_obj.WIDTH-2)
        y = random.randint(0, board_obj.HEIGHT-2)
        apple_pos = (x, y)
        if apple_pos in self.body_segments or apple_pos == self.head_pos:
            self.spawn_apple()  # if apple spawned in snake, then run func again with recursion and quit current func
            return
        self.apple_pos = (x, y)
        board_obj.board(y)(x) = "●"

    def eat_apple(self) -> None:
        self.length += 1
        self.ate = True

    def collision(self) -> bool:
        return self.head_pos in self.body_segments or self.y_pos in (board_obj.HEIGHT-1, -1) 
                or self.x_pos in (board_obj.WIDTH-1, -1)


def on_press(_: None):
    for code in keyboard._pressed_events:
        if code == 105:
            snake.direction = 'left'
        elif code == 106:
            snake.direction = 'right'
        elif code == 103:
            snake.direction = 'up'
        elif code == 108:
            snake.direction = 'down'


def start_game(snake: Snake, board_obj: Board):
    snake.set_head()
    board_obj.print_board()
    keyboard.hook(on_press)
    while not snake.collision():
        print("SNAKE: ", snake.head_pos)
        print("BODY: ", snake.body_segments)
        print("APPLE: ", snake.apple_pos)

        snake.move()
        board_obj.print_board()
        snake.ate = False
        if snake.head_pos == snake.apple_pos:
            snake.eat_apple()
            snake.spawn_apple()
        time.sleep(board_obj.SPEED)
    print(f"Game over! Points: {snake.length}")


if __name__ == "__main__":
    board_obj = Board(8, 8, 0.3)  # Set: width, height, speed
    snake = Snake(int(board_obj.WIDTH / 2), int(board_obj.HEIGHT / 2))  # Set: snake x and y position

    start_game(snake, board_obj)

```

graphics – Manipulate does not work if an equation with a variable parameter is not explicitly written

I have a little problem with the Manipulate command.

I am trying to write the control parameters of a function which is entered in this command in an unexplicit way. But in this case, the variable parameter "does not hang" on the function and the command does not work.

I will show what I mean.

In this case, the control functions correctly.

Manipulate(Plot(Sin(2*(x + x^Sin(1*a))), {x, 0, 30}), {a, 0, 10})

enter description of image here

In this case, nothing happens.

f = Sin(2*(x + x^Sin(1*a)))

Manipulate(Plot(f, {x, 0, 30}), {a, 0, 10})

enter description of image here

At the same time, RegionPlot3D, SurfacePlot3D, etc. work successfully according to my needs.

What am i doing wrong?

EASTER SPECIAL: 25 niche articles written for $ 50

A native American English writer will create 25 unique articles of 500 words in your specific niche, in the categories of business, health or lifestyle news. This is a bulk order, don't ask for this special rate for individual items here and there (my normal rate is $ 2/100 words). No product reviews. Articles are suitable for site content, Web 2.0 articles, or guest articles.

After receiving your niche topic, keywords and payment, I can submit the articles to you, or I can post directly to your WordPress blog. Paypal preferred. Samples on request. Please send me a pm if you are interested. No Skype.
SEMrush

Nonsense program written in GB

I wanted to play with Go and wondered how I was doing.
What do you think?

https://github.com/MattIzSpooky/goroutines

I also really wonder how to improve this.

func (s Spammer) Start() error {
    var err error

    go func() {
        for {
            select {
            case <-s.closeChan:
                return
            default:
                if error2 := s.spam(); error2 != nil {
                    err = error2
                    s.Stop()
                    break
                }
                time.Sleep(250 * time.Millisecond)
            }
        }
    }()

    if err != nil {
        return err
    }

    return nil
}

syntax – MakeExpression: input form error even with perfectly written expressions

enter description of image here

I am frustrated by this MakeExpression error which appears sometimes and sometimes not for perfectly written expressions. How can I resolve this error? What is wrong with my code?

ClearAll("Global`*")
q := 1.6*10^-19; (* Electron charge in Coulomb *)
me := 9.1*10^-31; (* Free electron rest mass in kg *)
h := 6.63*10^-34;  (* Reduced Planck's constant in J.s *)
kb := 1.38*10^-23; (* Boltzmann constant in J/K *)
FD(d_, (Eta)_) := -PolyLog(
    d + 1, -E^(Eta));(* Defining the Fermi-Dirac integrals *)
Nc(d_, t_, (Alpha)_, gs_, gv_, T_) := 
 2*gs*gv*((kb*T)/(Alpha))^(d/t)* 1/(2*(Pi)^0.5)^d*1/t*Gamma(d/t)/
  Gamma(d/2);  (* Effective band-edge DOS in d dimensions *)
n(d_, t_, (Alpha)_, gs_, gv_, T_, (Eta)F_) := 
 Nc(d, t, (Alpha), gs, gv, T)*
  FD((d - t)/
   t, (Eta)F)*(100)^-d; (* Effective SI carrier density in d 
dimensions in cm units*)

```