aboutsummaryrefslogtreecommitdiff
path: root/MarcCakwalk
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /MarcCakwalk
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'MarcCakwalk')
-rw-r--r--MarcCakwalk/MarcCakwalk.cpp18
1 files changed, 18 insertions, 0 deletions
diff --git a/MarcCakwalk/MarcCakwalk.cpp b/MarcCakwalk/MarcCakwalk.cpp
new file mode 100644
index 0000000..91884fd
--- /dev/null
+++ b/MarcCakwalk/MarcCakwalk.cpp
@@ -0,0 +1,18 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+ int n;
+ long sum;
+ cin >> n;
+ vector<long> v(n);
+ for(auto &x : v){
+ cin >> x;
+ }
+ sort(v.begin(), v.end());
+ for(int i = 0; i < n; i++){
+ cout << "v[" << i << "] = " << v[i] << " * " << "2^" << n - i - 1 << endl;
+ sum += v[i] * pow(2, n - i - 1);
+ }
+ cout << sum << endl;
+ return 0;
+}