객체 지향 과제 rep 8-1

 

#include<iostream>
#include<iomanip>
using namespace std;

void print(int prime, int c) {
	if (c == 11) {
		cout << endl << setw(10) << prime;
	}
	else cout << setw(10) << prime;
}

void Prime(int n) {
	int i, j, count = 0, k = 0, flag = 0;
	for (i = 2; i <= n; i++) {

		for (j = 2; j < i; j++) {

			if (i % j == 0) {
				flag = 1;
				break;
			}
		}
		if (flag == 0) {
			count += 1;
			k += 1;
			print(i, count);
			if (count == 11) count = 1;
		}
		flag = 0;
	}
	cout << endl << setw(104) << "---------------------------------------------------------------------------------------------------" << endl;
	cout << setw(65) << "2부터" << n << " 까지 소수의 갯수는 " << k << " 개 입니다.";
	
}


void main() {
	int num;
	cout << ">> 소수 계산 범위 값< 2 - 99999, 종료시 0 > ?";
	while (1) {
		cin >> num;
		if (num == 0) break;
		cout << endl << setw(65) << "소 수  계 산  결 과" << endl;
		cout << setw(65) << "===================" << endl;
		cout << setw(104) << "---------------------------------------------------------------------------------------------------" << endl;
		Prime(num);
		cout << endl << ">> 소수 계산 범위 값< 2 - 99999, 종료시 0 > ?";
	}
}