Seeking prime number by screening method

From , 4 Years ago, written in C, viewed 51 times.

#include <stdio.h>
#include <stdlib.h>
#define N 1000
 
int main ( void )
{
        int i, j;
        int prime[N+1];
 
        for ( i = 2; i <= N; i++ )
                prime[i] = 1;
 
        for ( i = 2; i*i <= N; i++ )   // 这边可以改进
        {
                if ( prime[i] == 1 )
                {
                        for ( j = 2*i; j <= N; j++ )
                        {
                                if ( j % i == 0 )
                                        prime[j] = 0;
                        }
                }
        }
 
        for ( i = 2; i < N; i++ )
        {
                if ( prime[i] == 1 )
                {
                        printf ( "%4d ", i );
                        if ( i % 16 == 0 )
                                printf ( "\n" );
                }
        }
 
        printf ( "\n" );
        return 0;
}
 

Reply to "Seeking prime number by screening method"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Seeking prime number by screening method

Reply to "Seeking prime number by screening method"