#include <bits/stdc++.h> #define LYY_doesnt_have_m_yucca_HAHAHA long long using namespace std; pair<LYY_doesnt_have_m_yucca_HAHAHA,LYY_doesnt_have_m_yucca_HAHAHA> a[105]; bool cmp(pair<LYY_doesnt_have_m_yucca_HAHAHA,LYY_doesnt_have_m_yucca_HAHAHA> x,pair<LYY_doesnt_have_m_yucca_HAHAHA,LYY_doesnt_have_m_yucca_HAHAHA> y) { return x.second < y.second; } signed main() { LYY_doesnt_have_m_yucca_HAHAHA n; int T; cin >> T; while (T--) { cin >> n; for (LYY_doesnt_have_m_yucca_HAHAHA i = 1; i <= n; i++) cin >> a[i].first >> a[i].second; sort(a + 1,a + n + 1,cmp); LYY_doesnt_have_m_yucca_HAHAHA nowen = a[1].second,cnt = 1; for (LYY_doesnt_have_m_yucca_HAHAHA i = 2; i <= n; i++) { if (a[i].first > nowen) cnt++,nowen = a[i].second; } printf("%lld\n",cnt); } return 0; }