CCR

https://algospot.com/judge/problem/read/CCR

algospot.com :: CCR

#include 
#define MAX_C 81
#define MAX_R 25

char MAP[MAX_C][MAX_R];
bool MAPMAP[MAX_C][MAX_R];

int analyist(int r, int c)
{
	// 선분과 점으로 도형을 구분
	/* 숫자		선분	접점
	 * 1		1		0
	 * 2		5		4
	 * 3		4		3
	 * 4		3		2
	 * 5		5		4
	 * 6		5		5
	 * 7		2		2
	 * 8		5		6
	 * 9		5		5
	 * 0		4		4
	 */
	int VALUE;
	return VALUE;
}
int search()
{
	// search All MAP
	// call analyist( r, c )
	// TOTAL += anlyist();
	int TOTAL = 0;
	return TOTAL;
}
int main()
{
	int T;
	for (scanf("%d", &T); T > 0; T--)
	{
		int R, C;
		scanf("%d %d", &R, &C);
		getchar();

		for (int i = 0; i < C; i++)
			gets(MAP[i]);

		printf("%d\n", search());
	}
}