using System;

using System.Collections.Generic;

public class Program

{

    public static void Main()

    {

        DoExample();

    }

    /// <summary>

    /// Should print a message mentioning the number of primes between 1 and 101

    /// inclusively, [1,101], as well as a list of those prime numbers.

    /// </summary>

    public static void DoExample()

    {

        var list = new List<int>();

        for ( int i = 0; i < 101; i++ )

        {

            list.Add( i );

        }

​

        var primes = new List<int>();

        foreach ( var item in list )

        {

            if ( IsPrime( item ) ) primes.Add( item );

        }

​

        var primeMessage = string.Empty;

        for ( int i = 0; i < primes.Count; i++ )

        {

            if ( i == primes.Count - 1 ) primeMessage = primeMessage + primes[ i ];

            else primeMessage = primeMessage + primes[ i ] + ", ";

        }

        Console.WriteLine( "There are {0} primes in the range [1-101]: {1}", primes.Count, primeMessage );

    }

​

    /// <summary>

    /// Determines if a given number n is prime or not.

    /// A prime number is defined as a whole number, greater than 1, that is only divisible by itself and 1.

    /// </summary>

    /// <param name="n">The number to evaluate.</param>

    /// <returns>True if n is prime.</returns>

    private static bool IsPrime( int n )

    {

        for ( int i = 2; i < n; i++ )

        {

            if ( n % i == 0 ) return false;

        }

​

        return true;

    }

}