aboutsummaryrefslogtreecommitdiff
path: root/TokitsukazeAndAllZeroSequence.cpp
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 /TokitsukazeAndAllZeroSequence.cpp
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 'TokitsukazeAndAllZeroSequence.cpp')
-rw-r--r--TokitsukazeAndAllZeroSequence.cpp38
1 files changed, 0 insertions, 38 deletions
diff --git a/TokitsukazeAndAllZeroSequence.cpp b/TokitsukazeAndAllZeroSequence.cpp
deleted file mode 100644
index f83e44d..0000000
--- a/TokitsukazeAndAllZeroSequence.cpp
+++ /dev/null
@@ -1,38 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-int main() {
- int tt;
- cin >> tt;
- while(tt--) {
- int ansZ = 0;
- bool duple = false;
- bool zero = false;
- int n; cin >> n;
- vector<int> v(n);
- map<int, int> mp;
- for(auto &x : v) {
- cin >> x;
- if(x == 0) {
- zero = true;
- }
- mp[x]++;
- }
- for(auto &p : mp) {
- if(p.first == 0) {
- ansZ+=p.second;
- }
- if(p.second > 1 && p.first != 0) {
- duple = true;
- }
- }
- if(zero) {
- cout << n - ansZ << endl;
- }
- else if(duple){
- cout << n << endl;
- }
- else {
- cout << n + 1 << endl;
- }
- }
-}