Submission #19514485

---

Source Code Expand

from collections import defaultdict
import math
mod=10**9+7
n=int(input())
P=defaultdict(int)
M=defaultdict(int)
c=0
for _ in range(n):
    a,b=map(int,input().split())
    if a==0 and b==0:
        c+=1
        continue
    elif a==0:
        P[(0,1)]+=1
        continue
    elif b==0:
        M[(0,1)]+=1
        continue
    g=math.gcd(a,b)
    a,b=a//g,b//g
    if a*b<0:
        M[(abs(b),abs(a))]+=1
    else:
        P[(a,b)]+=1
D_pow=dict()
def my_pow(k):
    if k in D_pow:
        return D_pow[k]
    else:
        D_pow[k]=pow(2,k,mod)
        return D_pow[k]
ans=my_pow(c)
for k in P.keys():
    if k in M:
        tmp=my_pow(P[k])+my_pow(M[k])-1
        tmp%=mod
        ans*=tmp
        ans%=mod
        M[k]=0
    else:
        ans*=my_pow(P[k])
        ans%=mod
for v in M.values():
    ans*=my_pow(v)
    ans%=mod
ans=(ans-1)%mod
print(ans)

Submission Info

Judge Result