注意: \color{red}{注意:} 注意: 个人博客传送门
A. 装苹果
思路:
- 输出 ⌈ n x ⌉ \lceil \frac{n}{x} \rceil ⌈xn⌉ 即可
时间复杂度: O ( 1 ) O(1) O(1)
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, x;
std::cin >> n >> x;
std::cout << (n + x - 1) / x << "\n";
return 0;
}
B. 旋转和翻转
思路:
- 旋转后判断是否相同
- 旋转后然后翻转再判断是否相同
时间复杂度: O ( n 2 ) O(n^2) O(n2)
int n;
struct Matrix {
char g[15][15];
void init() {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
std::cin >> g[i][j];
}
}
}
Matrix rotate() {
Matrix ans;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
ans.g[i][j] = g[n - j - 1][i];
}
}
return ans;
}
Matrix reflex_x() {
Matrix ans;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
ans.g[i][j] = g[n - i - 1][j];
}
}
return ans;
}
Matrix reflex_y() {
Matrix ans;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
ans.g[i][j] = g[i][n - j - 1];
}
}
return ans;
}
bool operator == (Matrix b) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (g[i][j] != b.g[i][j]) return false;
}
}
return true;
}
};
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> n;
Matrix a, b, c;
a.init(), b.init();
for (int i = 0; i < 4; i++) {//只旋转
if (a == b) {
std::cout << "Yes\n";
return 0;
}
a = a.rotate();
}
for (int i = 0; i < 4; i++) {
c = a.reflex_x();
for (int j = 0; j < 4; j++) {
if (c == b) {
std::cout << "Yes\n";
return 0;
}
c = c.rotate();
}
a = a.reflex_x();
}
for (int i = 0; i < 4; i++) {
c = a.reflex_y();
for (int j = 0; j < 4; j++) {
if (c == b) {
std::cout << "Yes\n";
return 0;
}
c = c.rotate();
}
a = a.reflex_y();
}
std::cout << "No\n";
return 0;
}
C. 三角形
思路:
- 枚举两个顶点即可,运用初中所学的勾股定理
时间复杂度: O ( a 2 × b 2 ) O(a^2 \times b^2) O(a2×b2)
附:勾股定理: a 2 + b 2 = c 2 a^2+b^2=c^2 a2+b2=c2, a a a, b b b 均为直角边, c c c 为斜边
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int a, b;
std::cin >> a >> b;
for (int i = 1; i * i < a * a; i++) {
for (int j = 1; j * j < b * b; j++) {
int x1 = a * a - i * i, x2 = b * b - j * j;
int y1 = sqrt(x1), y2 = sqrt(x2);
if (y1 * y1 == x1 && y2 * y2 == x2) {
if (y1 != y2 && i * j == y1 * y2) {
std::cout << "YES\n";
std::cout << "0 0\n";
std::cout << -i << " " << y1 << "\n";
std::cout << j << " " << y2 << "\n";
return 0;
}
}
}
}
std::cout << "NO\n";
return 0;
}