import sys
for line in sys.stdin:
x = int(line)
ans = 0
for i in range(2, int(x**0.5)+1): # 測試 2 ~ 根號 x
while x%i == 0: # 如果 i 可以整除 x
ans += i # 加上 i
x //= i # x 變為 1/i
if x != 1: ans += x # 如果 x 不是 1，x 為質數
sys.stdout.write(f"{ans:d}\n")
psum[i][j] = psum[i-1][j] + psum[i][j-1] - psum[i-1][j-1]
isum = psum[r2][c2] - psum[r1-1][c2] - psum[r2][c1-1] + psum[r1-1][c1-1]
import sys
for line in sys.stdin:
n, m = map(int, line.split())
psum = [[0]*(n+1) for _ in range(n+1)] # 最上面、最左邊補 0
for i in range(1, n+1): # 讀取 n 行資料
row = [0] + list(map(int, sys.stdin.readline().split()))
for j in range(1, n+1): # 處理前綴和
psum[i][j] = psum[i-1][j] + psum[i][j-1] - psum[i-1][j-1] + row[j]
for _ in range(m): # 讀取 m 行
r1, c1, r2, c2 = map(int, sys.stdin.readline().split())
isum = psum[r2][c2] - psum[r1-1][c2] - psum[r2][c1-1] + psum[r1-1][c1-1]
sys.stdout.write(f"{isum:d}\n")
import sys
for line in sys.stdin:
n, m = map(int, line.split())
psum = [0] + list(map(int, sys.stdin.readline().split()))
for i in range(1, n+1): # 轉成前綴和
psum[i] += psum[i-1]
for _ in range(m): # 讀取 m 行
left, right = map(int, sys.stdin.readline().split())
isum = psum[right] - psum[left-1]
sys.stdout.write(f"{isum:d}\n")
import sys
result = []
lines = sys.stdin.readlines()
idx = 0
while idx < len(lines):
n, m = map(int, lines[idx].split())
idx += 1
psum = [0] + list(map(int, lines[idx].split()))
idx += 1
for i in range(1, n+1): # 轉成前綴和
psum[i] += psum[i-1]
for _ in range(m): # 讀取 m 行
left, right = map(int, lines[idx].split())
idx += 1
isum = psum[right] - psum[left-1]
result.append(f"{isum:d}\n")
sys.stdout.write("".join(result))
import sys
result = []
lines = sys.stdin.readlines()
for line in lines:
if not line.rstrip(): continue
a, b, n = map(int, line.split())
int_part = a//b
a %= b
res = [f"{int_part:d}."]
for _ in range(n):
a *= 10
c = a//b
res.append(f"{c:d}")
a %= b
result.append("".join(res) + "\n")
sys.stdout.write("".join(result))
import sys
result = []
lines = sys.stdin.readlines()
for line in lines:
if not line.rstrip(): continue
a, b, n = map(int, line.split())
int_part = a//b
dec_part = str(a%b*(10**n) // b).zfill(n)
result.append(f"{int_part:d}.{dec_part}\n")
sys.stdout.write("".join(result))
import sys
for line in sys.stdin:
if not line.strip(): continue
n = int(line)
nums = sorted([int(sys.stdin.readline()) for _ in range(n)])
result = [f"{num:d}\n" for num in nums]
sys.stdout.write("".join(result))
import sys
from itertools import permutations
result = []
lines = sys.stdin.readlines()
for line in lines:
if not line.strip(): continue # 跳過空行
n = int(line)
for arr in permutations(range(n, 0, -1), n): # 從 n ~ 1 的數字取 n 個排列
res = [f"{a:d}" for a in arr] # arr 的內容轉成字串存入 res
result.append("".join(res) + "\n") # res 接成一個字串加入 result
sys.stdout.write("".join(result)) # 一次輸出所有的結果
import sys
result = []
def perm(arr, nums, used, depth):
# 代入已選數字串列 arr, 可用數字串列 nums，已選數字的集合 used，目標長度 depth
if len(arr) == depth: # 遞迴出口，如果 arr 長度等於 depth
result.append("".join([f"{a:d}" for a in arr]) + "\n") # 接成字串加入 result
return
for num in nums: # 依序由 nums 讀取數字
if num in used: continue # 如果 num 已用過，找下一個數字
arr.append(num) # num 接到 arr 最後面
used.add(num) # num 加入 used
perm(arr, nums, used, depth) # 遞迴
arr.pop() # 從 arr 最後面移除數字
used.remove(num) # 從 used 移除 num
lines = sys.stdin.readlines()
for line in lines:
if not line.strip(): continue # 跳過空行
n = int(line)
perm([], list(range(n, 0, -1)), set(), n)
sys.stdout.write("".join(result)) # 一次輸出所有的結果
def draw(n, m):
### 填格子 ###
if m == 1: # 方向順序是右、下、左、上
dr, dc = (0, 1, 0, -1), (1, 0, -1, 0)
else: # 方向順序是下、右、上、左
dr, dc = (1, 0, -1, 0), (0, 1, 0, -1)
matrix = [[0]*n for _ in range(n)] # n*n 矩陣，預設值皆為 0
r, c, v = 0, 0, 1 # 座標 (r, c)，值為 1
d = 0 # 一開始朝右方或下
while v < n*n: # 還沒有填完
matrix[r][c] = v # 設定此格的值
nr, nc = r+dr[d], c+dc[d] # 要走的格子
if nr < 0 or nr >= n or nc < 0 or nc >= n or matrix[nr][nc] != 0: # 出界或已經填過了
d = (d+1)%4 # 轉向
nr, nc = r+dr[d], c+dc[d] # 更新 (nr, nc)
r, c = nr, nc # 走到 (nr, nc)
v += 1 # 值加 1
matrix[r][c] = v # 設定最後一格的值
### 輸出 ###
for row in matrix:
for c, v in enumerate(row):
print(f"{v:5d}", end="\n" if c == n-1 else "")
T = int(input())
for t in range(T):
if t > 1: print()
draw(*map(int, input().split()))
import sys
result = []
lines = sys.stdin.readlines()
for line in lines:
n = int(line)
if n == 0: break
cnt = 0
while n&1:
n >>= 1
cnt += 1
result.append(f"{cnt:d}\n")
sys.stdout.write("".join(result))
a1, b1, c1, a2, b2, c2 = map(int, input().split())
delta = a1*b2 - a2*b1
deltax = c1*b2 - c2*b1
deltay = a1*c2 - a2*c1
if delta != 0: # 恰有一組解
print(f"x={deltax/delta:.2f}")
print(f"y={deltay/delta:.2f}")
else:
if deltax != 0 or deltay != 0: print("No answer") # 無解
elif deltax == 0 and deltay == 0: print("Too many") # 無窮多組解
import sys
result = []
for line in sys.stdin:
if not line.rstrip(): continue
ans = list(map(int, line.split()))
n = int(sys.stdin.readline())
for _ in range(n):
guess = list(map(int, sys.stdin.readline().split()))
A, B = 0, 0 # 位置、數字都對的數量 A，位置不對、數字對的數量 B
cnt_a, cnt_g = [0]*10, [0]*10 # 0 ~ 9 各個數字的數量
for a, g in zip(ans, guess): # 先掃一輪
if a == g: A += 1 # 位置、數字都對，A 加 1
else: # 反之，記錄數字對應的數量
cnt_a[a] += 1
cnt_g[g] += 1
for a, g in zip(cnt_a, cnt_g): # 計算 B 的數量
if a >= g: B += g
else: B += a
result.append(f"{A:d}A{B:d}B\n")
sys.stdout.write("".join(result))