T1: 水仙花指数 模拟 代码实现 n = int(input()) ans = 0 while n != 0: ans += (n%10)**3 n //= 10 print(ans) T2：因数之和 遍历 \(i = 1, \cdots , N\)，把 \(\lfloor\frac{N}{i}\rfloor \times i\) 累加进答案 代码实现 n = int(input()) ans = 0 for i in range(1,
T1：矩形覆盖 用 std::set 或线段树来维护扫描线即可 代码实现 #include <bits/stdc++.h> #define rep(i, n) for (int i = 1; i <= (n); ++i) using std::cin; using std::cout; using std::multiset; using ll = long long; struct Node { ll x, h; int type; bool
