Banker's Algorithm for deadlock avoidance in C

Bankers.c

#include "stdafx.h"

#include<stdio.h>
#include<conio.h>
#define true 1
#define false 0
int available[10], allocation[10][10], max[10][10], need[10][10], work[10], finish[10], maxres[10], safe[10], req[10], m, n;
int find()
{
	int i, j;
	for (i = 0; i < n; i++)
	{
		if (finish[i] == false)
		{
			for (j = 0; j < m; j++)
				if (need[i][j] > work[j]) break;
			if (j == m)
			{
				finish[i] = true;
				return i;
			}
		}
	}
	return -1;
}

int issafe()
{
	int i = 0, j, k = 0, cnt = n;
	for (j = 0; j < m; j++)
		work[j] = available[j];
	for (j = 0; j < m; j++)
		finish[i] = false;
	while (cnt > 0)
	{
		for (i = 0; i < n; i++)
		{
			i = find();
			if (i == -1)
			{
				printf("\nThe system is in unsafe state");
				return 0;
			}
			for (j = 0; j < m; j++)
				work[j] += allocation[i][j];
			safe[k++] = i;
			cnt--;
		}
	}
	if (finish[i - 1] == false)
	{
		printf("\nThe system is in unsafe state");
		return 0;
	}
	printf("\nThe system is in safe state, safe sequence: ");
	for (i = 0; i < n; i++)
		printf("P%d, ", safe[i]);
	return 0;
}
int main()
{
	int i, j, sum;
	char ch;
	printf("\nEnter the number of processes and the number of resources:\n");
	scanf("%d%d", &n, &m);
	printf("\nEnter maximum instances of resources\n");
	for (j = 0; j < m; j++)
	{
		scanf("%d", &maxres[j]);
		available[j] = maxres[j];
	}
	printf("\nEnter the Allocated Matrix:\n");
	for (i = 0; i < n; i++)
	{
		for (j = 0; j < m; j++)
			scanf("%d", &allocation[i][j]);
	}
	printf("\nEnter the Max Matrix:\n");
	for (i = 0; i < n; i++)
	{
		for (j = 0; j < m; j++)
		{
			scanf("%d", &max[i][j]);
			need[i][j] = max[i][j] - allocation[i][j];
		}
	}
	printf("\nThe Matrix is:\n");
	for (i = 0; i < n; i++)
	{
		for (j = 0; j < m; j++)
			printf("%d ", need[i][j]);
		printf("\n");
	}
	for (j = 0; j < m; j++)
	{
		sum = 0;
		for (i = 0; i < n; i++)
			sum += allocation[i][j];
		available[j] -= sum;
	}
	issafe();
	_getch();
}