OJ Board

Code: Select all

#include <iostream>

using namespace std;

const int MAX = 3000;

int main()
{
	int numElements;
	int elements[MAX];
	int diffs[MAX];
	int diff;
	int i;
	bool jolly;

	while(true)
	{
		jolly = true;
		cin>>numElements;
		if(numElements == 1)
		{
			cin>>numElements;
			cout<<"Jolly\n";
		}
		else if(numElements > 1)
		{
			for(i = 0; i < numElements; i++)
				cin>>elements[i];

			for(i = 1; i < numElements; i++)
			{
				diffs[i] = 0;
				if( elements[i-1] > elements[i] )
					diff =  elements[i-1] - elements[i];
				else
					diff =  elements[i] - elements[i-1];
				diffs[diff] = 1;
			}

			for(i = 1; i < numElements; i++)
				if(!diffs[i])
				{
					jolly = false;
					i = numElements;
				}

			if(jolly)
				cout<<"Jolly\n";
			else
				cout<<"Not jolly\n";
		}
	}
	return 0;
}

Code: Select all

if(numElements == 1)
		{
			//This next line is to get the number, which i don care about, just put it in any variable
			cin>>numElements;
			cout<<"Jolly\n";
		}

Code: Select all

while (cin >> numElements)

Code: Select all

#include <stdio.h>
#include <stdlib.h>
int main()
{
    int c[3000],a[3000],b,n,j,i,d,f[10000];
    i=1;
    while(scanf("%d",&n)!=EOF)
    {
           for(j=1;j<=n;j++)
           {scanf("%d",&a[j]);c[j]=0;}
           for(j=1;j<=n-1;j++)
           {
                 if(a[j]>a[j+1])
                 { 
                       b=a[j]-a[j+1];
                 }
                 else
                 {
                       b=a[j+1]-a[j];
                 }
                 c[b]=1;
           }
           d=0;
           for(j=1;j<=n-1;j++)
           {
                 if(c[j]==1)
                 {
                            d++;
                 }
           }
           if(d==(n-1))
           {
                     f[i]=1;
           }
           else
           {
                     f[i]=0;
           }
           i++;
    }
    i--;
    for(j=1;j<=i;j++)
    {
            if(f[j]==1)
            {printf("Jolly\n");}
            else
            {printf("Not jolly\n");}
    }
    return 0;
}

Code: Select all

import java.io.*;
import java.util.*;

class Main {
	public static void main(String args[]){
		
	StringTokenizer st;
	String zeile;
  
  		zeile = readLn(25500);
  		while(!zeile.equals(" ")){
		st=new StringTokenizer(zeile);
		int n = Integer.parseInt(st.nextToken());
		int[] a = new int[n];
		for(int i=1;i<=n;i++){
		a[i-1]= Integer.parseInt(st.nextToken());
		}
		boolean g = jolly(a);
		if(g) {System.out.println("Jolly");}
		else {System.out.println("Not jolly");}
		zeile=readLn(25500);
	}//while
	
	
	}
	
	static String readLn(int maxLg)
	{
	byte lin[] = new byte [maxLg];
	int lg=0,car=-1;
	
	try{
		while (lg<maxLg)
	{
		car=System.in.read();
		if((car<0)||(car=='\n')) break;
		lin[lg++]+=car;
	}
	}	
	catch(IOException e)
	{return(null);
	}
	
	if((car<0)&&(lg==0)) return(null);
	return (new String (lin,0,lg));
	
}	
	
	static boolean jolly(int[] a){
		boolean jolly=true;
		int z = a[0]-1;
		int[] c = new int[a.length-1];
		
		for(int i=1;i<a.length;i++) {
		c[i-1] = a[i];
		
		}
		
		boolean[] b = new boolean[c.length-1];
		for(int i=1;i<c.length;i++){
			if(java.lang.Math.abs(c[i]-c[i-1])>z||java.lang.Math.abs(c[i]-c[i-1])==0) {jolly=false;}
			else {b[java.lang.Math.abs(c[i]-c[i-1])-1]=true;}
	
		}
		
		
		for(int j=0;j<b.length;j++) {
			if(b[j]==false){jolly=false;}
			}
						
		
		return jolly;
		
	}
}

Code: Select all

while(scanf("%d",&n)!=-1)

Code: Select all

#include <stdio.h>
#include <stdlib.h>
#define SIZE 3001


int jolly( int *array, int last )
{
	int w, abs_diff;

	if( last )
		for( w = 0; w < last; w++ )
			{	
				abs_diff = abs(array[w] - array[w+1]);
				if( abs_diff < 1 || abs_diff > last ) 
					return 0;	
			}
	return 1;
}

int main()
{
	int input[SIZE], n, w;

	while( scanf( "%d", &n ) == 1 )
		{
			for( w = 0; w < n; w++ )
				scanf( "%d", &input[w] );
			if( jolly( input, n-1 ) )
				printf( "Jolly\n" );
			else
				printf( "Not jolly\n" );
		}

	return 0;
}