题目链接 点我
题意:给你两个二维矩阵A和B,问你矩阵A能否通过矩阵B旋转得到。
思路:直接暴力。
AC代码:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <string>
#include <vector>
#define lson o<<1|1, l, mid
#define rson o<<1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define INF 0x3f3f3f3f
#define eps 1e-8
#define debug printf("1\n")
#define MAXN 10000
#define MAXM 100000
#define LL long long
#define CLE(a, b) memset(a, (b), sizeof(a))
#define W(a) while(a--)
#define Ri(a) scanf("%d", &a)
#define Pi(a) printf("%d\n", (a))
#define Rl(a) scanf("%lld", &a)
#define Pl(a) printf("%lld\n", (a))
using namespace std;
int main()
{
int t, kcase = 1;
scanf("%d", &t);
W(t)
{
int a0, b0 ,c0, d0;
int a1, b1, c1, d1;
Ri(a0); Ri(b0); Ri(c0); Ri(d0);
Ri(a1); Ri(b1); Ri(c1); Ri(d1);
bool s1 = (a0 == a1 && b0 == b1 && c0 == c1 && d0 == d1);
bool s2 = (a0 == b1 && b0 == d1 && c0 == a1 && d0 == c1);
bool s3 = (a0 == d1 && b0 == c1 && c0 == b1 && d0 == a1);
bool s4 = (a0 == c1 && b0 == a1 && c0 == d1 && d0 == b1);
if(s1 || s2 || s3 || s4)
printf("Case #%d: POSSIBLE\n", kcase++);
else
printf("Case #%d: IMPOSSIBLE\n", kcase++);
}
return 0;
}