Fibonacci Puzzle

>>> def fibo(n):
    a = 0
    b = 1
    for i in range(1,n):
        c = b
        b = a+b
        a = c
    return b
>>> a = 1
>>> G = ['0','1','2','3','4','5','6','7','8','9']
>>> while(sorted(set(list(str(fibo(a)))))!=G):
    a = a+1
>>>print fibo(61)

def goal(n):
    number = str(n)
    for digit in '1234567890':
        if digit not in number:
            return False
    return True
memo = {1:0,2:1}
def fib(n):
    if n in memo:
        return memo[n]
    memo[n] = fib(n-1)+fib(n-2)
    return memo[n]
n = 1
while not goal(fib(n)):
    n += 1
print "Answer:", fib(n)

public static void main(String args[]){
    DecimalFormat df = new DecimalFormat("###.#");
    double a = 1, b = 1;
    while(true){
        a += b;
        b += a;
        if(numchk(df.format(a)))
            System.out.println(a);
        else if(numchk(df.format(b)))
            System.out.println(b);
    }
}

static boolean numchk(String n){
    return n.contains("0") && n.contains("1") && n.contains("2") && n.contains("3") && n.contains("4") &&
    n.contains("5") && n.contains("6") && n.contains("7") && n.contains("8") && n.contains("9");
}