Linear Algebra Test(STL map函数)

https://cn.vjudge.net/contest/250938#problem/H

Dr. Wail is preparing for today's test in linear algebra course. The test's subject is Matrices Multiplication.

Dr. Wail has n matrices, such that the size of the ith matrix is (ai × bi), where aiis the number of rows in the ith matrix, and bi is the number of columns in the ithmatrix.

Dr. Wail wants to count how many pairs of indices i and j exist, such that he can multiply the ith matrix with the jth matrix.

Dr. Wail can multiply the ith matrix with the jth matrix, if the number of columns in the ith matrix is equal to the number of rows in the jth matrix.

Input

The first line contains an integer T (1 ≤ T ≤ 100), where T is the number of test cases.

The first line of each test case contains an integer n (1 ≤ n ≤ 105), where n is the number of matrices Dr. Wail has.

Then n lines follow, each line contains two integers ai and bi (1 ≤ ai, bi ≤ 109) (ai ≠ bi), where ai is the number of rows in the ith matrix, and bi is the number of columns in the ith matrix.

Output

For each test case, print a single line containing how many pairs of indices i and jexist, such that Dr. Wail can multiply the ith matrix with the jth matrix.

Example

Input

1
5
2 3
2 3
4 2
3 5
9 4

Output

5

Note

As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.

In the first test case, Dr. Wail can multiply the 1st matrix (2 × 3) with the 4thmatrix (3 × 5), the 2nd matrix (2 × 3) with the 4th matrix (3 × 5), the 3rd matrix (4 × 2) with the 1st and second matrices (2 × 3), and the 5th matrix (9 × 4) with the 3rd matrix (4 × 2). So, the answer is 5.

题意： 给出n个矩阵的行数与列数，问有多少对矩阵可以相乘。

矩阵可以相乘的条件是，前一个矩阵的列数=后一个的行数。

用map函数映射。

#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int a[100010][2];
int main()
{
    map <int, int> m;
    int t, i, n, j;
    long long ans;
    scanf("%d", &t);
    while(t--)
    {
         m.clear();
        scanf("%d", &n);
        for(i=0; i<n; i++)
        {
            for(j=0; j<2; j++)
            {
                scanf("%d", &a[i][j]);
            }
        }
        for(i=0; i<n; i++)
        {
            m[a[i][0]]++;
        }
        ans = 0;
        for(i=0; i<n; i++)
        {
            ans = ans + m[a[i][1]];
        }
        printf("%lld\n", ans);
    }
    return 0;
}