//WALKING #include<iostream> #include<algorithm> #include<vector> #include<map> using namespace std; const int N = 100005; int n, res = 0, _z = 0; double l; map<double, int> mp; struct Edeg { int t; double v; double z; }e[N]; struct cmp { bool operator()(Edeg a, Edeg b) { return a.t < b.t; } }; struct BIT { int n; vector<int> b; BIT(int n) : n(n) { b = vector<int> (n + 1, 0); } int query(int i) { int res = 0; for( ; i; i -= (i & -i)) res = max(b[i], res); return res; } void upd(int i, int denta) { int maxd = query(i - 1) + denta; for( ; i <= n; i += (i & -i)) b[i] = max(b[i], maxd); } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); // freopen(".inp", "r", stdin); // freopen(".out", "w", stdout); cin >> l >> n; for(int i = 1; i <= n; ++i) { cin >> e[i].t >> e[i].v; e[i].z = (l/e[i].v)+e[i].t; } sort(e + 1, e + 1 + n, cmp()); vector<double> b; // for(int i = 1; i <= n; ++i) // cout << e[i].z << ' '; // cout << '\n'; for(int i = 1; i <= n; ++i) b.push_back(e[i].z); sort(b.begin(), b.end()); for(double x : b) { // cout << x << '\n'; if(!mp[x]) mp[x] = ++_z; } // cout << _z << ' '; for(int i = 1; i <= n; ++i) e[i].z = mp[e[i].z]; BIT bt(_z); for(int i = n; i >= 1; --i) bt.upd(e[i].z, 1); // cout << e[i].z << ' '; cout << bt.query(_z); }