diff --git a/2000/saldo.cpp b/2000/saldo.cpp
new file mode 100644
index 0000000..d06131e
--- /dev/null
+++ b/2000/saldo.cpp
@@ -0,0 +1,118 @@
+/* Problem URL: https://neps.academy/br/exercise/650 */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t = 0;
+    int n;
+    while (cin >> n, n) {
+        if (t) {
+            cout << '\n';
+        }
+        t++;
+        vl sum(n + 1);
+        sum[0] = 0;
+
+        for (size_t i = 1; i <= n; i++) {
+            ll a, b;
+            cin >> a >> b;
+            sum[i] = a - b + sum[i - 1];
+        }
+
+        ll ans = 0;
+        ll left = 0;
+        ll right = 0;
+        ll minor = 0;
+        ll mleft = 1;
+        for (size_t i = 1; i <= n; i++) {
+            if (sum[i - 1] < minor) {
+                minor = sum[i - 1];
+                mleft = i;
+            }
+
+            if (sum[i] - minor > ans || (sum[i] - minor == ans && (ll)i - mleft >= right - left)) {
+                ans = sum[i] - minor;
+                left = mleft;
+                right = i;
+            }
+        }
+
+        cout << "Teste " << t << '\n';
+        if (ans == 0) {
+            cout << "nenhum\n";
+        } else {
+            cout << left << ' ' << right << '\n';
+        }
+    }
+}