#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N; int L[10],R[10]; void solve() { int i,j,k,l,r,x,y; string s; cin>>N; vector V; FOR(i,N) { V.push_back(i); cin>>L[i]>>R[i]; } int ret=0; do { int ok=1; int pre=0; FORR(i,V) { if(pre>R[i]) { ok=0; } else { pre=max(pre,L[i]); } } ret+=ok; } while(next_permutation(ALL(V))); cout<