输出素数

for i in range(1,100,1):
    k={}
    if i==0:continue
    for j in range(i):
        j+=1
        if i%j==0:
            k[j]=j
        else :continue
    if len(k)==2:
        print(i)
    else:continue
    

用类来实现

class Prime1000():
    def __init__(self):
        self.value=1
    def __iter__(self):
        return self
    def __next__(self):
        boolen=False
        while not boolen:
            self.value+=1
            if self.value>1000:
                raise StopIteration()
            sqrt=self.value//2
            if self.value<=3:
               boolen=True
               break
            for i in range(2,sqrt+1):
                if self.value%i==0:
                    boolen=False
                    break
            else:
                boolen=True
                break
        return self.value

lst=[]
for i in Prime1000():
    lst.append(i)
    print(i)
print(len(lst))