View Code of Problem 6

#include<stdio.h>
 
int jumpsuccess(float a[],float b[],int,int);
int main(){
	int T;
	int n;
	float l[10]={0,}, r[10]={0,};
	float maxp;
	int i=0;

    scanf("%d",&T);

	for(int k=T;k>0;k--){	
	scanf("%d",&n);
	for(int m=n;m>0;m--){	
	 scanf("%f%f",&l[i],&r[i]); 
	 i++;
      }
     maxp=r[i-1];
     if(jumpsuccess(l,r,maxp,n)==1)
     printf("YES");
     else{
     	printf("NO");
	 }

	}	
	return 0;
}

int jumpsuccess(float a[],float b[],int maxp,int n){
	for(int i=0;i<n;i++){
		
		if(a[i]<i*maxp/n|b[i]>=(i+1)*maxp/(n-1)){
			return 0;
		}
	}
	return 1;
}

Double click to view unformatted code.


Back to problem 6