JollyJumpers/강소현 - Revision history

imported>talin0528 at 08:19, 25 June 2011

2011-06-25T08:19:32Z

← Older revision		Revision as of 08:19, 25 June 2011
Line 19:		Line 19:
	== Source Code ==		== Source Code ==
	import java.util.Scanner;		import java.util.Scanner;
	public class ~~JollyJumpers~~{		public class Main{
	public static void main(String [] args)		public static void main(String [] args)
	{		{

imported>talin0528 at 07:26, 4 June 2011

2011-06-04T07:26:13Z

← Older revision		Revision as of 07:26, 4 June 2011
Line 1:		Line 1:
			== Status ==
	{\| class="wikitable"		{\| class="wikitable"
	\|-		\|-
Line 16:		Line 17:
	\| Accepted		\| Accepted
	\|}		\|}
			== Source Code ==
	import java.util.Scanner;		import java.util.Scanner;
	public class JollyJumpers{		public class JollyJumpers{

imported>talin0528 at 07:25, 4 June 2011

2011-06-04T07:25:11Z

← Older revision		Revision as of 07:25, 4 June 2011
Line 1:		Line 1:
			{\| class="wikitable"
			\|-
			\| Problem
			\| 2575
			\| User
			\| talin0528
			\|-
			\| Memory
			\| 5224K
			\| Time
			\| 360MS
			\|-
			\| Language
			\| Java
			\| Result
			\| Accepted
			\|}

	import java.util.Scanner;		import java.util.Scanner;
	public class JollyJumpers{		public class JollyJumpers{

imported>talin0528 at 07:22, 4 June 2011

2011-06-04T07:22:30Z

← Older revision		Revision as of 07:22, 4 June 2011
Line 34:		Line 34:
	}		}
	}		}
			----
			[[ACM_ICPC/2011년스터디]]

imported>talin0528 at 07:20, 4 June 2011

2011-06-04T07:20:06Z

New page

import java.util.Scanner;
public class JollyJumpers{
public static void main(String [] args)
{
Scanner scan = new Scanner(System.in);
int[] arr = new int[3000];
while(scan.hasNextInt()){
int size = scan.nextInt();
int i;
for(i=0; i<size; i++){
arr[i] = scan.nextInt();
}
if(isJolly(arr, size)){ //졸리점퍼 체크
System.out.println("Jolly");
}else{
System.out.println("Not jolly");
}
}
}

public static boolean isJolly(int [] arr, int size){
int [] jollyNum = new int [size];
for(int i=0; i<size-1; i++){
if(Math.abs(arr[i+1]-arr[i]) >= size)//size 넘어가면 1~n-1을 넘어가니까.
return false;
else
jollyNum[Math.abs(arr[i+1]-arr[i])]++;
}
for(int i=1; i<=size-1;i++){
if(jollyNum[i] == 0)//1~n-1 중 하나라도 포함 안하면 not jolly
return false;
}
return true;
}
}