441. Arranging Coins

You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.

Given n, find the total number of full staircase rows that can be formed.

n is a non-negative integer and fits within the range of a 32-bit signed integer.

Example 1:

n = 5

The coins can form the following rows:
¤
¤ ¤
¤ ¤

Because the 3rd row is incomplete, we return 2.

Example 2:

n = 8

The coins can form the following rows:
¤
¤ ¤
¤ ¤ ¤
¤ ¤

Because the 4th row is incomplete, we return 3.

class Solution(object):
    def arrangeCoins(self, n):
        """
        :type n: int
        :rtype: int
        """
        import math
        for x in range(int(math.sqrt(2*n))+1):
            if n-(x*x+x)/2<(x+1):
                return x
                
        # s = 0
        # b = 0x8000
        # while b:
        #     s ^= b
        #     m = s * (s + 1) >> 1
        #     if m > n:
        #         s ^= b
        #     b >>= 1
        
        # return s