2023.2.1质数排序

抗压下水道

[C++] 纯文本查看 复制代码

#include <bits/stdc++.h>
#include <time.h>
using namespace std;
int zs(int i) 
{
	int n, flag = 0;
	for (n = 2; n <= i - 1; n++) 
	{
		if (i % n == 0) 
		{
			flag = 1;
			break;
		}
	}
	return flag;
}
int main() 
{
	int a[10];
	int b[12];
	int count = 0;
	srand(time(0));
	for (int i = 0; i <= 9; i++) 
	{
		a[i] = rand() % 100;
		cout << a[i] << " ";
	}
	cout << endl;
	for (int i = 0; i <= 9; i++) 
	{
		if (zs(a[i]) != 1) 
		{
			b[count] = a[i];
			count++;
		}
	}
	sort(b, b + count);
	for (int i = 0; i <= count - 1; i++) 
	{
		cout << b[i] << endl;
	}
	return 0;
}