fixed issue #56 -sol for 43,44,45,46 added

Author: RohitShah1706

C++/43_Shape1.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n;
+    cin >> n;
+    // ! here toPrint keeps track of number of "#" we need to print in each row
+    int toPrint = n;
+    for (int i = 0; i < n; i++)
+    {
+        // first for loop is for number of rows.
+        for (int j = 0; j < toPrint; j++)
+        {
+            //  this for loop print "#" in each row.
+            cout << "*";
+        }
+        cout << endl;
+        toPrint--;
+    }
+    return 0;
+}

C++/44_Digits.cpp

@@ -0,0 +1,37 @@
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n;
+    cin >> n;
+    for (int i = 0; i < n; i++)
+    {
+        // taking the input
+        long long int tmp;
+        cin >> tmp;
+        if (tmp == 0)
+        {
+            cout << "0" << endl;
+            return 0;
+        }
+        // now inorder to print the number in reverse order we find it's last digit
+        // ! last digit of a number (n) = n%10
+        // ! now that we print it we need to second last digit, so we divide n by 10 and print n%10 in the next turn again
+        // Eg. - n = 1234
+        //  n%10   n
+        //   4     123
+        //   3     12
+        //   2     1
+        //   1     0
+        // now that n is 0 stop the loop
+        while (tmp > 0)
+        {
+            cout << tmp % 10 << " ";
+            tmp = tmp / 10;
+        }
+        cout << endl;
+    }
+
+    return 0;
+}

C++/45_SequenceOfNumber_Sum.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    while (true)
+    {
+        int n, m;
+        cin >> n >> m;
+        // as given in problem statement if either one of n or m <= 0 then stop taking input and print nothing.
+        if (n <= 0 || m <= 0)
+            break;
+        else
+        {
+            int sum = 0;
+            // just swapping n,m if n > m
+            // in this way we can make sure that n < m
+            if (n > m)
+            {
+                int tmp = n;
+                n = m;
+                m = tmp;
+            }
+            // calculating sum for numbers between n and m
+            for (int i = n; i <= m; i++)
+            {
+                cout << i << " ";
+                sum += i;
+            }
+            cout << "sum =" << sum << endl;
+        }
+    }
+    return 0;
+}

C++/46_SumOf_consecutiveOdd_no.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n;
+    cin >> n;
+    while (n--)
+    {
+        int x, y;
+        cin >> x >> y;
+        // just swapping n,m if n > m
+        // in this way we can make sure that n < m
+        if (x > y)
+        {
+            int tmp = x;
+            x = y;
+            y = tmp;
+        }
+        int sum = 0;
+        // because given that print odd numbers exclusive of n,m we start our for loop from n+1 and end at m-1
+        for (int i = x + 1; i < y; i++)
+        {
+            if (i % 2 != 0)
+                sum += i;
+        }
+        cout << sum << endl;
+    }
+
+    return 0;
+}