@echo off
title Eric Burcham's IP Configuration Batch File - 2005
setlocal
set OK=N



:again
    set /p choice=Please enter 1[Home], 2[School] or END ??
    if /i [%choice%]==[END] endlocal&goto end
    if [%choice%]==[] goto again
    if [%choice%]==[1] goto 1
    if [%choice%]==[2] goto 2
    set /p xxx=wrong entry, press any key to exit. 
    endlocal
    goto end



:1
    echo NIC setting for Home being configured.....
    @netsh exec home.txt
    set /p see=IP changed successfully to Home Settings [9]see new setting [Enter]exit...
    if [%see%]==[9] goto show
    echo Ending IP Configuration
    goto end



:2
    echo NIC setting for School being configured.....
    @netsh exec school.txt
    set /p see=IP changed successfully to School Settings [9]see new setting [Enter]exit...
    if [%see%]==[9] goto show
    echo Ending IP Configuration
    goto end



:show
@netsh int ip show config



:end
@echo on
cls

# ----------------------------------
# Interface IP Configuration         
# ----------------------------------
pushd interface ip


# Interface IP Configuration for "Wireless Network Connection"
set address name="Wireless Network Connection" source=static addr=192.168.2.50 mask=255.255.255.0
set address name="Wireless Network Connection" gateway=192.168.2.1 gwmetric=0
set dns name="Wireless Network Connection" source=static addr=192.168.2.1 register=primary


popd
# End of interface IP configuration

# ----------------------------------
# Interface IP Configuration         
# ----------------------------------
pushd interface ip


# Interface IP Configuration for "Wireless Network Connection"
set address name="Wireless Network Connection" source=dhcp
set dns name="Wireless Network Connection" source=dhcp register=primary
set wins name="Wireless Network Connection" source=dhcp


popd
# End of interface IP configuration

/// <summary>
/// This method should return the greatest possible sum of consecutive integers within the array "numbers"
///
/// Please note that the solution should be as efficient as possible ans not be breakable.
///
/// If all numbers in the array are negative, return 0
/// </summary>
/// <param name="numbers">Integer array</param>
/// <returns></returns>
public static int GreatestConsecutiveSum(int[] numbers)
{
    // Examples
    //-1, -2, -3          returns 0
    // 0, 1, 2, 3, -1     returns 6
    // -10, 1, 2, 3       returns 6
    // 1, 2, 3, -10, 20    returns 20
    // 1, 2, 3, -5, 20     returns 21

    int sum = 0; // Variable to hold greatest sum
    int temp = 0; // Working variable

    for (int i = 0; i < numbers.Length; i++)
    {
        temp += numbers[i];

        if (temp < 0)
        {
            temp = 0;
        }

        if (temp > sum)
        {
            sum = temp;
        }
    }

    // Return answer
    return sum;
}

/// <summary>
/// This method should return whether or not an integer is a prime number
///
/// Please note that the solution should be as efficient as possible and not be breakable.
/// </summary>
/// <param name="number">Integer to be tested</param>
/// <returns>true or false</returns>
public static bool IsPrime(int number)
{
    // Throw out impossibles
    if (number < 2)
    {
        return false;
    }

    // Don't need to test above the square root of a number
    for (int i = 2; i < (number); i++)
    {
        // If remainder is 0, number is not prime
        if (number % i == 0)
        {
            // return false
            return false;
        }
    }

    // If all conditions are met, return true
    return true;
}

/// <summary>
/// This method should return the product of the two given integers.
///
/// Do not use built in operatros such as "*"
///
/// Please note that the solution should be as efficient as possible and not be breakable.
///
/// Do not worry about results that are out of the normal integer range.
/// </summary>
/// <param name="x">Integer to be multiplied</param>
/// <param name="y">Integer to be multiplied</param>
/// <returns>The product of the two integers</returns>
public static int Multiply(int x, int y)
{
    int product = 0;

    bool isNegative = false; // Variable to store whether or not the product should be negative

    if ((x > 0 && y < 0) || (x < 0 && y > 0))
    {
        isNegative = true;
    }

    // Take absolute values to loop
    x = Math.Abs(x);
    y = Math.Abs(y);

    // We'll loop on x, so make sure it is the smaller integer
    if (y > x)
    {
        int temp = x;
        x = y;
        y = temp;
    }

    // Calculate the product
    for (int i = 0; i < x; i++)
    {
        product += y;
    }

    // Recheck negative condition
    if (isNegative == true)
    {
        product = -product;
    }

    // Return product
    return product;
}

/// <summary>
/// This method should return the greatest possible sum of consecutive integers within the array "numbers"
///
/// Please note that the solution should be as efficient as possible ans not be breakable.
///
/// If all numbers in the array are negative, return 0
/// </summary>
/// <param name="numbers">Integer array</param>
/// <returns></returns>
public static int GreatestConsecutiveSum(int[] numbers)
{
    // Examples
    //-1, -2, -3          returns 0
    // 0, 1, 2, 3, -1     returns 6
    // -10, 1, 2, 3       returns 6
    // 1, 2, 3, -10, 20    returns 20
    // 1, 2, 3, -5, 20     returns 21
        return 0;
}

/// <summary>
/// This method should return the product of the two given integers.
///
/// Do not use built in operators such as "*"
///
/// Please note that the solution should be as efficient as possible and not be breakable.
///
/// Do not worry about results that are out of the normal integer range.
/// </summary>
/// <param name="x">Integer to be multiplied</param>
/// <param name="y">Integer to be multiplied</param>
/// <returns>The product of the two integers</returns>
public static int Multiply(int x, int y)
{
    return 0;
}

/// <summary>
/// This method should return whether or not an integer is a prime number
///
/// Please note that the solution should be as efficient as possible and not be breakable.
/// </summary>
/// <param name="number">Integer to be tested</param>
/// <returns>true or false</returns>
public static bool IsPrime(int number)
{
    return true;
}