OJ Board

Code: Select all

#include <stdio.h>

int main() {
  long int n,a[3000],b[3000],c[3000],d[3000],e,i,k,t,x;
  while(scanf("%ld",&n)!=EOF) {
    for(i=0;i<n;i++) {scanf("%ld",&a[i]);}
    for(k=0,t=1;k<(n-1);k++,t++) {
      b[k]=t;d[k]=0;
    }
    for(i=0;i<(n-1);i++) {
      c[i]=a[i+1]-a[i];
      if(c[i]<0) c[i]=-c[i];
      
      for(k=0;k<(n-1);k++) {
        for(e=0;e<(n-1);e++) {
          if(c[k]==b[e]) d[e]++;
        }
      }
    }
    for(k=0;k<(n-1);k++) {
      if(d[k]==0) {
        printf("Not jolly\n");
        x=0;
        goto end;
      } 
      else
        x=1;
    } 
  end: 
    if(x==1&&d[n-1]==0) printf("Jolly\n");
  }
  return 0;
}

Code: Select all

#include<stdio.h>
#include<iostream.h>
//#include<algorithum.h>

int main()
{           long int n,a[4000],s=0,jo=1,p=0;
  while(cin>>n)
  {
			//if(n==0)
			//break;

	for(long int i=0;i<n;i++)
	{
	  cin>>a[i];
	}
	//cout<<a[5];
	for(long int j=1;j<n;j++)
	{     //p=0;
		if(a[j-1]<a[j])
		{   s=0;
			for(int t=a[j-1];t<a[j];t++)
			{s++;}
			if(s<4)
			  jo*=1;
			else
				jo*=0;
			//p=1;
			//jo*=p;

		}

		if(a[j-1]>a[j])
		{   s=0;
			for(int y=a[j];y<a[j-1];y++)
			{s++;}
			if(s<4)
			  jo*=1;
			else
				jo*=0;
			//p=1;

		}
	}
		if(jo==1 && p==1)
		  cout<<"Jolly"<<endl;
		if(jo==0)
		   cout<<"Not jolly"<<endl;
	

   }
  return 0;
}

Code: Select all

4 1 4 2 3
5 1 4 2 -1 6
4 1 4 3 5

Code: Select all

Jolly
Not jolly
Jolly

Code: Select all

*fixed*

Code: Select all

1 1
4 1 4 2 3

Code: Select all

JollyJolly

Code: Select all

#include <iostream>
#include <cmath>
using namespace std;

int main()
{
	int n=0,i=0,j[3000]={0};
	bool isj=true;
	while(1)
	{
		cin >> n;
		if(cin.fail()) break;
		for(i=0;i<n;i++)
		{
			cin >> j[i];
		}
		isj=true;
		for(i=0;i<(n-1);i++)
		{
			if((abs((j[i+1]-j[i]))<1)||(abs((j[i+1]-j[i]))>(n-1)))
			{
				isj=false;
				cout << "Not jolly" << endl;
				break;
			}
		}
		if(isj==true)
			cout << "Jolly" << endl;		

	}
	return 0;
}