diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-30 00:18:17 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-30 00:18:17 +0200 |
| commit | 3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch) | |
| tree | 474b08b187895af91c10838aae21142b2ba2514d /codechef/maximumLengthEvenSubarray.cpp | |
| parent | f5ff62a26052f084b6b807cba220c86785fd45e3 (diff) | |
| download | competitive-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 'codechef/maximumLengthEvenSubarray.cpp')
| -rw-r--r-- | codechef/maximumLengthEvenSubarray.cpp | 27 |
1 files changed, 0 insertions, 27 deletions
diff --git a/codechef/maximumLengthEvenSubarray.cpp b/codechef/maximumLengthEvenSubarray.cpp deleted file mode 100644 index 2cbd52b..0000000 --- a/codechef/maximumLengthEvenSubarray.cpp +++ /dev/null @@ -1,27 +0,0 @@ -#include<bits/stdc++.h> - -using namespace std; - -int sum(int x) { - int res = 0; - for(int i = 1; i <= x; i++) { - res+=i; - } - return res; -} - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--){ - int n; - cin >> n; - if(sum(n) % 2 == 0) { - cout << n << '\n'; - } else { - cout << n - 1 << '\n'; - } - } -} |
