diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-04-30 01:13:40 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-04-30 01:13:40 +0200 |
| commit | a0d7b8320a8996eee0ed957b79c3a882f8b47146 (patch) | |
| tree | 76242ae2b19bad00796ed6d0104da8a0e4a99abe /MarcCakwalk.cpp | |
| download | competitive-programming-a0d7b8320a8996eee0ed957b79c3a882f8b47146.tar.xz competitive-programming-a0d7b8320a8996eee0ed957b79c3a882f8b47146.zip | |
Added all current problems
Diffstat (limited to 'MarcCakwalk.cpp')
| -rw-r--r-- | MarcCakwalk.cpp | 18 |
1 files changed, 18 insertions, 0 deletions
diff --git a/MarcCakwalk.cpp b/MarcCakwalk.cpp new file mode 100644 index 0000000..91884fd --- /dev/null +++ b/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; +} |
