View Code of Problem 6

#include<stdio.h>
#include <string.h>
#include <math.h>
void main()
{
   int n,i,j,k,p,q,max=0,a[1000],b[1000];
   scanf("%d",&n);
   while(n--)
   {
	   max=0;
	   scanf("%d",&p);
	   for(i=0;i<p;i++)
	   {
		   scanf("%d%d",&a[i],&b[i]);
	   }
	   k=a[0]-b[0];
	   for(i=0;i<p;i++)
	   {
		   if(a[i]-b[i]!=k)
		   {
			   printf("NO\n");
			   max=1;
			   break;
		   }
		   if(i!=p-1)
		   {
			   if(b[i]!=a[i+1])
			   {
               printf("NO\n");
			   max=1;
			   break;
			   }
		   }

	   }
	   if(max==0)
			   printf("YES\n");

	  

   }
    
}

Double click to view unformatted code.


Back to problem 6