We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Strange Counter
  5. Discussions

Strange Counter

Sort 821 Discussions, By:

  • prince03
     + 0 comments
    long c=0,m=3;
    while(t>c+m)
    {
        c+=m;
        m=m*2;
    }
    long a=t-c-1;
    a=m-a;
    return  a;

  • abjerstedt
     + 0 comments

    Kotlin

    fun strangeCounter(t: Long): Long {
    // Write your code here
    var maxValue = 3L;
    var counter = 1L;
    while(maxValue < t) {
        counter *= 2L;
        maxValue = maxValue + counter*3L;
    }
    return maxValue - t + 1L;
}

  • e_soghomonyan98
     + 0 comments

    C# or JS

    public static long strangeCounter(long t)
    {
        long initVal = 3;

        
        while (t > initVal) {
            t -= initVal;
            initVal *= 2;
        }
        
        return initVal - t + 1;

    }

  • ipsita2811
     + 0 comments

    JAVA solution using simple math.

    long time=1,value=3;
        while(time<t)
        {
            time=time+value;
            value=value*2;
        }
        if(time==t)
            return value;
        else
        {
            long prev_t=time-(value/2);
            return (value/2)-(t-prev_t);
        }

  • xuanco941
     + 0 comments

    C#

    public static long strangeCounter(long t)
{
    long timeInit = 3;
    long countValue = 3;
    while (timeInit < t)
    {
        countValue = countValue * 2;
        timeInit = timeInit + countValue;
    }
    return timeInit - t + 1;

}
Load more conversations