Print X and Inserting inside vector problem solved

Author: MohammadFahad1

.cph/.Insert_it.cpp_28d48cf57636c54b50b466931c9a63c4.prob

@@ -1 +1 @@
-{"name":"Insert it","group":"HackerRank - Assignment 01 | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/assignment-01-a-basic-data-structure-a-batch-05/challenges/insert-the-vector","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"5\n2 3 4 5 6\n3\n10 20 30\n3\n","output":"2 3 4 10 20 30 5 6\n","id":1720457307283},{"input":"5\n2 3 4 5 6\n3\n10 20 30\n0\n","output":"10 20 30 2 3 4 5 6\n","id":1720457307201},{"input":"4\n3 4 5 6\n3\n10 20 30\n4\n","output":"3 4 5 6 10 20 30\n","id":1720457307230}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"InsertIt"}},"batch":{"id":"6b38f826-f801-4885-9a41-cc20efb0e01f","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Insert_it.cpp"}
+{"name":"Insert it","group":"HackerRank - Assignment 01 | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/assignment-01-a-basic-data-structure-a-batch-05/challenges/insert-the-vector","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"5\n2 3 4 5 6\n3\n10 20 30\n3\n","output":"2 3 4 10 20 30 5 6\n","id":1720457307283},{"input":"5\n2 3 4 5 6\n3\n10 20 30\n0\n","output":"10 20 30 2 3 4 5 6\n","id":1720457307201},{"id":1720457307230,"input":"4\n3 4 5 6\n3\n10 20 30\n4\n","output":"3 4 5 6 10 20 30\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"InsertIt"}},"batch":{"id":"6b38f826-f801-4885-9a41-cc20efb0e01f","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Insert_it.cpp"}

.cph/.Printing_X.cpp_d6f3c96cd76e7bcce1a619d439296e9c.prob

@@ -0,0 +1 @@
+{"name":"Printing X","group":"HackerRank - Assignment 01 | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/assignment-01-a-basic-data-structure-a-batch-05/challenges/printing-x","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"5\n","output":"\\   /\n \\ /\n  X\n / \\\n/   \\\n","id":1720458711069},{"input":"7\n","output":"\\     /\n \\   /\n  \\ /\n   X\n  / \\\n /   \\\n/     \\\n","id":1720458711100},{"input":"3\n","output":"\\ /\n X\n/ \\\n","id":1720458711116},{"input":"1\n","output":"X\n","id":1720458711142}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"PrintingX"}},"batch":{"id":"9bf40bd6-eda6-4e05-958e-d80f55fd681e","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Printing_X.cpp"}

Insert_it.bin

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int n, m;
+    cin >> n;
+    vector<int> a(n);
+    vector<int> b(m);
+    for (int i = 0; i < n; i++)
+    {
+        cin >> a[i];
+    }
+
+    cin >> m;
+    for (int i = 0; i < m; i++)
+    {
+        cin >> b[i];
+    }
+    int x;
+    cin >> x;
+    for (int i = 0; i < m; i++)
+    {
+        a.insert(a.begin() + x + i, b[i]);
+    }
+
+    for (int i = 0; i < n + m; i++)
+    {
+        cout << a[i] << " ";
+    }
+
+    return 0;
+}

Insert_it.cpp

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

Printing_X.bin

@@ -1,7 +0,0 @@
-3
-5
-2 4 6 7 10
-8
-1 100 101 120 120 121 1000 1000
-4
-100 1 102 12

Printing_X.cpp

@@ -1,3 +0,0 @@
-YES
-YES
-NO