02. Odd or Even Counter7 November 2014

using System;


class OddOrEvenCounter
{
    static void Main()
    {
        int setCount = int.Parse(Console.ReadLine());
        int numberSet = int.Parse(Console.ReadLine());
        string type = Console.ReadLine();

        int[] totalCount = new int[setCount]; // izpolzvame masiv samo za broqcha i ako e primerno odd uvelichavame broqcha // imame tolkova broqcha kolkoto setCount
        // totalCount mi pazi broqcha na seki set v masiv primerno na 0 v masiva totalCount mi e 1 set v koito ima 4 chisla ot typa koioto mi e zadaden
        for (int i = 0; i < setCount; i++)// for za nomera na setovete
        {
            for (int innerIndex = 0; innerIndex < numberSet; innerIndex++)// for za chislata v seta i za uvelichavaneto na broqcha totalCount[]
            {
                int currentNumber = int.Parse(Console.ReadLine());
                if (type == "odd")// ako smao tiput koto mi e daden e odd vliza samo v tozi if i obratnoto akoe  e EVEN vliza v dolniqt
                {
                    if (currentNumber % 2 == 1)//(currentNumber % 2 != 0)
                    {
                        totalCount[i]++;// v tekushtiqt index v masiva koeot otgovarq na i v gorniqt purvi for uvelichavame brocha po defult trqbva da e 0 i uvelichave s 1
                    }
                }
                else // moje i (type == "even")
                {
                    if (currentNumber % 2 == 0)
                    {
                        totalCount[i]++;
                    }
                }
            }
        }

        int maxCount = 0;// obhojdame masiva i ako namerim po-golqma stoinost ot tova chislo mu prisloqvame po-golqmata stoinost// purvo se opita s int maxCount = int.MinValue; zashtoto broqcha ne moje da e otricatelno chislo
        int maxIndex = -1;// -1 zashtoto ako sloja 0 tekushtiqt index e 0 koito go imame

        for (int j = 0; j < totalCount.Length; j++)// v tozi for obhojdame masiva totalCount koito mi e zapizil proeneto ot vsi4ki setove za da opredelq v koi set e ima nai mn ot zadadeniqt tip/odd or even
        {
            if (totalCount[j] > maxCount)// proverqvame vseki edin index dali e po-golqm ot maksimalnoto 4islo koeto imame v momenta koeto pri purvot zavurtane e 0
            {
                maxCount = totalCount[j];// i ako e po-golqmo maxCount priema stoinosta na tova chislo ot indexa na masiva totalCount[j]
                maxIndex = j;// go tvame da e = ravno na index  ot for zashtoto se iska da  kajem v koi set ot totalCount ima nai-mnogo nujen type
            }
        }

        if (maxCount == 0)// ne se uvelichi i ostane 0 da ptirnti tova tova e kogato tursim naprimer EVEN a nasqkude v setovete imame samo ODD
        {
            Console.WriteLine("No");// zatova maxIndex = -1 ako nqma nai-golqma chislo i maxIndex ostane -1 togava da printi "No"
        }
        else
        {
            switch (maxIndex + 1)// ako e 0 realno to trqbva da e 1 i prosoto go broim (maxIndex + 1) za da ni dava tova koeto ni trqbva
            {
                case 1:
                    Console.Write("First");
                    break;
                case 2:
                    Console.Write("Second");
                    break;
                case 3:
                    Console.Write("Third");
                    break;
                case 4:
                    Console.Write("Fourth");
                    break;
                case 5:
                    Console.Write("Fifth");
                    break;
                case 6:
                    Console.Write("Sixth");
                    break;
                case 7:
                    Console.Write("Seventh");
                    break;
                case 8:
                    Console.Write("Eighth");
                    break;
                case 9:
                    Console.Write("Ninth");
                    break;
                case 10:
                    Console.Write("Tenth");
                    break;
            }
            // "First", "Second", "Third", "Fourth", "Fifth", "Sixth", "Seventh", "Eighth", "Ninth", "Tenth"
            Console.WriteLine(" set has the most {0} numbers: {1}", type, maxCount);
        }

    }
}




/////////////////////////// 2 reshenie ////////////////////////////////////////////////////////////////////////////


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

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            int setCount = int.Parse(Console.ReadLine());
            int numberSet = int.Parse(Console.ReadLine());
            string type = Console.ReadLine();

            int[] totalSum = new int[setCount];
            int[] totalCount = new int[setCount]; // izpolzvame masiv samo za broqcha i ako e primerno odd uvelichavame broqcha // imame tolkova broqcha kolkoto setCount
            // totalCount mi pazi broqcha na seki set v masiv primerno na 0 v masiva totalCount mi e 1 set v koito ima 4 chisla ot typa koioto mi e zadaden
            for (int i = 0; i < setCount; i++)// for za nomera na setovete
            {
                for (int innerIndex = 0; innerIndex < numberSet; innerIndex++)// for za chislata v seta i za uvelichavaneto na broqcha totalCount[]
                {
                    int currentNumber = int.Parse(Console.ReadLine());

                    if (type == "odd")// ako smao tiput koto mi e daden e odd vliza samo v tozi if i obratnoto akoe  e EVEN vliza v dolniqt
                    {
                        if (currentNumber % 2 == 1)//(currentNumber % 2 != 0)
                        {
                            totalSum[i] += currentNumber;
                            totalCount[i]++;// v tekushtiqt index v masiva koeot otgovarq na i v gorniqt purvi for uvelichavame brocha po defult trqbva da e 0 i uvelichave s 1
                        }
                    }
                    else // moje i (type == "even")
                    {
                        if (currentNumber % 2 == 0)
                        {
                            totalCount[i]++;
                            totalSum[i] += currentNumber;
                        }
                    }
                }
            }

            int maxCount = 0;// obhojdame masiva i ako namerim po-golqma stoinost ot tova chislo mu prisloqvame po-golqmata stoinost// purvo se opita s int maxCount = int.MinValue; zashtoto broqcha ne moje da e otricatelno chislo
            int maxIndex = -1;// -1 zashtoto ako sloja 0 tekushtiqt index e 0 koito go imame

            for (int j = 0; j < totalCount.Length; j++)// v tozi for obhojdame masiva totalCount koito mi e zapizil proeneto ot vsi4ki setove za da opredelq v koi set e ima nai mn ot zadadeniqt tip/odd or even
            {
                if (totalCount[j] > maxCount)// proverqvame vseki edin index dali e po-golqm ot maksimalnoto 4islo koeto imame v momenta koeto pri purvot zavurtane e 0
                {
                    maxCount = totalCount[j];// i ako e po-golqmo maxCount priema stoinosta na tova chislo ot indexa na masiva totalCount[j]
                    maxIndex = j;// go tvame da e = ravno na index  ot for zashtoto se iska da  kajem v koi set ot totalCount ima nai-mnogo nujen type
                }
            }

            if (maxCount == 0)// ne se uvelichi i ostane 0 da ptirnti tova tova e kogato tursim naprimer EVEN a nasqkude v setovete imame samo ODD
            {
                Console.WriteLine("No");// zatova maxIndex = -1 ako nqma nai-golqma chislo i maxIndex ostane -1 togava da printi "No"
            }
            else
            {
                switch (maxIndex + 1)// ako e 0 realno to trqbva da e 1 i prosoto go broim (maxIndex + 1) za da ni dava tova koeto ni trqbva
                {
                    case 1:
                        Console.Write("First");
                        break;
                    case 2:
                        Console.Write("Second");
                        break;
                    case 3:
                        Console.Write("Third");
                        break;
                    case 4:
                        Console.Write("Fourth");
                        break;
                    case 5:
                        Console.Write("Fifth");
                        break;
                    case 6:
                        Console.Write("Sixth");
                        break;
                    case 7:
                        Console.Write("Seventh");
                        break;
                    case 8:
                        Console.Write("Eighth");
                        break;
                    case 9:
                        Console.Write("Ninth");
                        break;
                    case 10:
                        Console.Write("Tenth");
                        break;
                }
                // "First", "Second", "Third", "Fourth", "Fifth", "Sixth", "Seventh", "Eighth", "Ninth", "Tenth"
                Console.WriteLine(" set has the most {0} numbers: {1}", type, maxCount);





                maxCount = 0;// obhojdame masiva i ako namerim po-golqma stoinost ot tova chislo mu prisloqvame po-golqmata stoinost// purvo se opita s int maxCount = int.MinValue; zashtoto broqcha ne moje da e otricatelno chislo
                maxIndex = -1;// -1 zashtoto ako sloja 0 tekushtiqt index e 0 koito go imame

                for (int j = 0; j < totalSum.Length; j++)// v tozi for obhojdame masiva totalCount koito mi e zapizil proeneto ot vsi4ki setove za da opredelq v koi set e ima nai mn ot zadadeniqt tip/odd or even
                {
                    if (totalSum[j] > maxCount)// proverqvame vseki edin index dali e po-golqm ot maksimalnoto 4islo koeto imame v momenta koeto pri purvot zavurtane e 0
                    {
                        maxCount = totalSum[j];// i ako e po-golqmo maxCount priema stoinosta na tova chislo ot indexa na masiva totalCount[j]
                        maxIndex = j;// go tvame da e = ravno na index  ot for zashtoto se iska da  kajem v koi set ot totalCount ima nai-mnogo nujen type
                    }
                }

                if (maxCount == 0)// ne se uvelichi i ostane 0 da ptirnti tova tova e kogato tursim naprimer EVEN a nasqkude v setovete imame samo ODD
                {
                    Console.WriteLine("No");// zatova maxIndex = -1 ako nqma nai-golqma chislo i maxIndex ostane -1 togava da printi "No"
                }
                else
                {
                    switch (maxIndex + 1)// ako e 0 realno to trqbva da e 1 i prosoto go broim (maxIndex + 1) za da ni dava tova koeto ni trqbva
                    {
                        case 1:
                            Console.Write("First");
                            break;
                        case 2:
                            Console.Write("Second");
                            break;
                        case 3:
                            Console.Write("Third");
                            break;
                        case 4:
                            Console.Write("Fourth");
                            break;
                        case 5:
                            Console.Write("Fifth");
                            break;
                        case 6:
                            Console.Write("Sixth");
                            break;
                        case 7:
                            Console.Write("Seventh");
                            break;
                        case 8:
                            Console.Write("Eighth");
                            break;
                        case 9:
                            Console.Write("Ninth");
                            break;
                        case 10:
                            Console.Write("Tenth");
                            break;
                    }
                    // "First", "Second", "Third", "Fourth", "Fifth", "Sixth", "Seventh", "Eighth", "Ninth", "Tenth"
                    Console.WriteLine(" set has the most {0} sums: {1}", type, maxCount);
                }
            }
        }
    }
}