"Sudoku is a logic-based, combinatorial number-placement puzzle. The objective is to fll a 99 grid with digits so that each column, each row, and each of the nine 33 sub-grids that compose the grid (also called "boxes", "blocks", "regions", or "sub-squares") contains all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a unique solution. Completed games are always a type of Latin square with an additional constraint on the contents of individual regions. For example, the same single integer may not appear twice in the same row, column, or any of the nine 33 sub-regions of the 9x9 playing board." (This text is extracted from Wikipedia article)

Write a program to input integers into a 9x9 integer array. It will check if it is a Sudoku puzzle or not. Use a function that receives a 9x9 integer array to check if the given completed grid of the Sudoku puzzle is a feasible solution i.e., it satisfes the constraint. It returns 1 if it satisfes the constraint, returns 0 otherwise.