add 1111-1115 and 1168-1169

Author: tiny656

.editorconfig

@@ -4,5 +4,5 @@ root = true
 # all files
 [*]
 indent_style = tab
-indent_size = 4
+indent_size = 2
 charset = utf-8

PAT (Advanced Level) Practice/1168_Prime Day (20).py

@@ -0,0 +1,18 @@
+def isPrime(n):
+	if n == 1:
+		return False
+	for i in range(2, int(n**0.5)+1):
+		if n % i == 0:
+			return False
+	return True
+
+d = input()
+
+ok = True
+for i in range(len(d)):
+	t = d[i:]
+	r = isPrime(int(t))
+	ok &= r
+	print("{} {}".format(t, "Yes" if r else "No"))
+if ok:
+	print("All Prime!")

PAT (Advanced Level) Practice/1169_The Judger (25).cpp

@@ -0,0 +1,65 @@
+#include <iostream>
+#include <unordered_set>
+#include <vector>
+using namespace std;
+int main() {
+	ios::sync_with_stdio(false);
+	unordered_set<int> s, out;
+	int a, b, n, m;
+	cin >> a >> b;
+	s.insert(a);
+	s.insert(b);
+	cin >> n >> m;
+	vector<vector<int>> v(n, vector<int>(m));
+
+	for (int i = 0; i < n; i++) {
+		for (int j = 0; j < m; j++) {
+			cin >> v[i][j];
+		}
+	}
+
+	// for loop by round
+	for (int j = 0; j < m; j++) {
+		for (int i = 0; i < n; i++) {
+			// if player i is out, skip
+			if (out.find(i) != out.end()) continue; 
+
+			int t = v[i][j];
+			// if t is in s, player i is out
+			if (s.find(t) != s.end()) {
+				cout << "Round #" << j + 1 << ": " << i+1 << " is out." << endl;
+				out.insert(i);
+			} else {
+				// if t is not in s, check if t + any element in s is in s
+				bool isValid = false;
+				for (auto it = s.begin(); it != s.end(); it++) {
+					if (s.find(*it + t) != s.end()) {
+						isValid = true;
+						break;
+					}
+				}
+
+				// if t + any element in s is in s, player i is out
+				// else insert t into s
+				if (isValid) s.insert(t);
+				else {
+					cout << "Round #" << j + 1 << ": " << i+1 << " is out." << endl;
+					out.insert(i);
+				}
+			}
+		}
+	}
+
+	if (out.size() == (size_t)n) cout << "No winner." << endl;
+	else {
+		cout << "Winner(s):";
+		for (int i = 0; i < n; i++) {
+			if (out.find(i) == out.end()) {
+				cout << " " << i+1;
+			}
+		}
+		cout << endl;
+	}
+
+	return 0;
+}

PAT (Basic Level) Practice （中文）/1111_对称日 (15).py

@@ -0,0 +1,18 @@
+import datetime
+
+def isPalindromic(s):
+	return s == s[::-1]
+
+month = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec']
+
+n = int(input())
+for i in range(n):
+	s = input()
+	md, y = s.split(',')
+	y = y.strip().zfill(4)
+	m, d = md.split(' ')
+	m = str(month.index(m) + 1).zfill(2)
+	d = d.zfill(2)
+	date = y + m + d
+	print('Y' if isPalindromic(date) else 'N', end=' ')
+	print(date)

PAT (Basic Level) Practice （中文）/1112_超标区间 (20).py

@@ -0,0 +1,17 @@
+n, t = map(int, input().split())
+points = list(map(int, input().split()))
+
+m = max(points)
+if m <= t:
+	print(m)
+else:
+	begin = -1
+	for i in range(n):
+		if points[i] > t:
+			if begin == -1:
+				begin = i
+		if points[i] <= t and begin != -1:
+			print("[{}, {}]".format(begin, i-1))
+			begin = -1
+	if begin != -1:
+		print("[{}, {}]".format(begin, n-1))

PAT (Basic Level) Practice （中文）/1113_钱串子的加法 (20).py

@@ -0,0 +1,21 @@
+bs="0123456789abcdefghijklmnopqrstuvwxyz"
+
+def add(a, b, base):
+	a, b = a[::-1], b[::-1]
+	c = ""
+	carry = 0
+	for i in range(max(len(a), len(b))):
+		if i < len(a):
+			carry += bs.index(a[i])
+		if i < len(b):
+			carry += bs.index(b[i])
+		c += bs[carry % base]
+		carry //= base
+	if carry:
+		c += bs[carry]
+	while len(c) > 1 and c[-1] == "0":
+		c = c[:-1]
+	return c[::-1]
+
+a, b = input().split()
+print(add(a, b, 30))

PAT (Basic Level) Practice （中文）/1114_全素日 (20).py

@@ -0,0 +1,18 @@
+def isPrime(n):
+	if n == 1:
+		return False
+	for i in range(2, int(n**0.5)+1):
+		if n % i == 0:
+			return False
+	return True
+
+d = input()
+
+ok = True
+for i in range(len(d)):
+	t = d[i:]
+	r = isPrime(int(t))
+	ok &= r
+	print("{} {}".format(t, "Yes" if r else "No"))
+if ok:
+	print("All Prime!")

PAT (Basic Level) Practice （中文）/1115_裁判机 (25).cpp

@@ -0,0 +1,65 @@
+#include <iostream>
+#include <unordered_set>
+#include <vector>
+using namespace std;
+int main() {
+	ios::sync_with_stdio(false);
+	unordered_set<int> s, out;
+	int a, b, n, m;
+	cin >> a >> b;
+	s.insert(a);
+	s.insert(b);
+	cin >> n >> m;
+	vector<vector<int>> v(n, vector<int>(m));
+
+	for (int i = 0; i < n; i++) {
+		for (int j = 0; j < m; j++) {
+			cin >> v[i][j];
+		}
+	}
+
+	// for loop by round
+	for (int j = 0; j < m; j++) {
+		for (int i = 0; i < n; i++) {
+			// if player i is out, skip
+			if (out.find(i) != out.end()) continue; 
+
+			int t = v[i][j];
+			// if t is in s, player i is out
+			if (s.find(t) != s.end()) {
+				cout << "Round #" << j + 1 << ": " << i+1 << " is out." << endl;
+				out.insert(i);
+			} else {
+				// if t is not in s, check if t + any element in s is in s
+				bool isValid = false;
+				for (auto it = s.begin(); it != s.end(); it++) {
+					if (s.find(*it + t) != s.end()) {
+						isValid = true;
+						break;
+					}
+				}
+
+				// if t + any element in s is in s, player i is out
+				// else insert t into s
+				if (isValid) s.insert(t);
+				else {
+					cout << "Round #" << j + 1 << ": " << i+1 << " is out." << endl;
+					out.insert(i);
+				}
+			}
+		}
+	}
+
+	if (out.size() == (size_t)n) cout << "No winner." << endl;
+	else {
+		cout << "Winner(s):";
+		for (int i = 0; i < n; i++) {
+			if (out.find(i) == out.end()) {
+				cout << " " << i+1;
+			}
+		}
+		cout << endl;
+	}
+
+	return 0;
+}