Pointer of an array in recursive function

[E3h7X9L8]

I've made queens problem , it works if I declare the array in which I calculate the solution global, but if I try to dynamically allocate it and pass it to the recursive function using pointers it just prints empty solution infinitely...

I'm trying for hours to figure out whats the problem...

 #include <iostream>
using std::cout;
using std::endl;

#include <cmath>
using std::abs;

#define N 5

void dame(int *v, int k);
void print(int *v);

int main()
{
	int *v = new int[N];
	dame(&v[0], 0);

        delete []v;
	return 0;
}

void dame(int *v, int k)
{
	if (k == N)
		print(v);
	else
	{
		for (int i = v[k]; i < N; i++)
		{
			v[k] = i;
			bool valid = true;
			for (int j = 0; j < k; j++)
			{
				if ( ( abs(v[k] - v[j]) == abs(k - j) ) || 
					(v[k] == v[j]) )
					valid = false;
			}

			if (valid == true)
				dame(v, k + 1);
			v[k] = 0;
		}
	}
}

void print(int *v)
{
	for (int i = 0; i < N; i++)
	{
		
		for (int j = 0; j < N; j++)
		{
			cout << char(179);
			if (j == v[i])
				cout << "D";
			else
				cout << " ";
		}
		cout << endl;
		
		for (int k = 0; k < 2 * N - 1; k++)
		{
			if (k % 2 == 0)
				cout << char(197);
			else
				cout << char(196);
		}
		cout << endl;

	}
	cout << endl;
}

[cire]

If you were using a global array, all the elements would be initialized to zero. That isn't the case here. All elements of your newed array are random junk.

To fix it: int *v = new int[N]();

[E3h7X9L8]

thanks, seems that was the problem