[정올 2811] 소수와 합성수

 

#include <stdio.h>

int Num[5];

enum Type{
	PRIME = 0,
	COMPOSITE,
	NONE,
	MAX
};

const char* Str[MAX] = {
	"prime number", "composite number", "number one"
};

void Input()
{
	for (int i = 0; i < 5; i++)
	{
		scanf("%d", Num + i);
	}
}

Type IsPrimeOrComposite(int n)
{
	if (n == 1) return NONE;

	int cnt = 0;
	for (int i = 2; i * i <= n; i++)
	{
		if (n % i == 0)
		{
			return COMPOSITE;
		}
	}

	return PRIME;
}

int main(void)
{
	Input();

	for (int i = 0; i < 5; i++)
	{
		Type T = IsPrimeOrComposite(Num[i]);
		printf("%s\n", Str[T]);
	}
	
	return 0;
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=452&sca=99&sfl=wr_hit&stx=2811 

JUNGOL