aboutsummaryrefslogtreecommitdiff
path: root/iceCreamParlor.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 /iceCreamParlor.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 'iceCreamParlor.cpp')
-rw-r--r--iceCreamParlor.cpp38
1 files changed, 0 insertions, 38 deletions
diff --git a/iceCreamParlor.cpp b/iceCreamParlor.cpp
deleted file mode 100644
index eb29391..0000000
--- a/iceCreamParlor.cpp
+++ /dev/null
@@ -1,38 +0,0 @@
-#include<bits/stdc++.h>
-
-using namespace std;
-
-bool cleanVec(vector<int> v){
- sort(v.begin(), v.end());
- for(int i = 0; i < v.size() - 1; i++) {
- if(v[i] == v[i + 1]) {
- return true;
- }
- }
- return false;
-}
-
-int main() {
- int t,m,n;
- cin >> t;
- while(t--) {
- cin >> m;
- cin >> n;
- vector<int> v(n);
- for(int &x : v) {
- cin >> x;
- }
- for(int i = 1; i <= n; i++) {
- auto it = find(v.begin() + i, v.end(), m - v[i - 1]);
- if(it != v.end() && cleanVec(v)) {
- cout << v.end() - it - i - 1 << " " << it - v.begin() + i << '\n';
- break;
- }
- else {
- cout << v.end() - it - i << " " << it - v.begin() + i << '\n';
- break;
- }
- }
- }
- return 0;
-}