View Code of Problem 6

#include<stdio.h>
#include<stdlib.h>

int main()
{
	int t,n;
	int left[110];
	int right[110];

	int len;
	int flag=1;
	int max=0;
	scanf("%d",&t);
	if(t>100)
		return -1;
	while(t>0)
	{
		scanf("%d",&n);
		for(int i=0;i<n;i++)
		{
			scanf("%d %d",&left[i],&right[i]);
			
			max=right[0]-left[0];
			if(max!=right[i]-left[i])
				flag=0;
		}
		if(flag)
			printf("YES\n");
		else
			printf("NO\n");
		t--;
	}
	return 0;
}