새싹교실/2022/Java보시던지/05.05 - Revision history

Maintenance script: Refined conservative live-site repair pass after MoniWiki migration

2026-03-29T00:48:08Z

Refined conservative live-site repair pass after MoniWiki migration

← Older revision		Revision as of 00:48, 29 March 2026
Line 17:		Line 17:

	== 과제 ==		== 과제 ==
	* ~~[~~임지민~~]~~		* [[임지민]]
	** 백준 4673 셀프넘버		** 백준 4673 셀프넘버

Line 57:		Line 57:
	}		}

	* ~~[~~박창훈~~]~~		* 박창훈
	** 4673 : 셀프 넘버		** 4673 : 셀프 넘버
	public class Main {		public class Main {

Maintenance script: Conservative live-site repair pass after MoniWiki migration

2026-03-29T00:45:45Z

Conservative live-site repair pass after MoniWiki migration

← Older revision		Revision as of 00:45, 29 March 2026
Line 17:		Line 17:

	== 과제 ==		== 과제 ==
	* [[임지민]]		* [임지민]
	** 백준 4673 셀프넘버		** 백준 4673 셀프넘버

Line 57:		Line 57:
	}		}

	* 박창훈		* [박창훈]
	** 4673 : 셀프 넘버		** 4673 : 셀프 넘버
	public class Main {		public class Main {

Maintenance script: Repair batch-0006 pages from live compare

2026-03-27T01:08:35Z

Repair batch-0006 pages from live compare

← Older revision		Revision as of 01:08, 27 March 2026
Line 24:		Line 24:
	public static void main(String[] args) {		public static void main(String[] args) {
	final int DEFAULT_MAX = 10000;		final int DEFAULT_MAX = 10000;
	boolean[] selfNumberArr = new ~~boolean[DEFAULT_MAX~~+1]; //인덱스가 selfNumber이면 true를 담는 boolean array 생성		boolean[] selfNumberArr = new booleanDEFAULT_MAX+1; //인덱스가 selfNumber이면 true를 담는 boolean array 생성

	//Arr의 값을 전부 true로 초기화		//Arr의 값을 전부 true로 초기화
	for(int i = 1; i < selfNumberArr.length; i++) {		for(int i = 1; i < selfNumberArr.length; i++) {
	selfNumberArr[i] = true;		selfNumberArr[i] = true;
	}		}

Line 34:		Line 34:
	for(int i = 1; i < selfNumberArr.length; i++) {		for(int i = 1; i < selfNumberArr.length; i++) {
	if(d(i)<DEFAULT_MAX+1)		if(d(i)<DEFAULT_MAX+1)
	selfNumberArr[d(i)] = false;		selfNumberArr[d(i)] = false;
	}		}

	//selfnumber 출력		//selfnumber 출력
	for(int i = 1; i < selfNumberArr.length; i++) {		for(int i = 1; i < selfNumberArr.length; i++) {
	if(selfNumberArr[i] == true)		if(selfNumberArr[i] == true)
	System.out.println(i);		System.out.println(i);
	}		}
Line 50:		Line 50:
	int sum = n;		int sum = n;
	for(int i = 0; i < splitnStrings.length; i++) {		for(int i = 0; i < splitnStrings.length; i++) {
	sum += Integer.parseInt(splitnStrings[i]);		sum += Integer.parseInt(splitnStrings[i]);
	}		}
	return sum;		return sum;
Line 61:		Line 61:
	public class Main {		public class Main {
	public static void main(String[] args) {		public static void main(String[] args) {
	int list[] = new int[10000];		int list[] = new int[10000];

	//1부터 10000까지 list 생성		//1부터 10000까지 list 생성
	for(int i=0;i<list.length;i++) {		for(int i=0;i<list.length;i++) {
	list[i] = i + 1;		list[i] = i + 1;
	}		}
	int count = list.length;		int count = list.length;
Line 98:		Line 98:
	//만약 notSelfNum이 list에 포함되어 있다면 제거		//만약 notSelfNum이 list에 포함되어 있다면 제거
	for(int j=0;j<count;j++) {		for(int j=0;j<count;j++) {
	if(notSelfNum == list[j]) {		if(notSelfNum == list[j]) {
	for(int k=j;k<count-1;k++) {		for(int k=j;k<count-1;k++) {
	list[k] = ~~list[k~~+1];		list[k] = listk+1;
	}		}
	count--;		count--;
Line 109:		Line 109:
	//출력		//출력
	for(int i=0; i<count; i++) {		for(int i=0; i<count; i++) {
	System.out.println(list[i]);		System.out.println(list[i]);
	}		}
	}		}
	}		}

175.124.46.32 at 08:18, 12 May 2022

2022-05-12T08:18:02Z

← Older revision		Revision as of 08:18, 12 May 2022
Line 22:		Line 22:
	class Main {		class Main {

	public static void main(String[] args) {		public static void main(String[] args) {
	final int DEFAULT_MAX = 10000;		final int DEFAULT_MAX = 10000;
	boolean[] selfNumberArr = new boolean [[DEFAULT_MAX+1]]; //인덱스가 selfNumber이면 true를 담는 boolean array 생성		boolean[] selfNumberArr = new boolean[DEFAULT_MAX+1]; //인덱스가 selfNumber이면 true를 담는 boolean array 생성
	//Arr의 값을 전부 true로 초기화
	for(int i = 1; i < selfNumberArr.length; i++) {		//Arr의 값을 전부 true로 초기화
	selfNumberArr ~~[~~i~~]~~ = true;		for(int i = 1; i < selfNumberArr.length; i++) {
	}		selfNumberArr[i] = true;
	//1~10000을 돌면서, selfNumber이면 false로 값 변경		}
	for(int i = 1; i < selfNumberArr.length; i++) {
	if(d(i)		//1~10000을 돌면서, selfNumber이면 false로 값 변경
	}		for(int i = 1; i < selfNumberArr.length; i++) {
			if(d(i)<DEFAULT_MAX+1)
			selfNumberArr[d(i)] = false;
			}

			//selfnumber 출력
			for(int i = 1; i < selfNumberArr.length; i++) {
			if(selfNumberArr[i] == true)
			System.out.println(i);
			}

	~~//selfnumber 출력~~		}
	~~for(int i = 1; i < selfNumberArr.length; i++) {~~		static int d (int n) {
	~~if(selfNumberArr [i] == true)~~		String nString = Integer.toString(n);
	~~System.out.println(i);~~		String[] splitnStrings = nString.split("");
	}
	}		int sum = n;
	static int d (int n) {		for(int i = 0; i < splitnStrings.length; i++) {
	String nString = Integer.toString(n);		sum += Integer.parseInt(splitnStrings[i]);
	String[] splitnStrings = nString.split("");		}
	int sum = n;		return sum;
	for(int i = 0; i < splitnStrings.length; i++) {		}
	sum += Integer.parseInt(splitnStrings ~~[~~i~~]~~);
	}
	return sum;
	}

	}		}

	* [[박창훈]]		* 박창훈
	** 4673 : 셀프 넘버		** 4673 : 셀프 넘버
	public class Main {		public class Main {
	public static void main(String[] args) {		public static void main(String[] args) {
	int list[] = new int~~[~~10000~~]~~;		int list[] = new int[10000];

	//1부터 10000까지 list 생성		//1부터 10000까지 list 생성
	for(int i=0;i<list.length;i++) {		for(int i=0;i<list.length;i++) {
	list~~[~~i~~]~~ = i + 1;		list[i] = i + 1;
	}		}
	int count = list.length;		int count = list.length;
Line 93:		Line 98:
	//만약 notSelfNum이 list에 포함되어 있다면 제거		//만약 notSelfNum이 list에 포함되어 있다면 제거
	for(int j=0;j<count;j++) {		for(int j=0;j<count;j++) {
	if(notSelfNum == list~~[~~j~~]~~) {		if(notSelfNum == list[j]) {
	for(int k=j;k<count-1;k++) {		for(int k=j;k<count-1;k++) {
	list~~[~~k~~]~~ = list[[k+1]];		list[k] = list[k+1];
	}		}
	count--;		count--;
Line 104:		Line 109:
	//출력		//출력
	for(int i=0; i<count; i++) {		for(int i=0; i<count; i++) {
	System.out.println(list~~[~~i~~]~~);		System.out.println(list[i]);
	}		}
	}		}
	}		}

175.124.46.32 at 08:13, 12 May 2022

2022-05-12T08:13:31Z

@@ Line 54: / Line 54: @@
 * [[박창훈]]
 ** 4673 : 셀프 넘버
 public class Main {
- public static void main(String[] args) {
+	public static void main(String[] args) {
-  int list[] = new int &#91;10000&#93;;
+		int list[] = new int&#91;10000&#93;;
-  //1부터 10000까지 list 생성
-  for(int i=0;i
+		//1부터 10000까지 list 생성
+		for(int i=0;i<list.length;i++) {
+			list&#91;i&#93; = i + 1;
+}

175.124.46.32 at 08:13, 12 May 2022

2022-05-12T08:13:00Z

← Older revision		Revision as of 08:13, 12 May 2022
Line 19:		Line 19:
	* [[임지민]]		* [[임지민]]
	** 백준 4673 셀프넘버		** 백준 4673 셀프넘버

	class Main {		class Main {

	public static void main(String[] args) {		public static void main(String[] args) {
	final int DEFAULT_MAX = 10000;		final int DEFAULT_MAX = 10000;
	boolean[] selfNumberArr = new boolean[[DEFAULT_MAX+1]]; //인덱스가 selfNumber이면 true를 담는 boolean array 생성		boolean[] selfNumberArr = new boolean [[DEFAULT_MAX+1]]; //인덱스가 selfNumber이면 true를 담는 boolean array 생성
			//Arr의 값을 전부 true로 초기화
	//Arr의 값을 전부 true로 초기화		for(int i = 1; i < selfNumberArr.length; i++) {
	for(int i = 1; i < selfNumberArr.length; i++) {		selfNumberArr [i] = true;
	selfNumberArr[i] = true;		}
	}		//1~10000을 돌면서, selfNumber이면 false로 값 변경
			for(int i = 1; i < selfNumberArr.length; i++) {
	//1~10000을 돌면서, selfNumber이면 false로 값 변경		if(d(i)
	for(int i = 1; i < selfNumberArr.length; i++) {		}
	if(d(i)~~<DEFAULT_MAX+1)~~
	~~selfNumberArr[d(i)] = false;~~
	}

	~~//selfnumber 출력~~
	~~for(int i = 1; i < selfNumberArr.length; i++) {~~
	~~if(selfNumberArr[i] == true)~~
	~~System.out.println(i);~~
	}

	}		//selfnumber 출력
	static int d (int n) {		for(int i = 1; i < selfNumberArr.length; i++) {
	String nString = Integer.toString(n);		if(selfNumberArr [i] == true)
	String[] splitnStrings = nString.split("");		System.out.println(i);
			}
	int sum = n;		}
	for(int i = 0; i < splitnStrings.length; i++) {		static int d (int n) {
	sum += Integer.parseInt(splitnStrings[i]);		String nString = Integer.toString(n);
	}		String[] splitnStrings = nString.split("");
	return sum;		int sum = n;
	}		for(int i = 0; i < splitnStrings.length; i++) {
			sum += Integer.parseInt(splitnStrings [i]);
			}
			return sum;
			}

	}		}
Line 58:		Line 54:
	* [[박창훈]]		* [[박창훈]]
	** 4673 : 셀프 넘버		** 4673 : 셀프 넘버

	public class Main {		public class Main {
	public static void main(String[] args) {		public static void main(String[] args) {
	int list[] = new int[10000];		int list[] = new int [10000];
			//1부터 10000까지 list 생성
	//1부터 10000까지 list 생성		for(int i=0;i
	~~for(int i=0;i<list.length;i++) {~~		}
	~~list[i] = i + 1;~~
	}
	~~int count = list.length;~~

	~~//셀프 넘버가 아닌 숫자 구하기 및 그 숫자를 list에서 제거~~
	~~for(int i=1;i<=10000;i++) {~~
	~~int notSelfNum = 0;~~
	~~int a = 1;~~
	~~int times = 0;~~

	~~//i의 자릿수 판단~~
	~~while( i/a != 0 ) {~~
	~~a *= 10;~~
	~~times++;~~
	}
	~~int n = times;~~

	~~//각 자릿수 더하기~~
	~~for(int j=0; j<times; j++) {~~
	~~if(n>1) {~~
	~~notSelfNum += ((i%Math.pow(10, n))/Math.pow(10, n-1));~~
	~~n--;~~
	}
	~~else {~~
	~~notSelfNum += (i%10);~~
	}
	}

	~~//각 자릿수 더한 거에 자기 숫자 더하기~~
	~~notSelfNum += i;~~

	~~//만약 notSelfNum이 list에 포함되어 있다면 제거~~
	~~for(int j=0;j<count;j++) {~~
	~~if(notSelfNum == list[j]) {~~
	~~for(int k=j;k<count-1;k++) {~~
	~~list[k] = list[[k+1]];~~
	}
	~~count--;~~
	}
	}
	}

	~~//출력~~
	for(int i=0; i~~<count; i++) {~~
	~~System.out.println(list[i]);~~
	}
	}
	}		}

175.124.46.32 at 08:12, 12 May 2022

2022-05-12T08:12:31Z

← Older revision		Revision as of 08:12, 12 May 2022
Line 61:		Line 61:
	public static void main(String[] args) {		public static void main(String[] args) {
	int list[] = new int[10000];		int list[] = new int[10000];

			//1부터 10000까지 list 생성
	for(int i=0;i<list.length;i++) {		for(int i=0;i<list.length;i++) {
	list[i] = i + 1;		list[i] = i + 1;
	}		}
	int count = list.length;		int count = list.length;

			//셀프 넘버가 아닌 숫자 구하기 및 그 숫자를 list에서 제거
	for(int i=1;i<=10000;i++) {		for(int i=1;i<=10000;i++) {
	int notSelfNum = 0;		int notSelfNum = 0;
	int a = 1;		int a = 1;
	int times = 0;		int times = 0;

			//i의 자릿수 판단
	while( i/a != 0 ) {		while( i/a != 0 ) {
	a *= 10;		a *= 10;
Line 74:		Line 80:
	}		}
	int n = times;		int n = times;

			//각 자릿수 더하기
	for(int j=0; j<times; j++) {		for(int j=0; j<times; j++) {
	if(n>1) {		if(n>1) {
Line 83:		Line 91:
	}		}
	}		}

			//각 자릿수 더한 거에 자기 숫자 더하기
	notSelfNum += i;		notSelfNum += i;

			//만약 notSelfNum이 list에 포함되어 있다면 제거
	for(int j=0;j<count;j++) {		for(int j=0;j<count;j++) {
	if(notSelfNum == list[j]) {		if(notSelfNum == list[j]) {
Line 93:		Line 105:
	}		}
	}		}

			//출력
	for(int i=0; i<count; i++) {		for(int i=0; i<count; i++) {
	System.out.println(list[i]);		System.out.println(list[i]);

175.124.46.32 at 08:02, 12 May 2022

2022-05-12T08:02:23Z

← Older revision		Revision as of 08:02, 12 May 2022
Line 57:		Line 57:

	* [[박창훈]]		* [[박창훈]]
	** 4673 : ~~셀프넘버~~		** 4673 : 셀프 넘버
	public class Main {		public class Main {
	public static void main(String[] args) {		public static void main(String[] args) {

175.124.46.32 at 08:02, 12 May 2022

2022-05-12T08:02:12Z

← Older revision		Revision as of 08:02, 12 May 2022
Line 57:		Line 57:

	* [[박창훈]]		* [[박창훈]]
	** ~~이 부분에 작성해주세요~~		** 4673 : 셀프넘버
			public class Main {
			public static void main(String[] args) {
			int list[] = new int[10000];
			for(int i=0;i<list.length;i++) {
			list[i] = i + 1;
			}
			int count = list.length;
			for(int i=1;i<=10000;i++) {
			int notSelfNum = 0;
			int a = 1;
			int times = 0;
			while( i/a != 0 ) {
			a *= 10;
			times++;
			}
			int n = times;
			for(int j=0; j<times; j++) {
			if(n>1) {
			notSelfNum += ((i%Math.pow(10, n))/Math.pow(10, n-1));
			n--;
			}
			else {
			notSelfNum += (i%10);
			}
			}
			notSelfNum += i;
			for(int j=0;j<count;j++) {
			if(notSelfNum == list[j]) {
			for(int k=j;k<count-1;k++) {
			list[k] = list[[k+1]];
			}
			count--;
			}
			}
			}
			for(int i=0; i<count; i++) {
			System.out.println(list[i]);
			}
			}
			}

219.255.207.99 at 14:26, 9 May 2022

2022-05-09T14:26:10Z

@@ Line 18: / Line 18: @@
 == 과제 ==
 * [[임지민]]
-** 이 부분에 작성해주세요
+** 백준 4673 셀프넘버
 * [[박창훈]]
 ** 이 부분에 작성해주세요