작은숲:위키노트/C 언어 예제/소수를 찾아 배열에 저장시키기: 두 판 사이의 차이
잔글 문자열 찾아 바꾸기 - "분류:공유" 문자열을 "분류:위키노트/공유" 문자열로 |
잔글 문자열 찾아 바꾸기 - "<source" 문자열을 "<syntaxhighlight" 문자열로 |
||
| 1번째 줄: | 1번째 줄: | ||
< | <syntaxhighlight lang="c"> | ||
/** | /** | ||
* Copyright (c) 2001,2002 Yoon, Hyunho <hhyoon@kldp.org> | * Copyright (c) 2001,2002 Yoon, Hyunho <hhyoon@kldp.org> | ||
2021년 3월 28일 (일) 12:51 판
<syntaxhighlight lang="c"> /**
* 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>
int main() { int i, j, num = 0;
int prime[100] = { 0, };
for (i = 2; i <= 100; i++) {
for (j = 2; j < i; j++) {
if (i % j == 0)
break;
}
if (i == j) {
prime[nu= i;
num++;
}
}
for (i = 0; i < num; i++)
printf("Prime#%2d: %3d\n", i + 1, prime[i]);
return 0;
}</source>