Application of Josephus Problem

This is a problem where two inputs are given N and k where N is the number of peoples standing in a circle and K is the number of people you skip in each turn.



#include<iostream>
#define ll long  long 
using namespace std;
void solve(int arr[],int n,int k,int index)
{
 
	int t=n/k;
	 while(t--)
	 {
	 	
	 
	   arr[index]=0;
		index=(index + (k))%n;
     
				 
	}
}
int main()
{
    int t=0;
    cin>>t;
    while(t--)
    {
	int n=0;
	int k=0,x=0,y=0;
	cin>>n>>k>>x>>y;
	int arr[n];
 
    
	if(arr[y-1]==0)
	cout<<"YES";
	else
	cout<<"NO";
cout<<"\n";
        
    }
    return 0;
}