Merge pull request #5 from kristian3551/solving/8and9fromsem3

solved ex 8 and 9 from sem. 3

2 files changed, 55 insertions, 0 deletions

diff --git a/Sem. 03/solutions/exercise 8 - dollar pyramid.cpp b/Sem. 03/solutions/exercise 8 - dollar pyramid.cpp
new file mode 100644
index 0000000..65f6106
--- /dev/null
+++ b/Sem. 03/solutions/exercise 8 - dollar pyramid.cpp
@@ -0,0 +1,19 @@
+#include <iostream>
+using namespace std;
+
+int main() 
+{
+
+    int n;
+    cin >> n;
+
+    for(int i = 1; i <= n; i++) 
+    {
+        for(int j = 1; j <= i; j++) 
+            cout << "$" << " "; // print as many dollars as the number of the current row
+        
+        cout << endl;
+    }
+    
+    return 0;
+}
\ No newline at end of file
diff --git a/Sem. 03/solutions/exercise 9 - rightmost pyramid.cpp b/Sem. 03/solutions/exercise 9 - rightmost pyramid.cpp
new file mode 100644
index 0000000..d1b339a
--- /dev/null
+++ b/Sem. 03/solutions/exercise 9 - rightmost pyramid.cpp
@@ -0,0 +1,36 @@
+#include <iostream>
+using namespace std;
+
+int main() 
+{
+
+    int n;
+    cin >> n;
+
+    // print the first part of the pyramid (the one going from 1 to n(n-1)...21)
+    
+    for(int i = 1; i <= n; i++) 
+    {
+        for(int k = n - i - 1; k >= 0; k--) 
+            cout << " "; // print the spaces
+        
+        for(int j = i; j >= 1; j--) 
+            cout << j; // print numbers j(j - 1)...21
+        
+        cout << endl;
+    }
+    // print the second part of the pyramid (the one going from (n-1)...21 to 1
+    
+    for(int i = n - 1; i >= 1; i--) 
+    {
+        for(int k = n - i - 1; k >= 0; k--) 
+            cout << " ";
+        
+        for(int j = i; j >= 1; j--) 
+            cout << j;
+        
+        cout << endl;
+    }
+
+    return 0;
+}
\ No newline at end of file