작은숲:위키노트/C 언어 예제/소수 찾기 2

큰숲백과, 나무를 보지 말고 큰 숲을 보라.
/**
 * Copyright (c) 2001,2002 Yoon, Hyunho <hhyoon@kldp.org>
 * http://mooo.org
 * ----------------------------------------------------------------------
 *
 * LICENSE
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software 
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */
#include <stdio.h>
#include <stdlib.h>
#include <sys/timeb.h>
#define MAX_NUM        100000
#define PRINT        0
void main(void)
{    int i, j, count = 0;
    struct _timeb start, finish;
    
    _ftime(&start);
    for (i = 2; i <= MAX_NUM; i++) {
        for (j = 2; j < i; j++) {
            if (i % j == 0)
                break;
        }
        if (i == j) {
            if (PRINT)
                printf("%3d is a prime.\n", i);
            count++;
        }
    }
    _ftime(&finish);
    printf("Num of primes from 2 to %d: %d\n", MAX_NUM, count);
    printf("%.3f seconds\n", (finish.time + finish.millitm / 1000.)
                            - (start.time + start.millitm / 1000.));
}
이 작은숲 문서의 출처는 위키노트의 위키노트/C 언어 예제/소수 찾기 2 문서입니다.