From 51c35987f270f7a19d83a11b2427a9ff7803e17c Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Fri, 15 Jul 2022 18:34:14 +0200 Subject: Solved a couple of problems on codeforces --- MarkTheDustSweeper/main | Bin 0 -> 27320 bytes MarkTheDustSweeper/main.cpp | 39 ++++++++++++++++++++++++++++++++++++ MarkTheDustSweeper/main_input0.txt | 9 +++++++++ MarkTheDustSweeper/main_output0.txt | 4 ++++ 4 files changed, 52 insertions(+) create mode 100755 MarkTheDustSweeper/main create mode 100644 MarkTheDustSweeper/main.cpp create mode 100644 MarkTheDustSweeper/main_input0.txt create mode 100644 MarkTheDustSweeper/main_output0.txt (limited to 'MarkTheDustSweeper') diff --git a/MarkTheDustSweeper/main b/MarkTheDustSweeper/main new file mode 100755 index 0000000..0ceccde Binary files /dev/null and b/MarkTheDustSweeper/main differ diff --git a/MarkTheDustSweeper/main.cpp b/MarkTheDustSweeper/main.cpp new file mode 100644 index 0000000..6335886 --- /dev/null +++ b/MarkTheDustSweeper/main.cpp @@ -0,0 +1,39 @@ +#include + +using namespace std; + + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--){ + int n; + cin >> n; + long long ans = 0; + vector v(n); + long long sum = 0; + for (auto &x : v) { + cin >> x; + sum += x; + } + if(sum != v[n - 1]) { + int ind; + for(int i = 0; i < n; i++) { + if(v[i] != 0) { + ind = i; + break; + } + } + for(int i = ind; i < n - 1; i++) { + if(v[i] == 0) { + ans += 1; + } else{ + ans += v[i]; + } + } + } + cout << ans << endl; + } +} diff --git a/MarkTheDustSweeper/main_input0.txt b/MarkTheDustSweeper/main_input0.txt new file mode 100644 index 0000000..ad05cd8 --- /dev/null +++ b/MarkTheDustSweeper/main_input0.txt @@ -0,0 +1,9 @@ +4 +3 +2 0 0 +5 +0 2 0 2 0 +6 +2 0 3 0 4 6 +4 +0 0 0 10 diff --git a/MarkTheDustSweeper/main_output0.txt b/MarkTheDustSweeper/main_output0.txt new file mode 100644 index 0000000..0c8b213 --- /dev/null +++ b/MarkTheDustSweeper/main_output0.txt @@ -0,0 +1,4 @@ +3 +5 +11 +0 -- cgit v1.2.3