# int test_prime(int n)
# {
#   int i;
#
#   for (i = 2; i < n; i++){
#     if (n % i == 0)
#       return 0;
#   }
#   return 1;
# }

	.text
	.align	2

test_prime:				# int test_prime(int n = $a0)

	li	$a1,2			# i = 2

loop:
	slt	$v0,$a1,$a0		# if !(i < n)
	beq	$v0,$zero,return1	#   return 1

	div	$a0,$a1			#
	mfhi	$v0			# $v0 = n % i
	beq	$v0,$zero,return0	# if ($v0 == 0) return 0

	addu	$a1,$a1,1		# i++
	j	loop			# goto loop

return0:
	li	$v0,0
	j	$ra
return1:
	li	$v0,1
	j	$ra


#  main()
#  {
#    int match = 0, n = 2;
#    while (match < 100){
#      if (test_prime(n) == 1){
#        print_int(n);
#        print_string(" ");
#        match++;
#        if (match % 10 == 0)
#          print_string("\n")
#      }
#      n++;
#    }
#    print_string("\n");
#    return;
#  }