JollyJumpers/권순의 - Revision history

Maintenance script: Repair batch-0002 pages from live compare

2026-03-27T00:16:06Z

Repair batch-0002 pages from live compare

← Older revision		Revision as of 00:16, 27 March 2026
Line 1:		Line 1:
	== Status ==		== Status ==
	{\| class="wikitable"		{\| class="wikitable" style="width:100%;"
	\|-		\|-
	\| Memory		\| Memory
Line 14:		Line 14:
	public class JollyJumper {		public class JollyJumper {

	public static void main(String[] args) {		public static void main(String[] args) {
	int[] getNum = new int[3000];		int[] getNum = new int[3000];
	Scanner sc = new Scanner(System.in);		Scanner sc = new Scanner(System.in);

Line 22:		Line 22:

	for (int i = 0; i < num; i++) {		for (int i = 0; i < num; i++) {
	getNum[i] = sc.nextInt();		getNum[i] = sc.nextInt();
	}		}

Line 32:		Line 32:
	}		}

	public static boolean isJolly(int[] array, int num){		public static boolean isJolly(int[] array, int num){
	int[] sub = new int[num - 1];		int[] sub = new int[num - 1];

	for (int i = 0; i < num - 1; i++) {		for (int i = 0; i < num - 1; i++) {
	if (Math.abs(array[i + 1] - array[i]) > num - 1)		if (Math.abs(array[i + 1] - array[i]) > num - 1)
	return false;		return false;
	else		else
	sub[i] = Math.abs(array[i + 1] - array[i]);		sub[i] = Math.abs(array[i + 1] - array[i]);
	}		}

Line 47:		Line 47:
	while (count < num) {		while (count < num) {
	for (int i = 0; i < num - 2; i++) {		for (int i = 0; i < num - 2; i++) {
	if (sub[i + 1] < sub[i]) {		if (sub[i + 1] < sub[i]) {
	temp = sub[i];		temp = sub[i];
	sub[i] = sub[i + 1];		sub[i] = sub[i + 1];
	sub[i + 1] = temp;		sub[i + 1] = temp;
	}		}
	}		}
Line 57:		Line 57:

	for (int i = 0; i < num - 1; i++) {		for (int i = 0; i < num - 1; i++) {
	if (sub[i] != (i + 1)) {		if (sub[i] != (i + 1)) {
	return false;		return false;
	}		}
Line 65:		Line 65:
	}		}
	}		}

imported>novaman at 16:55, 4 June 2011

2011-06-04T16:55:57Z

← Older revision		Revision as of 16:55, 4 June 2011
Line 10:		Line 10:
	== Source Code ==		== Source Code ==

	~~import java.util.*;~~

	~~public class JollyJumper {~~

	~~public static void main(String[] args) {~~
	~~int[] getNum = new int[3000];~~
	~~Scanner sc = new Scanner(System.in);~~

	~~while (sc.hasNextInt()) {~~
	~~int num = sc.nextInt();~~

	~~for (int i = 0; i < num; i++) {~~
	~~getNum[i] = sc.nextInt();~~
	}

	~~if (isJolly(getNum, num))~~
	~~System.out.println("Jolly");~~
	~~else~~
	~~System.out.println("Not jolly");~~
	}
	}

	~~public static boolean isJolly(int[] array, int num){~~
	~~int[] sub = new int[num - 1];~~

	~~for (int i = 0; i < num - 1; i++) {~~
	~~if (Math.abs(array[i + 1] - array[i]) > num - 1)~~
	~~return false;~~
	~~else~~
	~~sub[i] = Math.abs(array[i + 1] - array[i]);~~
	}

	~~int count = 0;~~
	~~int temp = 0;~~

	~~while (count < num) {~~
	~~for (int i = 0; i < num - 2; i++) {~~
	~~if (sub[i + 1] < sub[i]) {~~
	~~temp = sub[i];~~
	~~sub[i] = sub[i + 1];~~
	~~sub[i + 1] = temp;~~
	}
	}
	~~count++;~~
	}

	~~for (int i = 0; i < num - 1; i++) {~~
	~~if (sub[i] != (i + 1)) {~~
	~~return false;~~
	}
	}

	~~return true;~~
	}
	}
	~~== Source Code ==~~
	import java.util.*;		import java.util.*;

imported>novaman at 16:54, 4 June 2011

2011-06-04T16:54:03Z

@@ Line 8: / Line 8: @@
 |}
 == Source Code ==
   import java.util.*;

imported>novaman at 16:53, 4 June 2011

2011-06-04T16:53:25Z

← Older revision		Revision as of 16:53, 4 June 2011
Line 1:		Line 1:
			== Status ==
			{\| class="wikitable"
			\|-
			\| Memory
			\| 5272K
			\| Time
			\| 579MS
			\|}

	== Source Code ==		== Source Code ==
	import java.util.*;		import java.util.*;

imported>novaman at 16:51, 4 June 2011

2011-06-04T16:51:17Z

New page

== Source Code ==
import java.util.*;

public class JollyJumper {

public static void main(String[] args) {
int[] getNum = new int[3000];
Scanner sc = new Scanner(System.in);

while (sc.hasNextInt()) {
int num = sc.nextInt();

for (int i = 0; i < num; i++) {
getNum[i] = sc.nextInt();
}

if (isJolly(getNum, num))
System.out.println("Jolly");
else
System.out.println("Not jolly");
}
}

public static boolean isJolly(int[] array, int num){
int[] sub = new int[num - 1];

for (int i = 0; i < num - 1; i++) {
if (Math.abs(array[i + 1] - array[i]) > num - 1)
return false;
else
sub[i] = Math.abs(array[i + 1] - array[i]);
}

int count = 0;
int temp = 0;

while (count < num) {
for (int i = 0; i < num - 2; i++) {
if (sub[i + 1] < sub[i]) {
temp = sub[i];
sub[i] = sub[i + 1];
sub[i + 1] = temp;
}
}
count++;
}

for (int i = 0; i < num - 1; i++) {
if (sub[i] != (i + 1)) {
return false;
}
}

return true;
}
}