OJ Board

Code: Select all

#include<stdio.h>
#include<math.h>
#include<stdlib.h>
int  sort(int a[],int n)
{
	int i,j;
	for(i=0;i<n-1;i++)
	{
		for(j=0;j<n-i-1;j++)
			if(a[j]>a[j+1])
			{
			int 	tmp=a[j];a[j]=a[j+1];a[j+1]=tmp;
			}
	}
	return 0;
}
int main()
{
	int n,i;
	scanf("%d",&n);
		while(n)
		{
			int a[2000],s=0;
			//a[0]=1422;
			for(i=0;i<n;i++)
				scanf("%d",&a[i]);
			sort(a,n);
				a[n]=1422;
			//for(i=0;i<n;i++)
		//	printf(" %d ",a[i]);
			for(i=1;i<n-1;i++)
			{
				if(abs(a[i+1]-a[i])>200)
				{s=1;break;}
			}
			if((a[0]-0)>100||(1422-a[n-1])>100)
			s=1;
			if(s)
				printf("IMPOSSIBLE\n");
			else   	printf("POSSIBLE\n");
			scanf("%d",&n);
		}
		return 0;
}

Code: Select all

#include <cstdio>

int main()
{
	long n;
	while(scanf("%ld",&n)==1)
	{
		if(n==0) break;
			long station[10000],I,J,fag=0;

			for(I=0 ; I<n ; I++)
			{
					scanf("%ld",&station[I]);
					if(station[I]>1222)
						fag=1;
			}

			if(fag==1)
			{
					int dis=0;
					for(J=0 ; J<n ; J++)
					{
							dis=station[I+1]-station[I];
							if(dis>200 || dis<-200)
							{
									fag=0;
									break;
							}
					}

					if(fag==0)
						printf("IMPOSSIBLE\n");
					else
						printf("POSSIBLE\n");
			}
			else
				printf("IMPOSSIBLE\n");
				fag=0;
	}
	return 0;
}

Code: Select all

7
600
1400
400
1200
200
1000
0
0

Code: Select all

IMPOSSIBLE

Code: Select all

#include <cstdio>

int main()
{
	long n;
	while(scanf("%ld",&n)==1)
	{
		if(n==0) break;
			long station[100000],I,J,fag=1;

			for(I=0 ; I<n ; I++)
			{
					scanf("%ld",&station[I]);
			}
			int dis=0;
			for(J=0 ; J<n ; J++)
			{
					dis=station[J+1]-station[J];
					if(dis>200 || dis<-200)
					{
							fag=0;
							break;
					}
			}

			if(fag==0)
				printf("IMPOSSIBLE\n");
			else
				printf("POSSIBLE\n");
			fag=1;
	}
	return 0;
}