## Problem: Reverse Coding

*Difficulty: Easy
Sherlock Being tired with the usual coding rounds started growing his interest towards reverse coding when he won the event in his college symposium. He wondered if his friend has the brain to quickly identify the pattern and verify if his inputs are correct or not. From the example portion given below, where you will be given a number(n) and its output, Using this find the pattern. Your task is that from the pattern you identified above, You have to tell if for the given n whether the given m is the correct answer or not…

Input:
The first line consists of T, the number of test cases. then T lines follow. Each line consists of n and m.

Output:
For each n and m output 1 if m is the corresponsing input for the value of n and 0 otherwise.

Constraints:
1<=t<=50
0<=n<=1000
0<=m<=10^6

Example to identify the pattern :

Input                            Output

10                                 55

20                                 210

5                                   15

0                                    0

1                                    1

2                                    3

Example:
Input:
4
10 55
4 11
2  3
6 21

Output:
1
0
1
1

Hint:
Pattern here is : Sum of first n natural numbers
Sn = n*(n+1)/2

Implementation: Python 2.7

```#code
def isCorrect(n, m):
correctValue = (n*(n+1))//2
return m == correctValue

def main():
t = input()
for _ in range(t):
n, m = map(int, raw_input().strip().split())
print 1 if isCorrect(n, m) else 0

if __name__ == '__main__':
main()
```