Get Prefix Sum in reverse order solved

Author: MohammadFahad1

.cph/.Get_Prefix_Sum.cpp_db12d26a4b298b8bc6195387993b7c46.prob

@@ -1 +1 @@
-{"name":"Get Prefix Sum","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/get-prefix-sum","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"5\n2 4 1 5 3\n","output":"15 12 7 6 2\n","id":1720451124204},{"input":"3\n1000000000 1000000000 1000000000\n","output":"3000000000 2000000000 1000000000\n","id":1720451124183}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"GetPrefixSum"}},"batch":{"id":"57a1fb33-447e-4a69-8e7a-be0dbcab2d94","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Get_Prefix_Sum.cpp"}
+{"name":"Get Prefix Sum","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/get-prefix-sum","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"5\n2 4 1 5 3\n","output":"15 12 7 6 2\n","id":1720451124204},{"id":1720451124183,"input":"3\n1000000000 1000000000 1000000000\n","output":"3000000000 2000000000 1000000000\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"GetPrefixSum"}},"batch":{"id":"57a1fb33-447e-4a69-8e7a-be0dbcab2d94","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Get_Prefix_Sum.cpp"}

Get_Prefix_Sum.bin

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    long long int n;
+    cin >> n;
+    long long int a[n];
+    long long int pref[n];
+    for (long long int i = 0; i < n; i++)
+    {
+        cin >> a[i];
+        if (i == 0)
+            pref[i] = a[i];
+        else
+            pref[i] = a[i] + pref[i - 1];
+    }
+
+    for (long long int i = n - 1; i >= 0; i--)
+    {
+        cout << pref[i] << " ";
+    }
+
+    return 0;
+}