Editorial : Plot the pattern

Author: GURMEHAR-PEC

Plot-the-Pattern/A_Treasure_Hunt/Treasure_Hunt.cpp

@@ -0,0 +1,34 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n;
+    cin >> n;
+    vector<vector<int>> ans;
+
+    int cnt = 1;
+    for (int i = 1; i <= n; i++)
+    {
+        vector<int> temp;
+        for (int j = 0; j < i; j++)
+        {
+            temp.push_back(cnt);
+            cnt++;
+        }
+        ans.push_back(temp);
+    };
+    for (auto it : ans)
+    {
+        for (auto ele : it)
+            cout << ele << " ";
+        cout << "\n";
+    }
+    for (int i = n - 1; i >= 0; i--)
+    {
+        for (int j = ans[i].size() - 1; j >= 0; j--)
+        {
+            cout << ans[i][j] << " ";
+        }
+        cout << "\n";
+    }
+}

Plot-the-Pattern/A_Treasure_Hunt/Treasure_Hunt.py

@@ -0,0 +1,15 @@
+n = int(input())
+cnt = 1
+
+for i in range(1, n + 1):
+    for j in range(i):
+        print(cnt, end=" ")
+        cnt += 1
+    print()
+
+start = cnt - 1
+for i in range(n, 0, -1):
+    for j in range(i):
+        print(start, end=" ")
+        start -= 1
+    print()

Plot-the-Pattern/B_Chetanya_loves_triangles/Chetanya_loves_triangles.cpp

@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int rows;
+    cin >> rows;
+
+    for (int i = 1; i <= rows; i++)
+    {
+        for (int j = 2 * rows - i; j > i; j--)
+        {
+            cout << " ";
+        }
+
+        for (int j = i; j >= 1; j--)
+        {
+            if (j == i || j == 1)
+            {
+                cout << "* ";
+            }
+            else
+            {
+                cout << "  ";
+            }
+        }
+
+        cout << endl;
+    }
+
+    for (int i = rows - 1; i >= 1; i--)
+    {
+        for (int j = 2 * rows - i; j > i; j--)
+        {
+            cout << " ";
+        }
+
+        for (int j = i; j >= 1; j--)
+        {
+            if (j == i || j == 1)
+            {
+                cout << "* ";
+            }
+            else
+            {
+                cout << "  ";
+            }
+        }
+
+        cout << endl;
+    }
+
+    return 0;
+}

Plot-the-Pattern/B_Chetanya_loves_triangles/Chetanya_loves_triangles.py

@@ -0,0 +1,25 @@
+rows = int(input())
+
+for i in range(1, rows + 1):
+    for j in range(2 * rows - i, i, -1):
+        print(" ", end="")
+
+    for j in range(i, 0, -1):
+        if j == i or j == 1:
+            print("* ", end="")
+        else:
+            print("  ", end="")
+
+    print() 
+
+for i in range(rows - 1, 0, -1):
+    for j in range(2 * rows - i, i, -1):
+        print(" ", end="")
+
+    for j in range(i, 0, -1):
+        if j == i or j == 1:
+            print("* ", end="")
+        else:
+            print("  ", end="")
+
+    print()

Plot-the-Pattern/C_Protection_Against_Evil_Forces_and_Energies/Protection_Against_Evil_Forces_and_Energies.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+using namespace std;
+string generate(int cnt, int n)
+{
+    string ans;
+    if (2 * cnt >= n)
+    {
+        for (int i = 0; i < n; i++)
+        {
+            ans += '*';
+            ans += ' ';
+        }
+        return ans;
+    }
+    else
+    {
+        for (int i = 0; i < cnt; i++)
+        {
+            ans += '*';
+            ans += ' ';
+        }
+        for (int i = 0; i < n - 2 * cnt; i++)
+        {
+            ans += ' ';
+            ans += ' ';
+        }
+        for (int i = 0; i < cnt; i++)
+        {
+            ans += '*';
+            ans += ' ';
+        }
+    }
+    return ans;
+}
+int main()
+{
+    int n;
+    cin >> n;
+    vector<string> v1;
+    int startvalue = (n / 2) + 1;
+    for (int i = startvalue; i >= 1; i--)
+    {
+        cout << generate(i, n) << "\n";
+    }
+    for (int i = 2; i <= startvalue; i++)
+    {
+        cout << generate(i, n) << "\n";
+    }
+}

Plot-the-Pattern/C_Protection_Against_Evil_Forces_and_Energies/Protection_Against_Evil_Forces_and_Energies.py

@@ -0,0 +1,24 @@
+def generate(cnt, n):
+    result = ""
+    
+    if 2 * cnt >= n:
+        result = "* " * n
+    else:
+        result += "* " * cnt
+        result += "  " * (n - 2 * cnt)
+        result += "* " * cnt
+    
+    return result
+
+n = int(input())
+pattern = []
+
+start_value = (n // 2) + 1
+for i in range(start_value, 0, -1):
+    pattern.append(generate(i, n))
+
+for i in range(2, start_value + 1):
+    pattern.append(generate(i, n))
+
+for line in pattern:
+    print(line)

Plot-the-Pattern/D_Numerical_Nebula/Numerical_Nebula.cpp

@@ -0,0 +1,59 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    int n;
+    cin >> n;
+    int cnt1 = n / 2;
+    int cnt2 = n / 2;
+    int cnt3 = 1;
+    bool check = false;
+    for (int i = 0; i < n + 2; i++)
+    {
+        cout << '*';
+    }
+    cout << endl;
+    for (int j = 0; j < n; j++)
+    {
+        cout << '*';
+        for (int i = 0; i < n; i++)
+        {
+            if (i == cnt1 || i == cnt2)
+            {
+                cout << cnt3;
+                cnt3++;
+                if (cnt3 == 10)
+                {
+                    cnt3 = 0;
+                }
+            }
+            else
+            {
+                cout << ' ';
+            }
+        }
+        if (check == false)
+        {
+            cnt1++;
+            cnt2--;
+            if (cnt2 == 0)
+            {
+                check = true;
+            }
+        }
+        else
+        {
+            cnt1--;
+            cnt2++;
+        }
+        cout << '*' << endl;
+    }
+    for (int i = 0; i < n + 2; i++)
+    {
+        cout << '*';
+    }
+    cout << endl;
+    return 0;
+}

Plot-the-Pattern/D_Numerical_Nebula/Numerical_Nebula.py

@@ -0,0 +1,32 @@
+n = int(input())
+
+cnt1 = n // 2
+cnt2 = n // 2
+cnt3 = 1
+check = False
+
+print('*' * (n + 2))
+
+for j in range(n):
+    print('*', end="")
+    for i in range(n):
+        if i == cnt1 or i == cnt2:
+            print(cnt3, end="")
+            cnt3 += 1
+            if cnt3 == 10:
+                cnt3 = 0
+        else:
+            print(' ', end="")
+    
+    if not check:
+        cnt1 += 1
+        cnt2 -= 1
+        if cnt2 == 0:
+            check = True
+    else:
+        cnt1 -= 1
+        cnt2 += 1
+
+    print('*')
+
+print('*' * (n + 2))

Plot-the-Pattern/E_Star-Hash_Pattern/Star-Hash_Pattern.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    vector<vector<char>> vec(2 * n, vector<char>(2 * n, '*'));
+    int i = 1;
+    while (i < n)
+    {
+        int rs = i, cs = i, re = 2 * n - i, ce = 2 * n - i;
+        int rowStart = rs, colStart = cs;
+        while (rs != re)
+        {
+            vec[rs][cs] = '#';
+            vec[rs][ce - 1] = '#';
+            rs++;
+        }
+        rs = rowStart;
+        while (cs != ce)
+        {
+            vec[rs][cs] = '#';
+            vec[re - 1][cs] = '#';
+            cs++;
+        }
+        i += 2;
+    }
+
+    for (int i = 0; i < 2 * n; i++)
+    {
+        for (int j = 0; j < 2 * n; j++)
+        {
+            cout << vec[i][j];
+        }
+        cout << "\n";
+    }
+}

Plot-the-Pattern/E_Star-Hash_Pattern/Star-Hash_Pattern.py

@@ -0,0 +1,25 @@
+n = int(input())
+
+vec = [['*' for _ in range(2 * n)] for _ in range(2 * n)]
+
+i = 1
+while i < n:
+    rs, cs = i, i
+    re, ce = 2 * n - i, 2 * n - i
+    row_start, col_start = rs, cs
+
+    while rs != re:
+        vec[rs][cs] = '#'
+        vec[rs][ce - 1] = '#'
+        rs += 1
+
+    rs = row_start
+    while cs != ce:
+        vec[rs][cs] = '#'
+        vec[re - 1][cs] = '#'
+        cs += 1
+
+    i += 2
+
+for row in vec:
+    print("".join(row))