WA in SCPC11B

[alex0113_sof]

#include<iostream>
using namespace std;
int main()
{
	int n,i,a[1423],ok,aux,l;
	while(cin>>n&&n)
	{	
		for(i=1;i<=n;i++)
			cin>>a[i];
		if(n>=7)
		{
			a[++n]=1422;
			l=n;
			do
			{
				ok=1;
				for(i=0;i<l-1;i++)
					if(a[i]>a[i+1])
					{
						ok=0;
						aux=a[i];
						a[i]=a[i+1];
						a[i+1]=aux;
					}
				l--;	
			}while(!ok);
			ok=1;
			for(i=0;i<n;i++)
				if((a[i+1]-a[i])>200)
				{
					ok=0;
					cout<<"IMPOSSIBLE\n";
					break;
				}
			if(ok)
				cout<<"POSSIBLE\n";
		}
		else
			cout<<"IMPOSSIBLE\n";
	}
	return 0;
}

[leppyr64]

Code tags

[alex0113_sof]

Code tags

done

[leppyr64]

You have made a very bad assumption.

[alex0113_sof]

#include<iostream>
using namespace std;
int main()
{
	int n,i,a[1423],ok,aux,l;
	while(cin>>n&&n)
	{	
		for(i=1;i<=n;i++)
			cin>>a[i];
		l=n;
		do
		{
			ok=1;
			for(i=0;i<l-1;i++)
				if(a[i]>a[i+1])
				{
					ok=0;
					aux=a[i];
					a[i]=a[i+1];
					a[i+1]=aux;
				}
			l--;	
		}while(!ok);
		ok=1;
		if(1422-a[n]>100)
			cout<<"IMPOSSIBLE\n";
		else
		{
			for(i=0;i<n;i++)
				if((a[i+1]-a[i])>200)
				{
					ok=0;
					cout<<"IMPOSSIBLE\n";
					break;
				}
			if(ok)
				cout<<"POSSIBLE\n";
		}
	}
	return 0;
}

ty yeah i assumed there was a gas station in Delta Juntion but still wa

[leppyr64]

What's the value at a[0]?

#include <algorithm>
sort(a,a+n);

[alex0113_sof]

#include<iostream>
using namespace std;
int main()
{
	int n,i,a[1423],ok,aux,l;
	while(cin>>n&&n)
	{	
		for(i=1;i<=n;i++)
			cin>>a[i];
		a[0]=0;
		l=n;
		do
		{
			ok=1;
			for(i=0;i<l-1;i++)
				if(a[i]>a[i+1])
				{
					ok=0;
					aux=a[i];
					a[i]=a[i+1];
					a[i+1]=aux;
				}
			l--;	
		}while(!ok);
		ok=1;
		if(1422-a[n]>100)
			cout<<"IMPOSSIBLE\n";
		else
		{
			for(i=0;i<n;i++)
				if((a[i+1]-a[i])>200)
				{
					ok=0;
					cout<<"IMPOSSIBLE\n";
					break;
				}
			if(ok)
				cout<<"POSSIBLE\n";
		}
	}
	return 0;
}

still wa

[leppyr64]

Your sort doesn't work.

[alex0113_sof]

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int n,i,a[1423],ok,aux,l;
	while(cin>>n&&n)
	{	
		for(i=1;i<=n;i++)
			cin>>a[i];
		sort(a,a+n);
		ok=1;
		if(1422-a[n]>100)
			cout<<"IMPOSSIBLE\n";
		else
		{
			for(i=0;i<n;i++)
				if((a[i+1]-a[i])>200)
				{
					ok=0;
					cout<<"IMPOSSIBLE\n";
					break;
				}
			if(ok)
				cout<<"POSSIBLE\n";
		}
	}
	return 0;
}

fml still wa
srry for wasting so much of ur time

[leppyr64]

N = 6
A = {0,4,3,2,5,6,1}

sort(A,A+N);

What's the result?

[alex0113_sof]

ty man got ac