#include<iostream>
\nusing\u00a0 namespace std;
\nint main()
\n{
\nint N[100],K[100],K2[100],K3[100],K4[100];
\nint n,t;
\ncin>>t;
\nfor(int p=0;p<t;p++)
\n{
\ncin>>n;
\nfor(int i=0;i<n*n;i++) cin>>N[i];
\nfor(int i=0;i<n*n;i++) cin>>K[i];
\n\/\/Enter Stanko magic formula
\nint flag=0;
\nint i=0;<\/p>\n
for(int s=0;s<n*n;s++)
\n{
\nif(N[i]!=K[i]) { flag=1; break; }
\n}<\/p>\n
for(int gosho=0;gosho<n*n;gosho++)
\n{
\nK2[gosho]=K[n*n-(gosho%n+1)*n+gosho\/n];
\n}<\/p>\n
for(int s=0;s<n*n;s++)
\n{
\nif(N[i]!=K2[i]) { flag=1; break; }
\n}
\n\/\/\/\/\/\/\/\/\/\/\/\/<\/p>\n
for(int gosho=0;gosho<n*n;gosho++)
\n{
\nK3[gosho]=K2[n*n-(gosho%n+1)*n+gosho\/n];
\n}<\/p>\n
for(int s=0;s<n*n;s++)
\n{
\nif(N[i]!=K3[i]) { flag=1; break; }
\n}<\/p>\n
\/\/\/\/\/\/\/\/\/\/\/\/<\/p>\n
for(int gosho=0;gosho<n*n;gosho++)
\n{
\nK4[gosho]=K3[n*n-(gosho%n+1)*n+gosho\/n];
\n}<\/p>\n
for(int s=0;s<n*n;s++)
\n{
\nif(N[i]!=K4[i]) { flag=1; break; }
\n}<\/p>\n
\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/<\/p>\n
if( flag==0 ) cout<<“YES”<<endl;
\nelse cout<<“NO”<<endl;<\/p>\n
}
\nreturn 0;
\n}<\/p><\/blockquote>\n
\u041c\u043e\u043b\u044f ,\u043d\u0435 \u043f\u0438\u0442\u0430\u0439\u0442\u0435 \u0437\u0430\u0449\u043e \u0438\u043c\u0430 \u0431\u0440\u043e\u044f\u0447 “\u0413\u043e\u0448\u043e” , \u043f\u0440\u043e\u0441\u0442\u043e \u0438\u043c\u0430 …<\/p>\n
<\/p>\n
<\/p>\n
\u041f\u043e\u0437\u0434\u0440\u0430\u0432\u0438,\u0421\u0442\u043e\u044f\u043d \u0423\u0437\u0443\u043d\u043e\u0432.<\/p>\n","protected":false},"excerpt":{"rendered":"
Long story short : \u0420\u0435\u0448\u0435\u043d\u0430 \u0437\u0430\u0434\u0430\u0447\u0430 “\u0421” \u00a0\u043e\u04422007 \u0433\u043e\u0434\u0438\u043d\u0430. \u0417\u0430\u0434\u0430\u0447\u0430\u0442\u0430 \u0431\u0435 \u0438\u0437\u0431\u0440\u0430\u043d\u0430 \u043d\u0430 \u043e\u0442\u043d\u043e\u0441\u0438\u0442\u0435\u043b\u043d\u043e \u0441\u043b\u0443\u0447\u0430\u0435\u043d \u043f\u0440\u0438\u043d\u0446\u0438\u043f. \u0417\u0430\u0434\u0430\u0447\u0430\u0442\u0430 \u043c\u043e\u0436\u0435 \u0434\u0430 \u0431\u044a\u0434\u0435 \u043d\u0430\u043c\u0435\u0440\u0435\u043d\u0430 \u0432 \u0430\u0440\u0445\u0438\u0432\u0430 \u043d\u0430\u00a0http:\/\/bcpc.eu\/\u00a0(2007 , “C” ) . \u0421\u043e\u0440\u0441: #include<iostream> using\u00a0 namespace std; int main() { int N[100],K[100],K2[100],K3[100],K4[100]; int n,t; cin>>t; for(int p=0;p<t;p++) { cin>>n; for(int i=0;i<n*n;i++) cin>>N[i]; for(int i=0;i<n*n;i++) cin>>K[i]; \/\/Enter Stanko magic […]<\/p>\n","protected":false},"author":4,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[4,9,8],"class_list":["post-95","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-bfu","tag-c","tag-programming-challenges"],"_links":{"self":[{"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=\/wp\/v2\/posts\/95","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=95"}],"version-history":[{"count":2,"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=\/wp\/v2\/posts\/95\/revisions"}],"predecessor-version":[{"id":97,"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=\/wp\/v2\/posts\/95\/revisions\/97"}],"wp:attachment":[{"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=95"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=95"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dev.bfu.bg\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=95"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}