AcWing 第 17 场周赛

Author: EndlessCheng

misc/acwing/README.md

@@ -19,3 +19,5 @@ Compiler info: go1.13.6, linux, amd64
 |[第 13 场周赛](https://www.acwing.com/activity/content/competition/problem_list/65/)|3/3|2|
 |[第 14 场周赛](https://www.acwing.com/activity/content/competition/problem_list/68/)|3/3|1|
 |[第 15 场周赛](https://www.acwing.com/activity/content/competition/problem_list/69/)|3/3|1|
+|[第 16 场周赛](https://www.acwing.com/activity/content/competition/problem_list/70/)|3/3|2|
+|[第 17 场周赛](https://www.acwing.com/activity/content/competition/problem_list/71/)|-|-|

misc/acwing/weekly/17/a/a.go

@@ -0,0 +1,28 @@
+package main
+
+import (
+	"bufio"
+	. "fmt"
+	"io"
+	"os"
+)
+
+// github.com/EndlessCheng/codeforces-go
+func run(_r io.Reader, _w io.Writer) {
+	in := bufio.NewReader(_r)
+	out := bufio.NewWriter(_w)
+	defer out.Flush()
+
+	var T, n, k, v int
+	for Fscan(in, &T); T > 0; T-- {
+		ans := 100
+		for Fscan(in, &n, &k); n > 0; n-- {
+			if Fscan(in, &v); k%v == 0 && k/v < ans {
+				ans = k / v
+			}
+		}
+		Fprintln(out, ans)
+	}
+}
+
+func main() { run(os.Stdin, os.Stdout) }

misc/acwing/weekly/17/a/a_test.go

@@ -0,0 +1,31 @@
+package main
+
+import (
+	"bufio"
+	. "fmt"
+	"io"
+	"os"
+)
+
+// github.com/EndlessCheng/codeforces-go
+func run(_r io.Reader, out io.Writer) {
+	in := bufio.NewReader(_r)
+	var n, m, v, ans int
+	Fscan(in, &n, &m)
+	cnt := make([][2]int, m)
+	for ; n > 0; n-- {
+		c := [2]int{}
+		for j := 0; j < m; j++ {
+			Fscan(in, &v)
+			c[v]++
+			cnt[j][v]++
+		}
+		ans += 1<<c[0] + 1<<c[1] - 2 // 去掉空集
+	}
+	for _, c := range cnt {
+		ans += 1<<c[0] + 1<<c[1] - c[0] - c[1] - 2 // 去掉只有一个元素的集合，以及空集
+	}
+	Fprint(out, ans)
+}
+
+func main() { run(os.Stdin, os.Stdout) }

misc/acwing/weekly/17/b/b.go

@@ -0,0 +1,40 @@
+package main
+
+import (
+	"bufio"
+	. "fmt"
+	"io"
+	"os"
+	"sort"
+)
+
+// github.com/EndlessCheng/codeforces-go
+func run(_r io.Reader, out io.Writer) {
+	in := bufio.NewReader(_r)
+	var n, m, ans int
+	Fscan(in, &n, &m)
+	a := make([]int, n)
+	for i := range a {
+		Fscan(in, &a[i])
+	}
+	b := make([]int, m)
+	for i := range b {
+		Fscan(in, &b[i])
+	}
+	for _, v := range a {
+		i := sort.SearchInts(b, v)
+		d := int(2e9)
+		if i < m {
+			d = b[i] - v
+		}
+		if i > 0 && v-b[i-1] < d {
+			d = v - b[i-1]
+		}
+		if d > ans {
+			ans = d
+		}
+	}
+	Fprint(out, ans)
+}
+
+func main() { run(os.Stdin, os.Stdout) }