C language number prime

---

Algorithm design ideas

• Be careful ： The processing of prime numbers requires the use of sqrt Method , Otherwise, the operation will timeout

---

Code

#include <stdio.h>
#include<math.h>

int check_su(int n){
    
	int i;
	int temp=sqrt(n);
	for(i=2;i<=temp;i++){
    
		if(n%i==0){
    
			break;
		} 
	}
	if(i>temp){
    
		return 0;
	}else{
    
		return 1;
	}
}

int main(){
    
	int n, m;
	scanf("%d %d", &n, &m);
	int count = 0;
	int index = 0;
	for(int i=1; i<1000000; i++){
    
		if(check_su(i)==0){
    
			if(count>=n && count<=m){
    
				index++;
				if(index % 10 == 0){
    
					printf("%d\n", i);
				}else{
    
                    if(index == (m-n)+1){
    
                        printf("%d", i);
                        break;
                    }else{
    
                        printf("%d ", i);
                    }
				}
			}
			count++;
		}
	}
	return 0;
}

---

Running results