A Naive recursive implementation of MCP ( Minimum Cost Path ) problem
#include <bits/stdc++.h> NEW_LINE using namespace std ; #define R  3 NEW_LINE #define C  3 NEW_LINE int min ( int x , int y , int z ) ;