Solved all unsolved exercises from Seminar 4

1 files changed, 33 insertions, 0 deletions

diff --git a/Sem. 04/Solutions/exercise05.cpp b/Sem. 04/Solutions/exercise05.cpp
new file mode 100644
index 0000000..cfe60e4
--- /dev/null
+++ b/Sem. 04/Solutions/exercise05.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <cmath>
+
+using namespace std;
+
+// Taken from exercise04.cpp
+bool isPrime(int n)
+{
+	double rootOfN = sqrt(n);
+	for (int i = 2; i <= rootOfN; i++)
+	{
+		if (n % i == 0)
+			return false;
+	}
+	return true;
+}
+
+void printPrimeNumberPairs(int n)
+{
+	for (int i = 2; i <= n / 2; i++)
+	{
+		if (isPrime(i) && isPrime(n - i))
+			cout << i << ", " << n - i << endl;
+	}
+}
+
+int main()
+{
+	int n;
+	cin >> n;
+
+	printPrimeNumberPairs(n);
+}