python-leetcode求区间[M,N]内的所有素数的个数实现方式

def prime(m, n):
    prime_list = []
    for i in range(m, n):
        for j in range(2, i):
            if i % j == 0:
                break
        else:
            prime_list.append(i)
    return len(prime_list)

def all_prime_number(m, n):
    filter_list = filter(lambda x: not [x % i for i in range(2, x) if x % i == 0], range(m, n))
    return len(list(prime_list))

#include<stdio.h>
#include<math.h>
int main()
{
    int i,limit,M,N,count,j;
    count=0;
    scanf("%d %d",&M,&N);
    if(M>=1&&N>=M&&N<=500)
    {
        for(i=M;i<=N;i++)
        {
            if(i==1)
                continue;
            else if(i==2){
                printf("%6d",2);
                count++;
            }else{
                limit=sqrt(i)+1;
                for(j=2;j<=limit;j++)
                {
                    if(i%j==0)
                    break;
                }
                if(j>limit){
                    printf("%6d",i);
                    count++;
                    if(count%10==0)
                    printf("\n");
                }
            }
        }
    }else{
            printf("Invalid.\n");
        }
        return 0;
}