class Solution(object):
    def searchInsert(self, nums, target):
        left=0
        right=len(nums)-1
        
        while left<=right:
            mid=(left+right)//2
            if nums[mid]==target:
                return mid
            elif nums[mid]>target:
                right=mid-1
            else:
                left=mid+1
        return left

class Solution(object):
    def searchInsert(self, nums, target):
        k=0
        s=0
        for i in range(len(nums)):
            if nums[i]!=target:
                k+=1
            else:
                return k
        for j in range(1,len(nums)):
            if nums[j-1] < target:
                if nums[j] > target:
                    return j
        return(len(nums))

class Solution(object):
    def judgeSquareSum(self, c):
        for i in range(c):
            for j in range(c):
                if i**2+j**2==c:
                    return True
        return False