Root of the Problem


Problem Statement :


Chef has a binary tree. The binary tree consists of 1 or more nodes. Each node has a unique integer id. Each node has up to 2 children, which are identified by their ids, and each node is the child of at most 1 other node. A node X is considered to be an ancestor of node Y if node Y is a child of node X or if there is some node Z for which X is an ancestor of Z and Y is a child of Z. No node is an ancestor of itself. A special node called the root node is an ancestor of all other nodes.

Chef has forgotten which node of his tree is the root, and wants you to help him to figure it out. Unfortunately, Chef's knowledge of the tree is incomplete. He does not remember the ids of the children of each node, but only remembers the sum of the ids of the children of each node.

Input

Input begins with an integer T, the number of test cases. Each test case begins with an integer N, the number of nodes in the tree. N lines follow with 2 integers each: the id of a node, and the sum of the ids of its children. The second number will be 0 if the node has no children.

Output

For each test case, output on a line a space separated list of all possible values for the id of the root node in increasing order. It is guaranteed that at least one such id exists for each test case.

Constraints

1 ≤ T ≤ 50
1 ≤ N ≤ 30
All node ids are between 1 and 1000, inclusive


Sample Input

2
1
4 0
6
1 5
2 0
3 0
4 0
5 5
6 5


Sample Output


4
6


Solution :



title-img 


                            Solution in C :

#include <stdio.h>

int main(void) {
	int t, n, id_sum, sid_sum, x, y;
	scanf("%d", &t);
	while(t--) {
	    scanf("%d", &n);
	    id_sum = 0, sid_sum = 0;
	    while(n--) {
    	    scanf("%d %d", &x, &y);
    	    id_sum += x;
    	    sid_sum += y;
	    }
	    printf("%d\n", id_sum - sid_sum);
	}
	return 0;
}
                        


                        Solution in C++ :

#include <iostream>
#include<bits/stdc++.h>
using namespace std;

#define ll long long int


int main() {
	ll t;
	cin>>t;
	for(ll z=1;z<=t;z++){
		ll n;
		cin>>n;
		int ans=0;
		for(int j=1;j<=n;j++){
			
			int x,y;
			cin>>x>>y;
			ans+=(x-y);
		}
		cout<<ans<<'\n';
	}
	return 0;
}
                    


                        Solution in Java :

/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while(t-- > 0)
		{
		    int n = sc.nextInt();
		    int node = 0;
		    int idsum= 0;
		    for(int i=0;i<n;i++)
		    {
		        node = node + sc.nextInt();
		        idsum = idsum + sc.nextInt();
		    }
		    int r = node - idsum;
		    System.out.println(r);
		}
	}
}
                    


                        Solution in Python : 
                            
# cook your dish here
t=int(input())
for _ in range(t):
    n = int(input())
    root = 0
    for j in range(n):
        ide,c = map(int,input().split(' '))
        root +=ide - c
        
    print(root)


View More Similar Problems

Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →

Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →