Run ID 作者 问题 语言 测评结果 分数 时间 内存 代码长度 提交时间
124399 廖悦扬 方块转换 C++ 通过 100 0 MS 260 KB 1554 2024-01-23 14:19:58

Tests(7/7):


#include <bits/stdc++.h> using namespace std; int n; int a[20][20], b[20][20], tmp[20][20]; void right_rotate() { for (int i=0; i<n; i++) for (int j=0; j<n; j++) tmp[i][j] = a[i][j]; for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { a[j][n-1-i] = tmp[i][j]; } } } void mirror() { for (int i=0; i<n; i++) for (int j=0; j<n; j++) tmp[i][j] = a[i][j]; for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { a[i][j] = tmp[i][n-1-j]; } } } bool cmp(){ for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { if (a[i][j] != b[i][j]) return false; } } return true; } signed main() { cin >> n; for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { char c; cin >> c; if (c == '@' || c == '-') { a[i][j] = c; }else j--; } } for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { char c; cin >> c; if (c == '@' || c == '-') { b[i][j] = c; }else j--; } } right_rotate(); if (cmp()) { cout << 1; return 0; } right_rotate(); if (cmp()) { cout << 2; return 0; } right_rotate(); if (cmp()) { cout << 3; return 0; } right_rotate(); mirror(); if (cmp()) { cout << 4; return 0; } right_rotate(); if (cmp()) { cout << 5; return 0; } right_rotate(); if (cmp()) { cout << 5; return 0; } right_rotate(); right_rotate(); mirror(); if (cmp()) { cout << 5; return 0; } cout << 7; if (cmp()) { cout << 6; return 0; } return 0; }


测评信息: