CPE
歷屆英文試題
https://cpe.mcu.edu.tw/history.php
https://cpe.mcu.edu.tw/cpe/test_data/problems
歷屆線上評測
https://yuihuang.com/cpe/
CPE 一顆星選集 49 道必考題
vjudge 網址：https://vjudge.net/article/2679
1.c039. 00100 – The 3n + 1 problem
from functools import cmp_to_key
def f(x):
global p
if x < 0:
return -(-x % p)
return x % p
def cmp(a, b):
ma = f(a)
mb = f(b)
if ma == mb:
if a & 1 and b & 1: # odd、odd
return b - a
if not (a & 1) and not (b & 1):
return a - b
# odd and even
if a & 1 and not (b & 1):
return -1
if not (a & 1) and (b & 1):
return 1
return ma - mb
while 1:
n, p = map(int, input().split())
print(n, p)
if n == 0 and p == 0:
break
a = [int(input()) for i in range(n)]
a.sort(key=cmp_to_key(cmp))
for i in a:
print(i)
note = """
odd、even in the same % -> odd priority
odd、odd -> large
even、even -> small
"""
2.c082. 00118 – Mutant Flatworld Expolrers
n, m = map(int, input().split())
lost = set()
while 1:
try:
x, y, d = input().split()
x = int(x)
y = int(y)
s = input()
except EOFError:
break
dirs = "NESW"
current_d = dirs.index(d) # 0,1,2,3 NESW
add_x = [0, 1, 0, -1]
add_y = [1, 0, -1, 0]
is_lost = 0
for c in s:
if c == "R":
current_d = (current_d + 1) % 4
elif c == "L":
current_d = (current_d - 1) % 4
elif c == "F":
next_x = x + add_x[current_d]
next_y = y + add_y[current_d]
if 0 <= next_x and next_x <= n and 0 <= next_y and next_y <= m:
x = next_x
y = next_y
else:
if (x, y) in lost:
continue
lost.add((x, y))
is_lost = 1
break
if is_lost:
print(x, y, dirs[current_d], "LOST")
else:
print(x, y, dirs[current_d])
3.c007. 00272 – TeX Quotes
l = 1
while 1:
try:
s = input()
except EOFError:
break
for i in s:
if i == '"':
if l:
print("``", end="")
l = 0
else:
print("''", end="")
l = 1
else:
print(i, end="")
print()
4.e561. 00299 – Train Swapping
w = int(input())
while w:
w = w - 1
n = int(input())
v = list(map(int, input().split()))
ans = 0
for i in range(n-1):
for j in range(i + 1, n):
if v[j] < v[i]:
ans += 1
print(f"Optimal train swapping takes {ans} swaps.")
5.c045. 00490 – Rotating Sentences
k = 105
v = [[" "] * k for _ in range(k)]
it = 0
max_len = 0
while True:
try:
s = input()
except EOFError:
break
max_len = max(max_len, len(s))
for j, ch in enumerate(s):
v[it][j] = ch
it += 1
for j in range(max_len):
for i in range(it - 1, -1, -1):
print(v[i][j], end="")
print()
6.a134. 00948 – Fibonaccimal Base
f = [1, 1]
while 1:
k = f[-1] + f[-2]
if k > 100_0000_000:
break
f.append(k)
f.pop(0)
f.reverse()
w = int(input())
while w:
w = w - 1
n = int(input())
q = n
out = 0
ans = ""
for i in f:
if n >= i:
n -= i
out = 1
ans += "1"
else:
if out:
ans += "0"
print(f"{q} = {ans} (fib)")
7.c044. 10008 – What’s Cryptanalysis
w = int(input())
d = {}
while w:
w -= 1
s = input()
for chr in s.upper():
if "A" <= chr <= "Z":
d[chr] = d.get(chr, 0) + 1
ans = sorted(d.items(), key=lambda x: (-x[1], x[0]))
for x, y in ans:
print(x, y)
8.e545. 10019 – Funny Encryption Method
def bi(x):
s = []
while x:
s.append(x % 2)
x //= 2
s.reverse()
return s
def hex(x):
s = []
xx = str(x)
for i in xx:
s += bi(int(i))
return s
w = int(input())
for _ in range(w):
n = int(input())
print(bi(n).count(1), hex(n).count(1))
9.c014. 10035 – Primary Arithmetic
while 1:
n, m = input().split()
if n == "0" and m == "0":
break
n = [int(i) for i in n]
m = [int(i) for i in m]
n.reverse()
m.reverse()
max_len = max(len(n), len(m)) + 1
while len(n) < max_len:
n += [0]
while len(m) < max_len:
m += [0]
carry = 0
for i in range(max_len):
if n[i] + m[i] >= 10:
carry += 1
n[i + 1] += 1
if carry == 0:
print("No carry operation.")
elif carry == 1:
print("1 carry operation.")
else:
print(f"{carry} carry operations.")
10.d097. 10038 – Jolly Jumpers
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> sub;
for (int i = 0; i < n - 1; i++) {
sub.push_back(abs(v[i] - v[i + 1]));
}
sort(sub.begin(), sub.end());
int j = 1;
for (int i = 0; i < n - 1; i++) {
if (sub[i] != i + 1) {
j = 0;
break;
}
}
// for (int i : sub) {
// cout << i << " ";
// }
// cout << "\n";
if (j) {
cout << "Jolly" << "\n";
} else {
cout << "Not jolly" << "\n";
}
}
}
11.a737. 10041 – Vito’s family
import sys
data = list(sys.stdin.read().split())
out = []
it = 0
while it < len(data):
n = int(data[it])
it += 1
for _ in range(n):
m = int(data[it])
it += 1
s = list(map(int, data[it : it + m]))
it += m
s.sort()
ans = 0
c = s[len(s) // 2]
for i in s:
ans += abs(int(c) - int(i))
print(ans)
12.e579. 10050 – Hartals
13.a012. 10055 – Hashmat the Brave Warrior
14.e510. 10056 – What is the Probability?
15.e606. 10057 – A mid-summer nights dream
16.c012. 10062 – Tell me the frequencies!
17.d226. 10071 – Back to High School Physics
18.UVA-10093 An Easy Problem!
19.a741. 10101 – Bangla Numbers
20.e555. 10170 – The Hotel with Infinite Rooms
21.e605. 10189 – Minesweeper
22.e566. 10190 – Divide, But Not Quite Conquer!
23.d306. 10193 – All You Need Is Love
24.UVA-10221 Satellites
25.e578. 10222 – Decode the Mad man
26.d492. 10226 – Hardwood species
27.d387. 10235 – Simply Emirp
28.e512. 10242 – Fourth Point!!
29.e507. 10252 – Common Permutation
30.f444: 10268 – 498-bis
31.e516. 10409 – Die Game
32.e531. 10415 – Eb Alto Saxophone Player
33.a743. 10420 – List of Conquests
34.UVA-10642 Can You Solve It?
35.c022. 10783 – Odd Sum
36.c004. 10812 – Beat the Spread!
37.e575. 10908 – Largest Squares
38.d672. 10922 – 2 the 9s
39.d235. 10929 – You can say 11
40.a132. 10931 – Parity
41.UVA-11005 Cheapest Base
42.d123. 11063 – B2-Sequence
43.d189. 11150 – Cola
44.d750. 11321 – Sort! Sort!! and Sort!!!
45.c813. 11332 – Summing Digits
46.e513. 11349 – Symmetric Matrix
47.d255. 11417 – GCD
48.d186. 11461 – Square Numbers
49.f709: 12019 – Doom’s Day Algorithm