add 1101-1104, 1106-1110

Author: tiny656

.vscode/build.bat

@@ -1,6 +1,6 @@
 @echo off
 pushd %cd%
-call "C:\Program Files (x86)\Microsoft Visual Studio\2019\Enterprise\VC\Auxiliary\Build\vcvarsall.bat" x64
+call "C:\Program Files\Microsoft Visual Studio\2022\Enterprise\VC\Auxiliary\Build\vcvarsall.bat" x64
 popd
 echo %cd%
 set compilerflags=/Od /EHsc /Zi

PAT (Basic Level) Practise （中文）/1101_B是A的多少倍 (15).py

@@ -0,0 +1,4 @@
+a, d = input().split()
+d = int(d)
+b = int(a[-d:] + a[:-d])
+print("%.2f" % (b/int(a)))

PAT (Basic Level) Practise （中文）/1102_教超冠军卷 (20).py

@@ -0,0 +1,18 @@
+n = int(input())
+tot = [0, 0]
+ans = [None, None]
+for i in range(n):
+    id, price, count = input().split()
+    price, count = int(price), int(count)
+    if count >= tot[0]:
+        tot[0] = count
+        ans[0] = id
+    
+    if count * price >= tot[1]:
+        tot[1] = count * price
+        ans[1] = id
+
+print("%s %d" % (ans[0], tot[0]))
+print("%s %d" % (ans[1], tot[1]))
+
+

PAT (Basic Level) Practise （中文）/1103_缘分数 (20).py

@@ -0,0 +1,29 @@
+def is_square(x):
+    lo, hi = 1, x
+    while lo <= hi:
+        mid = (lo + hi) // 2
+        if mid * mid == x: return True
+        elif mid * mid > x: hi = mid - 1
+        else: lo = mid + 1
+    return False
+
+
+m, n = map(int, input().split()) 
+
+ans = []
+for a in range(m, n+1):
+    c_2 = a*a*a - (a-1)*(a-1)*(a-1)
+    if not is_square(c_2): continue
+    c = int(c_2**0.5)
+
+    t = 2*c-1
+    if not is_square(t): continue
+    t_0_5 = int(t**0.5)
+    if t_0_5 % 2 == 0: continue
+    b = (1+t_0_5) // 2
+    if b <= 0 or b == 1: continue # (1, 1) is not a valid result ????
+    ans.append("%d %d" % (a, b))
+if not ans:
+    print("No Solution")
+else:
+    print('\n'.join(ans))

PAT (Basic Level) Practise （中文）/1104_天长地久 (20).py

@@ -0,0 +1,49 @@
+# search pruning for below conditions
+# 1. search set size greater than k
+# 2. sum of search set greater than m
+# 3. sum of current search set plus remaining all '9' numbers still less than m
+
+def search(s, k, m, results):
+    sum_s = sum(s)
+    if (len(s) > k or sum_s > m or sum_s + (k - len(s)) * 9 < m): return
+    if len(s) == k and sum_s == m:
+        results.append(int("".join(map(str, s))))
+        return
+
+    start = 1 if len(s) == 0 else 0
+    for i in range(start, 10):
+        s.append(i)
+        search(s, k, m, results)
+        s.pop(-1)
+
+def gcd(a, b):
+    if b == 0: return a
+    else: return b if a % b == 0 else gcd(b, a%b)
+
+def is_prime(n):
+    lo = 2
+    hi = int(n**0.5)+1
+    for i in range(lo, hi):
+        if n % i == 0: return False
+    return True
+
+n = int(input())
+for i in range(n):
+    k, m = map(int, input().split())
+    results = []
+    search([], k, m, results)
+    print("Case %d" % (i+1))
+    ans = []
+    is_ok = False
+    for r in results:
+        m1 = sum(map(int, list(str(r+1))))
+        g = gcd(m, m1)
+        if g > 2 and is_prime(g):
+            is_ok = True
+            ans.append((m1, r))
+        
+    if not is_ok:
+        print("No Solution")
+    else:
+        ans.sort(key=lambda x:(x[0], x[1]))
+        print("\n".join(map(lambda x: "%d %d" % (x[0], x[1]), ans)))

PAT (Basic Level) Practise （中文）/1106_2019数列 (15).py

@@ -0,0 +1,8 @@
+f = [2, 0, 1, 9]
+ans = ""
+n = int(input())
+for i in range(n):
+    if i >= 4:
+        f[i%4] = sum(f) % 10
+    ans += str(f[i%4])
+print(ans)

PAT (Basic Level) Practise （中文）/1107_老鼠爱大米 (20).py

@@ -0,0 +1,8 @@
+n, m = map(int, input().split())
+ans = []
+for i in range(n):
+    g = map(int, input().split())
+    ans.append(max(g))
+
+print(" ".join(map(str, ans)))
+print(max(ans))

PAT (Basic Level) Practise （中文）/1108_String复读机 (20).py

@@ -0,0 +1,14 @@
+s = input()
+count = {}
+for ch in s:
+    if ch in "String":
+        count[ch] = count.get(ch, 0) + 1
+
+ans = []
+while sum(count.values()) != 0:
+    for ch in "String":
+        if count.get(ch, 0) > 0:
+            ans += ch
+            count[ch] -= 1
+
+print("".join(ans))

PAT (Basic Level) Practise （中文）/1109_擅长C (20).py

@@ -0,0 +1,37 @@
+import string
+alphabet = {}
+for ch in string.ascii_uppercase:
+    alphabet[ch] = []
+    for i in range(7):
+        alphabet[ch].append(input())
+
+word = ""
+words = []
+sentence = input()
+for idx, ch in enumerate(sentence):
+    if ch in string.ascii_uppercase:
+        word += ch
+    else:
+        if word:
+            words.append(word)
+            word = ""
+
+if word:
+    words.append(word)
+
+is_first_word = True
+for w in words:
+    # deal with blank line
+    if is_first_word:
+        is_first_word = False
+    else:
+        print()
+
+    # row scan from top to bottom
+    # in each row, characters of word scan
+    # record the charcacter pattern of word in current row. 
+    for i in range(7):
+        ans = []
+        for ch in w:
+            ans.append(alphabet[ch][i])
+        print(" ".join(ans))

PAT (Basic Level) Practise （中文）/1110_区块反转 (25).cpp

@@ -0,0 +1,55 @@
+#include <cstdio>
+#include <string>
+#include <iostream>
+#include <unordered_map>
+#include <vector>
+using namespace std;
+
+struct Node {
+    string address;
+    string data;
+    string next;
+};
+
+unordered_map<string, Node> L;
+
+int main() {
+    ios::sync_with_stdio(false);
+    string root;
+    int n, k;
+    cin >> root >> n >> k;
+    for (int i = 0; i < n; i++) {
+        Node node;
+        cin >> node.address >> node.data >> node.next;
+        L[node.address] = node;
+    }
+
+    vector<pair<string, string>> blocks; // record every blocks, then reverse based on this
+    int count = 0;
+    string p = root, begin = root, last;
+    while (p != "-1") {
+        count++;
+        if (count == k) {
+            blocks.push_back(make_pair(begin, p));
+            begin = L[p].next;
+            count = 0;
+        }
+
+        last = p;
+        p = L[p].next;
+    }
+
+    if (begin != "-1") blocks.push_back(make_pair(begin, last));
+    for (int i = blocks.size() - 1; i > 0; i--) {
+        L[blocks[i].second].next = blocks[i-1].first;
+    }
+    L[blocks[0].second].next = "-1";
+
+    p = blocks[blocks.size() - 1].first;
+    while (p != "-1"){
+        cout << p << " " << L[p].data << " " << L[p].next << endl;
+        p = L[p].next;
+    }
+
+    return 0;
+}