from itertools import count


def dig_pow(n, p):
    """
    Is there an integer k such as : (a ^ p + b ^ (p+1) + c ^(p+2) + d ^ (p+3) + ...) = n * k ?

    Parameters:
        n: the base integer
        p: the starting point of powers
    Returns:
        k if such integer exists, -1 otherwise
    """
    return None

from itertools import count


def dig_pow(n, p):
    """
    Is there an integer k such as : (a ^ p + b ^ (p+1) + c ^(p+2) + d ^ (p+3) + ...) = n * k ?

    Parameters:
        n: the base integer
        p: the starting point of powers
    Returns:
        k if such integer exists, -1 otherwise
    """
    return None

Is there an integer k such as : (a ^ p + b ^ (p+1) + c ^(p+2) + d ^ (p+3) + ...) = n * k ?      Parameters:         n: the base integer         p: the starting point of powers     Returns:         k if such integer exists, -1 otherwise