#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <time.h>

int is_prime(int number) {
	if (number <= 1)
		return 0;
	else if (number <= 3)
		return 1;
	else if (number % 2 == 0 || number % 3 == 0)
		return 0;
	int i = 5;
	while (i*i <= number) {
		if (number % i == 0 || number % (i + 2) == 0) {
			return 0;
		}
		i = i + 6;
	}
	return 1;
}

int is_sum_of_prime_numbers(int number) {
	int tmp[1000];
	int i = 1;
	int k = 0;

	while (i < number) {
		if (is_prime(i) == 1) {
			tmp[k] = i;
			k++;
		}
		i++;
	}

	for (int j = 0; j < k; j++) {
		for (i = j + 1; i < k; i++) {
			if (tmp[j] + tmp[i] == number) {
				printf("\n%02d + %02d = %02d \n\n", tmp[j], tmp[i], number);
				return 1;
			}
		}
	}

	return 0;
}

//int nulierti(int number)
//{
//	if (is_sum_of_prime_numbers(number) == 1)
//	{
//		for (int j = number - 1; j > 0; j--)
//		{
//			if (is_prime(j + 8) == 1)
//			{
//				return 1;
//				break;
//			}
//		}
//	}
//	r
//}

main()
{
	srand(time(NULL));
	int m[100];
	int k = 0;

	int i = 0;
	int r = 0;

	while (i < 100)
	{
		r = rand() % 1000;

		if (is_sum_of_prime_numbers(r) == 1)
		{
			for (int j = r - 1; j > 0; j--)
			{
				if (is_prime(j + 8) == 1)
				{
					m[i] = r;
					break;
				}
			}
			i++;
		}


	}

	printf("\n\n");

	for (int i = 0; i < 100; i++) {
		printf("%02d ", m[i]);
	}

	printf("\n");
	getchar();
}