Help me in solving XSQR problem

help
,
1

My issue

include <bits/stdc++.h>
using namespace std;

void checkrect(int *A , int N){
int T , s=0 , p=0,r=0,q=0 , t=0,u=0,v=0,w=0;

for(int i=0; i<N; i++){
    
s=A[i]+A[i+1];
p= A[i+2]+A[i+3];

 q=A[i+1]-A[i+2];
 r = A[i+3] + A[i];


t= 	s=A[i]-A[i+1];
u= A[i+2]-A[i+3];

 v=A[i+1]-A[i+2];
 w = A[i+3] + A[i];
}

if(s==p && q==r || t==u && v==w){
cout<<“24”;
}
else{
cout<<“432”;
}
}
int main() {
int T, N , A[N];
cin >> T;

for(int j=0; j<T; j++){
   	cin>>N; 
for(int i=0; i<N; i++){
    cin>>A[i];
}}

    
checkrect(A , N);

}

My code

#include <bits/stdc++.h>
using namespace std;


void checkrect(int *A , int N){
    	int T , s=0 , p=0,r=0,q=0 , t=0,u=0,v=0,w=0;

	for(int i=0; i<N; i++){
	    
 	s=A[i]+A[i+1];
	p= A[i+2]+A[i+3];

	 q=A[i+1]-A[i+2];
	 r = A[i+3] + A[i];
	
	
	t= 	s=A[i]-A[i+1];
	u= A[i+2]-A[i+3];

	 v=A[i+1]-A[i+2];
	 w = A[i+3] + A[i];
	}
if(s==p && q==r || t==u && v==w){
    cout<<"24";
}
else{
    cout<<"432";
}
}
int main() {
	int T, N , A[N];
		cin >> T;
	
	for(int j=0; j<T; j++){
	   	cin>>N; 
	for(int i=0; i<N; i++){
	    cin>>A[i];
	}}

	    
	checkrect(A , N);

}

Problem Link: Xometry (Easy Version) Practice Coding Problem