// need #include #include // data structure #include //#include #include #include #include #include #include #include #include //#include //#include #include #include //#include //#include // stream //#include //#include //#include // etc #include #include #include //#include #include #include #include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); template void MACRO_VAR_Scan(T& t) { std::cin >> t; } templatevoid MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); } #define VEC_ROW(type, n, ...)std::vector __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); } templatevoid MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); } template void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; } templatevoid MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); } #define OUT(d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i=ll(a);--i) #define REPLL(i, n) for(ll i=0;i=0;--i) #define PAIR std::pair #define PAIRLL std::pair #define IN(a, x, b) (a<=x && x tmp(a);std::cerr << #a << "\t:";for(int i=0; i(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";} template inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } #define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]" #define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;} void CHECKTIME(std::function f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; } #define int ll using ll = long long; using ull = unsigned long long; constexpr int INFINT = 1 << 30; // 1.07x10^ 9 constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9 constexpr ll INFLL = 1LL << 60; // 1.15x10^18 constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^19 constexpr double EPS = 1e-7; constexpr int MOD = 1000000007; constexpr double PI = 3.141592653589793238462643383279; ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } struct Line { int p, a, b; Line() {} Line(int p, int a, int b) : p(p), a(a), b(b) {} bool operator<(const Line& r) const { return b * r.a < r.b * a; } inline double ratio() { return 1.0 * b / (a + b); } }; signed main() { INIT; VAR(int, n); VEC_ROW(int, n, p, a, b); REP(i, n) { int g = gcd(a[i], b[i]); a[i] /= g; b[i] /= g; } std::vector> data(3); REP(i, n) { data[p[i]].emplace_back(Line(p[i], a[i], b[i])); } REP(i, 3) { std::sort(ALL(data[i])); } int ans = 1; // p=0 ans += data[0].size(); // p=1 REP(i, data[1].size()) { Line l(1, data[1][i].b, data[1][i].a); auto it = std::lower_bound(ALL(data[0]), l); ans += std::distance(data[0].begin(), it) + 1; } // p=2 REP(i, data[2].size()) { Line l(2, data[2][i].b, data[2][i].a); double t = l.ratio(); using P = std::pair; std::set

set; REP(j, data[0].size()) { if (t - data[0][j].ratio() < 0) continue; set.insert(P(t - data[0][j].ratio(), 0)); } REP(j, data[1].size()) { if (t - data[1][j].ratio() < 0) continue; set.insert(P(data[1][j].ratio(), 1)); } P p = P(-1, -1); bool addFlag = false; for (const auto& x : set) { if(p.second != -1) { if (std::abs(p.first - x.first) < EPS) { if (addFlag) --ans; } if ((std::abs(p.first - x.first) > EPS && p.second != x.second) || (addFlag && x.second == 1)) { addFlag = true; ++ans; } else { addFlag = false; } } p = x; if (std::abs(x.first) < EPS || std::abs(t - x.first) < EPS) continue; ++ans; } ++ans; } OUT(ans)BR; return 0; }