Template : https://www.hackerrank.com/challenges/arithmetic-progressions

AP.cs

using System;
using System.Collections.Generic;

class Solution 
{
    //Get N
    // Read N sequences into an array
    // scan N array
    //read q 
    // read each operation and perform action.
    // query(AP)
        //Divide until you solve to the minimum number 2
        //Conquer
            //take the difference
        //combine
            //check if difference is 0. output that as const and note the level as k
    //Update(AP)
        //Update the values of p by adding v.
    //Multiply(Array)
        // Loop thru the sequence
        // output G'
    //Power(Array)
        //loop thru the sequence
        //power each number
        //output F'

        // if bucket contains n-2 then c++
        //if bucket contains n+2 then c++
        // add number to bucket.
        // 5 2
        // 1 5 3 4 2
    static void Main()
    {

    }
}