Language: C++

#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>
#include<assert.h>
#include<unordered_map>
using namespace std;
#define int long long

#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()

template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
//SOLVE

struct mint
{
  int x; // typedef long long int;
  mint(int x = 0) : x((x % MOD + MOD) % MOD) {}
  mint &operator+=(const mint a)
  {
    if ((x += a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator-=(const mint a)
  {
    if ((x += MOD - a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator*=(const mint a)
  {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint operator+(const mint a) const
  {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const
  {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const
  {
    mint res(*this);
    return res *= a;
  }
  mint pow(int t) const
  {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime MOD
  mint inv() const
  {
    return pow(MOD - 2);
  }
  mint &operator/=(const mint a)
  {
    return (*this) *= a.inv();
  }
  mint operator/(const mint a) const
  {
    mint res(*this);
    return res /= a;
  }
};

const int MAX = 510000;

long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit()
{
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++)
  {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}

int COM(int n, int k)
{
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int PERM(int n, int k)
{
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[n - k] % MOD) % MOD;
}

int MCOM(int n, int k)
{
  //n個のものから重複を許してr個選ぶ。
  //Choose R from N types of things, allowing for duplication.
  return COM(n + k - 1, k);
}
//solve


int gcd(int a,int b){
    if(a<b)swap(a,b);
    if(a%b==0)return b;
    return gcd(a%b,b);
}

struct HashPair {

    static size_t m_hash_pair_random;

    template<class T1, class T2>
    size_t operator()(const pair<T1, T2> &p) const {

        auto hash1 = hash<T1>{}(p.first);
        auto hash2 = hash<T2>{}(p.second);

        size_t seed = 0;
        seed ^= hash1 + 0x9e3779b9 + (seed << 6) + (seed >> 2);
        seed ^= hash2 + 0x9e3779b9 + (seed << 6) + (seed >> 2);
        seed ^= m_hash_pair_random + 0x9e3779b9 + (seed << 6) + (seed >> 2);
        return seed;
    }
};

// size_t HashPair::m_hash_pair_random = (size_t) random_device()();



void solve(void)
{
  int N;cin>>N;
  // vector<pair<int,int> > vp;
  std::unordered_map<pair<int,int>,int,HashPair> mp;

  for (int i = 0; i < N; i++)
  {
    int A,B;
    cin>>A>>B;
    int G = gcd(abs(A),abs(B));
    if(A < 0 && B < 0) A *= -1,B *= -1;
    else if(A <0 &&B > 0) A *= -1,B *= -1;
    mp[make_pair(A/G,B/G)]++;
  }

  mint ANS = 1;
  for (auto &&x : mp)
  {
    int C = 1;
    if(x.second == 0)continue; 
    int cp1,cp2;
    cp1 = x.first.second;
    cp2 = x.first.first;
    cp2 *= -1;
    if(cp1 <0 && cp2 <0)cp1*=-1,cp2*= -1;
    int p1 = x.second;
    int p2 =mp[make_pair(cp1,cp2)];
    int c1 = 0,c2 = 0;
    if(p1 > 0)
    {
      mint t = 2;
      c1 = t.pow(p1).x -1;
    }
    if(p2 > 0)
    {
      mint t = 2;
      c2 = t.pow(p2).x -1;
    }
    C += c1 + c2;

    // DEBUG(C,x.first.first,x.first.second,"C", mp[make_pair(cp1,cp2)],cp1,cp2,"\n");
    ANS *= C;
    mp[x.first] = 0;
    mp[make_pair(cp1,cp2)] = 0;
    
  }
  cout<<ANS.x-1<<endl;
  
  
  return;
}

int32_t main(int32_t argc, const char *argv[])
{
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(11);
  solve();

  return 0;
}


Compiler output:
/usr/bin/ld: /tmp/ccDzcfA1.o: warning: relocation against `_ZN8HashPair18m_hash_pair_randomE' in read-only section `.text._ZNK8HashPairclIxxEEmRKSt4pairIT_T0_E[_ZNK8HashPairclIxxEEmRKSt4pairIT_T0_E]'
/usr/bin/ld: /tmp/ccDzcfA1.o: in function `unsigned long HashPair::operator()<long long, long long>(std::pair<long long, long long> const&) const':
a.cc:(.text._ZNK8HashPairclIxxEEmRKSt4pairIT_T0_E[_ZNK8HashPairclIxxEEmRKSt4pairIT_T0_E]+0xad): undefined reference to `HashPair::m_hash_pair_random'
/usr/bin/ld: warning: creating DT_TEXTREL in a PIE
collect2: error: ld returned 1 exit status