Add silvers

dev-jelly · dev-jelly · commit d65127465e63 · 2021-09-12T23:35:36.000+09:00
diff --git a/boj/1010/main/main.go b/boj/1010/main/main.go
@@ -5,27 +5,30 @@ import (
 	"math/big"
 )
 
-func fac(n big.Int, lim big.Int) *big.Int {
-	var m = new(big.Int)
-	if n.Cmp(&lim) <= 0 {
-		return m.SetInt64(int64(1))
-
+func fac(n *big.Int) *big.Int {
+	if n.Cmp(big.NewInt(1)) <= 0 {
+		return big.NewInt(1)
 	}
-	m.SetInt64(int64(1))
-	m = n.Sub(&n, m)
-	return n.Mul(&n, fac(*m, lim))
+
+	var m = big.NewInt(1)
+	sub := new(big.Int)
+	sub = sub.Sub(n, m)
+	a := big.NewInt(1)
+	return a.Mul(n, fac(sub))
 }
 
 func main() {
 	var t int
+
 	fmt.Scanf("%d", &t)
 	for i := 0; i < t; i++ {
-		var a, b big.Int
-		fmt.Scanf("%d %d", &a, &b)
-		fmt.Println(fac(b, a))
-		var lim = new(big.Int)
-		lim = lim.SetInt64(int64(1))
-		fmt.Println(lim.Div(fac(b, a), fac(a, *lim)).Text(10))
+		var n, k big.Int
+		fmt.Scanf("%d %d", &k,	 &n)
+		ans := new(big.Int)
+		sub := new(big.Int)
+		sub = sub.Sub(&n, &k)
+		ans = ans.Div(fac(&n), ans.Mul(fac(&k), fac(sub)))
 
+		fmt.Println(ans.Text(10))
 	}
 }
diff --git a/boj/1037/main/main.go b/boj/1037/main/main.go
@@ -0,0 +1,37 @@
+package main
+
+import (
+	"fmt"
+	"sort"
+)
+
+func main() {
+	var n int
+	var y int
+	var big uint64 = 1
+	fmt.Scan(&n)
+	a :=1
+	var s []int
+	if n == 0 {
+		fmt.Println(1)
+		return
+	}
+	if n == 1{
+		fmt.Scan(&y)
+		fmt.Println(y)
+	}
+	for i := 0; i < n; i++ {
+		fmt.Scan(&y)
+		big *= uint64(y)
+		s = append(s, y)
+	}
+	sort.Ints(s)
+	mostBig := uint64(s[len(s)-1])
+	var i uint64 = mostBig
+	var candis []uint64
+	for ; i <= big; i += mostBig {
+		candis = append(candis, mostBig)
+	}
+
+	fmt.Println(a)
+}
diff --git a/boj/2167/retry/main.go b/boj/2167/retry/main.go
@@ -0,0 +1,47 @@
+package main
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+)
+
+var reader = bufio.NewReader(os.Stdin)
+var writer = bufio.NewWriter(os.Stdout)
+
+func main() {
+	defer writer.Flush()
+	var n, m int
+	fmt.Fscan(reader, &n, &m)
+
+	arr := make([][]int, n)
+
+	for i := 0; i < n; i++ {
+		arr[i] = make([]int, m)
+		var num int
+		fmt.Fscan(reader, &num)
+		arr[i][0] = num
+		for j := 1; j < m; j++ {
+			fmt.Fscan(reader, &num)
+			arr[i][j] = arr[i][j-1] + num
+		}
+	}
+
+	var k int
+	fmt.Fscan(reader, &k)
+	for i := 0; i < k; i++ {
+		var x1, y1, x2, y2 int
+		fmt.Fscan(reader, &x1, &y1, &x2, &y2)
+		var sum int
+		yFirst := y1-2
+		yLast := y2-1
+		for j := x1 - 1; j < x2; j++ {
+			if yFirst == -1 {
+				sum += arr[j][yLast]
+			} else {
+				sum += arr[j][yLast] - arr[j][yFirst]
+			}
+		}
+		fmt.Fprintf(writer, "%d\n", sum)
+	}
+}
