Input index values for 8X8 matrix
{1,1}      4     3     4     5     4     3     4    3
              1     5     2     3     1     5     1     5
              3     4     1     4     2     3     2     4
              1     2     3     1     5     4     3     5
              3     5     1     5     2     1     2     4
              2     4     3     1     4     2     5     3
              5     1     5     2     5     1     3     1
  {8,1}    1     2     4     3     2     3     2     5      {8,8}

Lowest sum= 35
Path is as fallows:
 (1 ,1)
 (2 ,1)
 (3 ,1)
 (4 ,1)
 (4 ,2)
 (4 ,3)
 (4 ,4)
 (4 ,5)
 (5 ,5)
 (5 ,6)
 (6 ,6)
 (7 ,6)
 (7 ,7)
 (7 ,8)
 (8 ,8)

1. No two adjacent index will have the same value.
2. Only five different values can be assigned as matrix elements.
3. Diagonal movement is not allowed.

1. Problem Statement (2nd year & MCA(1st year )):

6. Submit a softcopy  ( .C /.CPP  extension  only ) and two hard copies of your program till  11AM 08/05/09.
7. Judging criteria will be based on algorithm ,memory utilization ,program size.
8. No alteration will be allowed once submitted .
9. Programmer will be responsible for the errors.
10. Copied programs will be rejected (participants will be disqualified ).
11. Except for the disqualified participants, all the participants will be given participation certificates. In case of any discrepancy, the organizers’ decision will be treated as final and binding on all.