CareerCup

int m[r][c];
 int i,j;
 for(i=0;i<r;++i) 
   if(i&1) // even lines
      for(j=c-1;j>=0;j--) cout<<m[i][j];
   else
      for(j=0;j<c;++j) cout<<m[i][j];

what do you mean by snake like order here?It will be great if you can explain the question.

4 5 6 7 7 3 4 6 --
4 1 6 3 1 3 4 6 --
3 9 3 7 8 4 3 7 --
2 5 6 1 9 3 1 6 --
4 7 4 8 3 9 4 5 --
7 6 6 7 2 3 6 2 --
8 5 5 7 1 3 4 2 --
4 5 6 7 1 3 4 6 -

So Printing in snake would mean get these values from the 8x8 array:
4,5,1,6,3,7,1,9,3,9,3,6,4,2,6 ; get this along the diagonals

#include<iostream>
using namespace std;
int main()
{
int a[4][6]={{1,2,3,5,6},{7,8,9,1,2,3},{4,5,6,7,8,9},{1,2,3,4,5,6}},i,j,c;
for(i=0;i<4;i++)
{
for(j=i,c=0;c<2;c++,j++)
{
cout<<a[i][j];
}
}
return 0;
}

Recursive Solution

private static void printSnake(int[][] array,int row,int col){
		if(array.length == row || array[0].length == col)
			return;
		
		System.out.print(array[row][col] + " ");
		if(col + 1 == array[0].length)
			return;
		else
			System.out.println(array[row][col+1]);
		printSnake(array,row+1,col+1);
	}