백준 10844 c++

#include <iostream>

using namespace std;

int input(int lower, int upper)
{
	//cout << "input()" << endl;
	int A;

	while (1)
	{
		cin >> A;
		if (A >= lower && A <= upper)
		{
			break;
		}
		else
		{
			;
		}
	}

	return A;
}

int find_result(int N)
{
	int i, j;
	int** arr;
	int result = 0;
	
	arr = new int* [N + 1] { 0 };
	for (i = 0; i <= N; i++)
	{
		arr[i] = new int[10] { 0 };
	}

	for (i = 1; i < 10; i++)
	{
		arr[1][i] = 1;
	}
	for (i = 2; i <= N; i++)
	{
		for (j = 0; j < 10; j++)
		{
			if (j == 0)
			{
				arr[i][j] = arr[i-1][j+1];
			}
			else if (j == 9)
			{
				arr[i][j] = arr[i-1][j-1];
			}
			else
			{
				arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j + 1];
			}
			arr[i][j] = arr[i][j] % 1000000000;
		}
	}
	for (i = 0; i < 10; i++)
	{
		result = (result + arr[N][i])%1000000000;
	}

	/*for (i = 0; i <= N; i++)
	{
		for (j = 0; j < 10; j++)
		{
			cout << arr[i][j] << " ";
		}
		cout << "\n";
	}*/

	for (i = 0; i <= N; i++)
	{
		delete[] arr[i];
	}
	delete[] arr;

	return result;
}

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int N;

	N = input(1, 100);
	cout << find_result(N) << "\n";

	return 0;
}