using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
 
namespace Distinct
{
    class Program
    {
        static void Main(string[] args)
        {
            int ten = 10;
            int[] first = new int[10];
            int[] final = new int[10];
            int counter2,counter3;
 
            Console.Write("\nEnter 10 Numbers: ");
            for (int counter = 0; counter < ten; counter++)
            {
                first[counter] = Convert.ToInt32(Console.ReadLine());
            }
            for (counter2 = 0; counter2 < ten; counter2++)
            {
                if (final[0] & final[1] & final[2] & final[3] & final[4]  & final[5] & final[6] & final[7] & final[8] & final[9] != first[counter2])
                {
                    final[counter2] = first[counter2];
                }
            }
         for(counter3=0; counter3<ten; counter3++)
         {
             Console.WriteLine(final[counter3]);
         }
 
 
 
 
 
        Console.ReadKey();
 
    }
    }   
}

for (counter2 = 0; counter2 < ten; counter2++)
            {
                if (final[0] & final[1] & final[2] & final[3] & final[4]  & final[5] & final[6] & final[7] & final[8] & final[9] != first[counter2])
                {
                    final[counter2] = first[counter2];
                }
            }

if (final[0] & final[1] & final[2] & final[3] & final[4]  & final[5] & final[6] & final[7] & final[8] & final[9] != first[counter2])

            // the number of distinct values found
            int numberOfDistinctNumbers = 0;
 
            // external loop will go through the entire First array
            // to check if the value already exist in the Final array
            for (int counter = 0; counter < ten; counter++)
            {
                // true - if the value of First[counter]
                // already exist in array
                bool alreayExist = false;
 
                // then we go through the Final array
                for (counter2 = 0; counter2 < numberOfDistinctNumbers; counter2++)
                {
                    // After the first occurrence of the value of First[counter]
                    // in the Final array - we setting the alreayExist to
                    // true and going out of that cycle
                    if (first[counter] == final[counter2])
                    {
                        alreayExist = true;
                        break;
                    }
                }
 
                // If we haven't found any occurrence of that number
                // in Final array - then it's distinct and we're adding it
                if (!alreayExist)
                {
                    final[numberOfDistinctNumbers] = first[counter];
                    numberOfDistinctNumbers++;
                }
            }

using System;
using System.Collections.Generic;
using System.Text;
using System.Linq;
 
namespace daniweb.console
{
  public static class Main5
  {
    public static void Main()
    {
      List<int> lst = new List<int>();
      Console.WriteLine("Enter 10 numbers");
      while (lst.Count < 10)
      {
        Console.Write("Enter number #[{0:F0}]: ", lst.Count + 1);
        int i;
        if (int.TryParse(Console.ReadLine(), out i))
          lst.Add(i);
        else
          Console.WriteLine("Invalid input. Please try again");
      }
 
 
      lst.Sort();
      int[] uniques = lst.Distinct().ToArray();
      Console.WriteLine("You entered the unique numbers: {0}", string.Join(", ", uniques.ToList().ConvertAll<string>(Convert.ToString).ToArray()));
      Console.ReadLine();
    }
  }
}

 List<int> lst = new List<int>();