#!/usr/bin/env python3

import math

def isPrimeOrNot(number):
	if number < 2:
		return 0
	elif number == 2:
		return 2
	else:
		for index in range(2, number - 1):
			if number % index == 0:
				return 1
	return 2
	
for value in range(0, 100):
	if isPrimeOrNot(value) == 2:
		print(value)

 

Python:求0~100内的素数 

相关文章: