C语言解答

#include <stdio.h>
int main(void)
{
	int m,n,i,j,z;
	scanf("%d%d",&m,&n);
	for (i=m;i<=n;i++)
	{
		for (j=2;j<i;j++)
		{
			if (i%j==0)
				break;
			else if (i==j+1)
			 {
				 printf ("%d ",i);
				 z++;
		     }
		}
		if (z==10)
		{
			printf("\n");
			z=0;
		}
	}
	return 0;
}

C++解答

#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
bool a[10000];
int main()
{
	int m,n;
	cin>>m>>n;
	memset(a,true,sizeof(a));
	a[0]=a[1]=false;
	int t=sqrt(n);
	for (int i=2; i<=t; i++)
		if (a[i])
			for (int j=2*i; j<=n; j+=i) a[j]=false;
	t=0;
	for (int i=m; i<=n; i++)
		if (a[i])
		{
			cout<<i<<" ";
			t++;
			if (t%10==0) cout<<endl;
		}
	if (t%10) cout<<endl;
	return 0;
}

Java解答

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int m =sc.nextInt();
		int n = sc.nextInt();
		int count = 0;
		for (int i = m; i <= n; i++) {
			for (int j = 2; j <= i; j++) {
				if(i%j!=0) {
					continue;
				}else if(j==i){
					if(count%10==0&&count!=0) {
						System.out.println();
					}
					System.out.print(i+" ");
					count++;
				}else {
					break;
				}
			}
		}
	}
}

Python解答

# coding=utf-8
def is_prime(x):
    if x==1:
        return False
    for i in range(2,int(x**0.5+1)):
        if x%i==0:
            return False
    return True
m,n=map(int,input().split())
i=0
for x in range(m,n+1):
    if is_prime(x):
        i+=1
        if i%10:
            print(x,end=' ')
        else:
            print(x)