1R/2016 10 07 - 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 12:		Line 12:
	using namespace std;		using namespace std;

	int dp[14*14][1<<15] = { 0, };		int dp[14*14][1<<15] = { 0, };
	int n, m;		int n, m;
	int search(int num, int bitma){		int search(int num, int bitma){
	if(dp[num][bitma]){		if(dp[num][bitma]){
	if(dp[num][bitma] == -1){		if(dp[num][bitma] == -1){
	return 0;		return 0;
	}		}
	return dp[num][bitma];		return dp[num][bitma];
	}		}
	if(num == n * m - 1){		if(num == n * m - 1){
Line 25:		Line 25:
	return bitma;		return bitma;
	}		}
	dp[num][bitma] = -1;		dp[num][bitma] = -1;
	return 0;		return 0;
	}		}
	if(bitma & 1){		if(bitma & 1){
	dp[num][bitma] = search(num + 1, bitma >> 1) % 9901;		dp[num][bitma] = search(num + 1, bitma >> 1) % 9901;
	if(dp[num][bitma]){		if(dp[num][bitma]){
	return dp[num][bitma];		return dp[num][bitma];
	}		}
	dp[num][bitma] = -1;		dp[num][bitma] = -1;
	return 0;		return 0;
	}		}
	if( num % m != m - 1 && !((bitma >> 1) & 1)){		if( num % m != m - 1 && !((bitma >> 1) & 1)){
	dp[num][bitma] = search(num + 1, (bitma >> 1) + 1) % 9901;		dp[num][bitma] = search(num + 1, (bitma >> 1) + 1) % 9901;
	}		}
	if( num < (n-1) * m){		if( num < (n-1) * m){
	dp[num][bitma] = (dp[num][bitma] + search(num + 1, (bitma >> 1) + (1<<(m-1)))) % 9901;		dp[num][bitma] = (dp[num][bitma] + search(num + 1, (bitma >> 1) + (1<<(m-1)))) % 9901;
	}		}
	if(dp[num][bitma]){		if(dp[num][bitma]){
	return dp[num][bitma];		return dp[num][bitma];
	}		}
	dp[num][bitma] = -1;		dp[num][bitma] = -1;
	return 0;		return 0;
	}		}
Line 59:		Line 59:
	#include <cstring>		#include <cstring>

	int d[14 * 14][1 << 14];		int d[14 * 14][1 << 14];
	int n, m;		int n, m;

Line 67:		Line 67:
	return 0;		return 0;
	}		}
	if (d[t][s] >= 0) return d[t][s] % 9901;		if (d[t][s] >= 0) return d[t][s] % 9901;

	int& res = d[t][s];		int& res = d[t][s];
	if (s % 2 == 1) res=go(t + 1, s >> 1);		if (s % 2 == 1) res=go(t + 1, s >> 1);
	else {		else {
Line 95:		Line 95:

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

141.98.9.23: 1

2023-01-17T01:52:21Z

← Older revision		Revision as of 01:52, 17 January 2023
Line 5:		Line 5:


	~~= 참가자 =~~
	* 15이원준
	* 박인서

	= 코드 =		= 코드 =

165.194.27.163 at 09:16, 7 October 2016

2016-10-07T09:16:23Z

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

165.194.27.163 at 07:58, 7 October 2016

2016-10-07T07:58:21Z

@@ Line 13: / Line 13: @@
 == 박인서 ==
 == 곽정흠 ==
@@ Line 20: / Line 49: @@
 == 박인서 ==
 == 곽정흠 ==

165.194.27.163: {CREATE}

2016-10-07T07:34:47Z

{CREATE}

New page

__TOC__

= 오늘의 문제 =
* [https://www.acmicpc.net/problem/1648|격자판 채우기]

= 참가자 =
* 15이원준
* 박인서

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

== 박인서 ==

== 곽정흠 ==

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

== 박인서 ==

== 곽정흠 ==