code_iq: 1217

q1217.py

# -*- coding: utf-8 -*-

class code_iq:

    def do(self, n):
        _max = ()
        for v in self.prime_numbers(n):
            if self.is_kai(v):
                _max = v,
        print _max[0]

    def is_kai(self, n):
        l    = list(str(n))
        keta = len(l)
        if keta == 1:
            return False
        if self.is_even(keta):
            return self.is_kai_for_even(l)
        self.remove_center_num(l)
        return self.is_kai_for_even(l)

    def is_kai_for_even(self, l):
        for v in range(1, len(l) / 2 + 1):
            if l[v-1] != l[-(v)]:
                return False
        return True

    def remove_center_num(self, l):
        del l[len(l) / 2]

    def is_even(self, n):
        return True if n % 2 == 0 else False

    def prime_numbers(self, n):
        prime_numbers = []
        numbers = range(2, n + 1)
        for i in range(2, n + 1):
            if i not in numbers:
                continue
            prime_numbers.append(i)
            for j in range(i, n + 1, i):
                if j in numbers:
                    numbers.remove(j)
        return prime_numbers

if __name__ == '__main__':
    code = code_iq()
    code.do(1000)