#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, ans = -1;
vector<int> a, b;
void f(int x, int lst) {
if (x == n) return ans++, void();
f(x + 1, -1);
for (int i = max(lst + 1, a[x]); i <= b[x]; i++)
f(x + 1, i);
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> n;
a.assign(n, 0);
b.assign(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
f(0, -1);
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |