汇编写算法

汇编写算法

二分

C++原版

#include<iostream>
using namespace std;
int main() {
	int n;
	cin >> n;
	int left = 0, right = n;
	while (left < right) {
		int mid = left + right + 1 >> 1;
		if (mid * mid <= n) left = mid;
		else right = mid - 1;
	}
	cout << left << endl;
	return 0;
} 

C++改版

//二分
#include<iostream>
using namespace std;
int main() {
	int s1;
	cin >> s1;
	int t1 = 0, t2 = s1;
	while (t1 < t2) {
		int t3 = t1 + t2 + 1 >> 1;
		int t4 = t3 * t3;
		if (t4 <= s1) t1 = t3;
		else t2 = t3 - 1;
	}
	cout << t1 << endl;
	return 0;
} 

汇编

.data

.text
	li $v0, 5
	syscall
	move $s1, $v0
	addi $t1, $t1, 0
	addi $t2, $s1, 0
loop:	bge $t1, $t2, end
	add $t3, $t1, $t2
	addi $t3, $t3, 1
	div $t3, $t3, 2
	mul $t4, $t3, $t3
	bgt $t4, $s1, else
		addi $t1, $t3, 0
		b go
	else:	addi $t2, $t3, -1
	go:
	b loop
end:	li $v0, 1
	move $a0, $t1
	syscall     

#include<iostream>
using namespace std;
char arr[100000], cnt;
char op[16] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
int main() {
	int n, num;
	cin >> n >> num;
	while (n > 0) {
		int t = n % num;
		n /= num;
		arr[cnt++] = t;
	}
	for (int i = 0; i < cnt; i++)
		cout << op[arr[i]];
	return 0;
}