diff --git "a/\351\242\230.html" "b/\351\242\230.html"
new file mode 100644
index 0000000000000000000000000000000000000000..a94408a5704f3b4084e3880027ea2fcce4e95541
--- /dev/null
+++ "b/\351\242\230.html"
@@ -0,0 +1,163 @@
+<!DOCTYPE html>
+<html>
+	<head>
+		<meta charset="utf-8" />
+		<title></title>
+	</head>
+	<body>
+		<script>
+			//第一题
+			let a = 5
+			let b = 4
+			function bijiao(a,b){
+				if(a > b) {
+					return a
+				}else {
+					return b
+				}
+			}
+			let num = bi(a, b)
+			console.log(num)
+			//第二题
+			function prime(num) {
+				temp = false
+				for (let i = 2;i <= num ; i++ ){
+					if (num % i == 0){
+						temp = true
+					}
+					if (temp == true){
+						return true
+					}
+					return false
+				}
+			}
+			let n = prime(2)
+			console.log(n)
+			//第三题
+			let arr = [];
+			
+			function zhiShu(a, b) {
+				for (let i = a; i <= b; i++) {
+					if (i == 1) {
+						continue;
+					}
+					let count = 0;
+					for (let j = 2; j < i; j++) {
+						let c = i / j;
+						if (c % 1 === 0) {
+							count++;
+						}
+					}
+					if (count == 0) {
+						arr.push(i);
+					}
+				}
+				console.log(arr);
+			}
+			zhiShu(1, 1000);
+			//第四题
+			function bi(a,b,c){
+				if(a > b && a > c) {
+					return a
+				}else if(b>a && b>c){
+					return b
+				}else{
+					return c
+				}
+			}
+			let num = bi(6,4,5)
+			console.log(num)
+			//第五题
+			function water(num) {
+					g = num % 10
+					s = parseInt(num / 10) % 10
+					b = parseInt(num / 100)
+					w = g * g * g + s * s * s + b * b * b
+					if (w == num) {
+						console.log(true)
+					}else if (w != num){
+						console.log(false)
+					}
+				}
+			water(153)
+			//第六题
+			function water(num) {
+				let g = num % 10
+				let s = parseInt(num / 10) % 10
+				let b = parseInt(num / 100)
+				let w = g * g * g + s * s * s + b * b * b
+				if (w == num) {
+					return true;
+				} else if (w != num) {
+					return false;
+				}
+			}
+			function xain(a, b) {
+				
+				let x = 0;
+				for (let i = a; i < b; i++) {
+					if (water(i)) {
+						arr[x] = i;
+						x++;
+					}
+				
+				}
+			}
+			let arr = [];
+			xain(100, 1000);
+			for (let i = 0; i < arr.length; i++) {
+				console.log(arr[i]);
+			}
+			//第七题
+			function reverse(str) {
+				var result = "";//赋空值
+				if (str.length == 0) {
+					return null;
+				}
+				for (var i = str.length - 1; i >= 0; i--) {
+					result += str.charAt(i);
+				}
+				return result;
+			}
+			let n=reverse("15264")
+			console.log(n)
+			//第八题
+			function oushu(num){
+				while (num != 0){
+					temp = num%10
+					num = parseInt(num / 10)
+					if (temp % 2 == 0){
+						return true
+					}else if(temp%2==1){
+						return false
+					}
+				}
+			}
+			m=oushu(12)
+			console.log(m)
+			//第九题
+			<script>
+				let svm = 0
+				function oushu(n,m){
+					while (n != m){
+						if (n % 2 == 0){
+							svm += 1
+						}
+					}
+				}
+				s=oushu(1,10)
+				console.log(s)
+			//第十题
+			function sortNumber(a, b) {
+				return a - b
+			}
+			var arr = new Array(3)
+			arr[0] = "4"
+			arr[1] = "6"
+			arr[2] = "5"
+			document.write(arr + "<br />")
+			document.write(arr.sort(sortNumber))
+		</script>
+	</body>
+</html>
+