// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

#include <unordered_map>

#include <vector>
#include<algorithm>
#include <utility>

int twosum (vector <float> & n , int target)
{
    int mod = 1000000007;
    unordered_map <float, float> my_map;
    unordered_map < pair <int,int>, bool > p;
    int res = 0;

    for (int i = 0 ; i < n.size(); i ++)
    {
        float cur = n[i];
        int find_me = target - cur;
        if (my_map.find(find_me) != my_map.end())
        {
           if (p.find(my_map[find_me], i) == p.end())
           {

               res++;
               res%=mod;

           p[{(my_map[find_me],i}] = true;
           p[{i,my_map[find_me]}] = true;

           }

        }
        else
        my_map[cur] = i;
    }

    return res;
}
int solution(vector<int> &X, vector<int> &Y) {
    // write your code in C++14 (g++ 6.2.0)
    int sz = X.size();
    vector < float> nums (sz);

    for (int i = 0 ; i <sz; i ++)
    {
        nums[i]= X[i]/Y[i];
    }
    int target = 1;
    return twosum (nums,target);

}