1R/2016 09 19 - Revision history

Maintenance script: Repair pages found by live-compare batch 0001

2026-03-26T14:46:15Z

Repair pages found by live-compare batch 0001

← Older revision		Revision as of 14:46, 26 March 2026
Line 13:		Line 13:

	int N;		int N;
	int arr[129][129] = { 0, };		int arr[129][129] = { 0, };
	int ans[2] = { 0, };		int ans[2] = { 0, };

	void search(int x, int y, int num){		void search(int x, int y, int num){
	//cout<< x << " " << y << " " << num << endl;		//cout<< x << " " << y << " " << num << endl;
	if(num == 1){		if(num == 1){
	ans[arr[x][y]]++;		ans[arr[x][y]]++;
	return;		return;
	}		}
	int allSame = true;		int allSame = true;
	int color = arr[x][y];		int color = arr[x][y];
	for(int i = 0; i<num && allSame; i++){		for(int i = 0; i<num && allSame; i++){
	for(int j = 0; j<num && allSame; j++){		for(int j = 0; j<num && allSame; j++){
	if(arr[x+i][y+j] != color){		if(arr[x+i][y+j] != color){
	allSame = false;		allSame = false;
	}		}
Line 32:		Line 32:
	}		}
	if(allSame){		if(allSame){
	ans[color]++;		ans[color]++;
	return;		return;
	}		}
Line 46:		Line 46:
	for(int i = 0; i<N; i++){		for(int i = 0; i<N; i++){
	for(int j = 0; j<N; j++){		for(int j = 0; j<N; j++){
	cin>> arr[i][j];		cin>> arr[i][j];
	}		}
	}		}
	search(0,0, N);		search(0,0, N);
	cout<< ans[0] << endl << ans[1] <<endl;		cout<< ans[0] << endl << ans[1] <<endl;
	}		}
	== 박인서 ==		== 박인서 ==
	#include <iostream>		#include <iostream>
	int a[130][130];		int a[130][130];
	int cnt[2];		int cnt[2];

	void divcon(int x1, int x2, int y1, int y2) {		void divcon(int x1, int x2, int y1, int y2) {
	int col = a[x1][y1];		int col = a[x1][y1];
	bool flag = false;		bool flag = false;

	for (int i = x1; i < x2; i++) {		for (int i = x1; i < x2; i++) {
	for (int j = y1; j < y2; j++) {		for (int j = y1; j < y2; j++) {
	if (a[i][j] != col) {		if (a[i][j] != col) {
	flag = true;		flag = true;
	break;		break;
Line 78:		Line 78:
	divcon(xm, x2, ym, y2);		divcon(xm, x2, ym, y2);
	}		}
	else cnt[col]++;		else cnt[col]++;
	}		}

Line 87:		Line 87:
	for (int i = 0; i < n; i++) {		for (int i = 0; i < n; i++) {
	for (int j = 0; j < n; j++)		for (int j = 0; j < n; j++)
	std::cin >> a[i][j];		std::cin >> a[i][j];
	}		}

	divcon(0, n, 0, n);		divcon(0, n, 0, n);
	std::cout << cnt[0] << std::endl << cnt[1];		std::cout << cnt[0] << std::endl << cnt[1];
	return 0;		return 0;
	}		}
Line 105:		Line 105:

	== 곽정흠 ==		== 곽정흠 ==

175.124.46.11 at 05:06, 24 September 2016

2016-09-24T05:06:54Z

@@ Line 9: / Line 9: @@
 = 코드 =
 == 15이원준 ==
+ #include&lt;iostream&gt;
 == 박인서 ==
   #include &lt;iostream&gt;

165.194.27.163 at 04:49, 21 September 2016

2016-09-21T04:49:09Z

@@ Line 5: / Line 5: @@
 = 참가자 =
+* 박인서
 = 코드 =
@@ Line 11: / Line 11: @@
 == 박인서 ==
 == 곽정흠 ==
@@ Line 18: / Line 59: @@
 == 박인서 ==
 == 곽정흠 ==

165.194.27.163: {CREATE}

2016-09-20T04:44:48Z

{CREATE}

New page

__TOC__

= 오늘의 문제 =
* [https://www.acmicpc.net/problem/2630|색종이 만들기]

= 참가자 =
*

= 코드 =
== 15이원준 ==

== 박인서 ==

== 곽정흠 ==

= 아이디어 =
== 15이원준 ==

== 박인서 ==

== 곽정흠 ==