Practice "Telerik Academy Exam 1 @ 7 Dec 2011

Problem 5 – Lines
You are given a list of 8 bytes (positive integers in the range [0…255]) n0, n1, …, n7. These numbers represent a square grid consisting of 8 lines and 8 columns. Each cell of the grid could either be empty or full. The first line is represented by the bits of n0, the second – by the bits of n1 and so on, and the last line is represented by the bits of n7. Each bit with value 1 denotes a full cell and each bit with value 0 denotes an empty cell. The lines are numbered from the first (top) to the last (bottom) with the numbers 0, 1, …, 7. The columns are numbered from right to left with the indices 0, 1, …, 7. The figure shows a sample square grid and its representation by a sequence of 8 numbers n0, n1, …, n7:
  7  6  5 4  3  2  1  0
0        ■                n0 = 8
1    ■         ■                n1 = 72
2        ■                n2 = 8
3        ■                n3 = 8
4    ■                n4 = 16
5    ■  ■  ■          n5 = 28
6 ■ ■ ■  ■              n6 = 240
7                   n7 = 0

A line is any sequence of full cells staying on the same row or column. At the figure above we have two lines of 4 cells and two lines of 3 cells and one line of 1 cell. You need to create a program that finds the longest line in the grid and the number of lines with the longest length. At the figure we have two largest lines with length of 4 cells.
Input
The input data is should be read from the console. There will be exactly 8 lines each holding the integer numbers n0, n1, …, n7. It is guaranteed that there exists at least one line in the grid (the grid is not empty).
The input data will always be valid and in the format described. There is no need to check it explicitly.
Output
The output consists of two integers placed on separate lines. The first line should hold the length of the longest line in the grid. The second line should hold the number of lines with the maximal length.
Constraints
• The numbers n0, n1, …, n7 are positive integers in the range [0…255].
• Allowed work time for your program: 0.25 seconds.
• Allowed memory: 16 MB.


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;


class Lines
{
    static void Main()
    {
        int n0 = int.Parse(Console.ReadLine());
        int n1 = int.Parse(Console.ReadLine());
        int n2 = int.Parse(Console.ReadLine());
        int n3 = int.Parse(Console.ReadLine());
        int n4 = int.Parse(Console.ReadLine());
        int n5 = int.Parse(Console.ReadLine());
        int n6 = int.Parse(Console.ReadLine());
        int n7 = int.Parse(Console.ReadLine());
        int[] input = new int[] { n0, n1, n2, n3, n4, n5, n6, n7 };
        char [] m=new char[8];
        int[,] matrix=new int [8,8];


        for (int row = 0; row < 8; row++)
        {
            string strN = Convert.ToString(input[row], 2).PadLeft(8, '0');
            int bits = 7;
            foreach (var item in strN)
            {
                m[bits] = item;
                bits--;
            }
            for (int col = 7; col >= 0; col--)
            {
                matrix[row,col]=(int)(m[col]-'0');
            }
        }
        int maxLength = 0;
        int currentLength = 0;
        int maxCount = 0;

        for (int row = 0; row < 8; row++)
        {
            for (int col = 7; col >= 0; col--)
            {
                while (matrix[row,col]==1)
                {
                    currentLength++;
                    if (currentLength > maxLength)
                    {
                        maxLength = currentLength;
                        maxCount = 1;
                    }
                    else if (currentLength == maxLength)
                    {
                        maxCount++;
                    }
                    if (col == 0)
                    {
                        break;
                    }
                    col--;
                }
                currentLength = 0;
            }
            currentLength = 0;
        }
        int maxColLength=0;
        int maxColCount = 0;

        for (int col = 7; col >=0; col--)
        {
            for (int row = 0; row < 8; row++)
            {
                while (matrix[row,col]==1)
                {
                    currentLength++;

                    if (currentLength > maxColLength)
                    {
                        maxColLength = currentLength;
                        maxColCount = 1;
                    }
                    else if (currentLength == maxColLength)
                    {
                        maxColCount++;
                    }
                    if (row == 7)
                    {
                        break;
                    }
                    row++;
                }
                currentLength = 0;
            }

            currentLength = 0;
        }
        int result;
        if (maxLength==1 && maxColLength==1)
        {
            Console.WriteLine(maxLength);
            Console.WriteLine(maxCount);
        }
        else if (maxLength==maxColLength)
        {
            result=maxCount + maxColCount;
            Console.WriteLine(maxLength);
            Console.WriteLine(result);
        }
        else if (maxLength>maxColLength)
        {
            Console.WriteLine(maxLength);
            Console.WriteLine(maxCount);
        }
        else if(maxLength<maxColLength)
        {
            Console.WriteLine(maxColLength);
            Console.WriteLine(maxColCount);
        }
    }
}