AKnight'sJourney - Revision history

imported>qa22ahj at 01:53, 16 November 2013

2013-11-16T01:53:56Z

@@ Line 38: / Line 38: @@
   A1B3C1A2B4C2A3B1C3A4B2C4
 === 풀이 ===
-* [[AKnight'sJourney/정진경|AKnight's Journey/정진경]]
+{| class="wikitable"
-* [[AKnight'sJourney/강소현|AKnight's Journey/강소현]]
+|-
 ----
 [http://poj.org/problem?id=2488 Problem A Knight's journey], [[문제분류]], [[ACM_ICPC/2011년스터디]]

imported>qa22ahj at 16:27, 14 November 2013

2013-11-14T16:27:43Z

← Older revision		Revision as of 16:27, 14 November 2013
Line 38:		Line 38:
	A1B3C1A2B4C2A3B1C3A4B2C4		A1B3C1A2B4C2A3B1C3A4B2C4
	=== 풀이 ===		=== 풀이 ===
			* [[AKnight'sJourney/정진경\|AKnight's Journey/정진경]]
	* [[AKnight'sJourney/강소현\|AKnight's Journey/강소현]]		* [[AKnight'sJourney/강소현\|AKnight's Journey/강소현]]
	----		----
	[http://poj.org/problem?id=2488 Problem A Knight's journey], [[문제분류]], [[ACM_ICPC/2011년스터디]]		[http://poj.org/problem?id=2488 Problem A Knight's journey], [[문제분류]], [[ACM_ICPC/2011년스터디]]

imported>qa22ahj at 05:08, 14 November 2013

2013-11-14T05:08:03Z

← Older revision		Revision as of 05:08, 14 November 2013
Line 29:		Line 29:

	=== Sample Output ===		=== Sample Output ===
	Scenario #1:		Scenario #1:
	A1		A1

	Scenario #2:		Scenario #2:
	impossible		impossible

	Scenario #3:		Scenario #3:
	A1B3C1A2B4C2A3B1C3A4B2C4		A1B3C1A2B4C2A3B1C3A4B2C4

	=== 풀이 ===		=== 풀이 ===
	* [[AKnight'sJourney/강소현\|AKnight's Journey/강소현]]		* [[AKnight'sJourney/강소현\|AKnight's Journey/강소현]]

imported>qa22ahj at 05:07, 14 November 2013

2013-11-14T05:07:49Z

← Older revision		Revision as of 05:07, 14 November 2013
Line 23:		Line 23:

	=== Sample Input ===		=== Sample Input ===
	3		3
	1 1		1 1
	2 3		2 3
	4 3		4 3

	=== Sample Output ===		=== Sample Output ===

imported>qa22ahj at 03:29, 14 November 2013

2013-11-14T03:29:01Z

← Older revision		Revision as of 03:29, 14 November 2013
Line 37:		Line 37:
	Scenario #3:		Scenario #3:
	A1B3C1A2B4C2A3B1C3A4B2C4		A1B3C1A2B4C2A3B1C3A4B2C4

			=== 풀이 ===
			* [[AKnight'sJourney/강소현\|AKnight's Journey/강소현]]
	----		----
	[http://poj.org/problem?id=2488 Problem A Knight's journey], [[문제분류]], [[ACM_ICPC/2011년스터디]]		[http://poj.org/problem?id=2488 Problem A Knight's journey], [[문제분류]], [[ACM_ICPC/2011년스터디]]

imported>jereneal20 at 17:15, 29 October 2011

2011-10-29T17:15:24Z

← Older revision		Revision as of 17:15, 29 October 2011
Line 38:		Line 38:
	A1B3C1A2B4C2A3B1C3A4B2C4		A1B3C1A2B4C2A3B1C3A4B2C4
	----		----
	[http://poj.org/problem?id=2488 Problem A Knight's journey], [[ACM_ICPC/2011년스터디]]		[http://poj.org/problem?id=2488 Problem A Knight's journey], [[문제분류]], [[ACM_ICPC/2011년스터디]]

imported>talin0528 at 06:43, 3 July 2011

2011-07-03T06:43:56Z

← Older revision		Revision as of 06:43, 3 July 2011
Line 38:		Line 38:
	A1B3C1A2B4C2A3B1C3A4B2C4		A1B3C1A2B4C2A3B1C3A4B2C4
	----		----
	[http://poj.org/problem?id=2488 Problem A Knight's journey]		[http://poj.org/problem?id=2488 Problem A Knight's journey], [[ACM_ICPC/2011년스터디]]

imported>talin0528 at 06:42, 3 July 2011

2011-07-03T06:42:55Z

← Older revision		Revision as of 06:42, 3 July 2011
Line 38:		Line 38:
	A1B3C1A2B4C2A3B1C3A4B2C4		A1B3C1A2B4C2A3B1C3A4B2C4
	----		----
			[http://poj.org/problem?id=2488 Problem A Knight's journey]

imported>talin0528 at 06:39, 3 July 2011

2011-07-03T06:39:49Z

← Older revision		Revision as of 06:39, 3 July 2011
Line 1:		Line 1:
	~~Describe AKnight~~'~~sJourney here~~		== A Knight's Journey ==
			{\| class="wikitable"
			\|-
			\| Time Limit
			\| 1000MS
			\| Memory Limit
			\| 65536K
			\|-
			\| Total Submissions
			\| 15350
			\| Accepted
			\| 5124
			\|}

			=== 배경 ===
			기사는 또 다시 같은 검은색과 흰색 사각형을 보는 것이 지루해 '''전 세계'''를 여행하기로 결심했다. 기사의 세계는 8*8 보다 각은 면적을 가진 체스판이다. 기사는 이동할 때 두 칸 이동하고 직각으로 한 칸 이동한다.

			=== 입력 ===
			입력은 첫 번째 라인에 양의 정수 N과 함께 시작됩니다. 다음 라인은 N 개의 테스트 케이스가 포함되어 있습니다. 각 테스트 케이스는 두 양의 정수 P와 Q로 이루어져 있는데, 1<= P * Q <= 26 로 제한이 되어있습니다. P*Q 체스판에서 P는 1, 2, ..., p , Q는 A, B, C, ..., Q를 나타냅니다.

			=== 출력 ===
			시나리오 시작 번호는 1입니다. 모든 시나리오에 대한 출력은 "Scenario # I:"으로 시작합니다. 다음 기사 이동과 체스판의 모든 사각형을 방문하는 순서는 '''사전 편찬(집필) 상의 순서'''를 따라야 합니다. 방문 가능한 경로는 여러 가지가 있을 수 있지만, ABC, 123 의 순서를 따지면 결과는 하나로 정해져 있습니다. 최종 경로는 한 줄에 제공해야합니다. 전부 방문할 수 있는 경로가 존재하지 않으면, 당신이 한 줄에 출력 불가능합니다.

			=== Sample Input ===
			3
			1 1
			2 3
			4 3

			=== Sample Output ===
			Scenario #1:
			A1

			Scenario #2:
			impossible

			Scenario #3:
			A1B3C1A2B4C2A3B1C3A4B2C4
			----

imported>joojis at 06:19, 3 July 2011

2011-07-03T06:19:20Z

← Older revision		Revision as of 06:19, 3 July 2011
Line 1:		Line 1:
	Describe AKnight'sJourney here		Describe AKnight'sJourney here

	~~=== Source Code ===~~
	~~#include <stdio.h>~~

	~~char* GetPath(int k)~~
	{
	~~switch(k){~~
	~~case 101: return "A1";~~
	~~case 304: return "A1C2A3B1D2B3C1A2C3D1B2D3";~~
	~~case 307: return "A1B3D2F1G3E2G1F3E1G2E3C2A3B1C3A2C1D3B2D1F2";~~
	~~case 308: return "A1B3C1A2C3D1B2D3E1G2E3C2A3B1D2F1H2F3G1E2G3H1F2H3";~~
	~~case 403: return "A1B3C1A2B4C2A3B1C3A4B2C4";~~
	~~case 405: return "A1B3C1A2B4D3E1C2D4E2C3A4B2D1E3C4A3B1D2E4";~~
	~~case 406: return "A1B3C1A2B4C2D4E2F4D3E1F3D2B1A3C4B2A4C3E4F2D1E3F1";~~
	~~case 504: return "A1B3A5C4D2B1A3B5D4C2B4A2C1D3C5A4B2D1C3D5";~~
	~~case 505: return "A1B3A5C4A3B1D2E4C5A4B2D1C3B5D4E2C1A2B4D5E3C2E1D3E5";~~
	~~case 604: return "A1B3A5C6D4B5D6C4D2B1A3C2B4A2C1D3B2D1C3D5B6A4C5A6";~~
	~~case 703: return "A1B3C1A2C3B1A3C2B4A6C7B5A7C6A5B7C5A4B2C4B6";~~
	~~case 803: return "A1B3C1A2B4C2A3B1C3A4B2C4A5B7C5A6B8C6A7B5C7A8B6C8";~~
	~~default: return "impossible";~~
	}
	}
	~~int main()~~
	{
	~~int i, n, p, q;~~

	~~scanf("%d", &n);~~
	~~for(i=1;i<=n;i++){~~
	~~scanf("%d %d", &p, &q);~~
	~~printf("Scenario #%d:\n%s\n\n", i, GetPath(p*100+q));~~
	}
	~~return 0;~~
	}

	~~/// C~~

	A[9][9],P,Q,F=1,C[]={-1,-2,1,-2,-2,-1,2,-1,-2,1,2,1,-1,2,1,2},N;char B[99];main(i,j,n){if(F)for(i=scanf("%d",&n);N=i<=n;main(1,1),printf("Scenario #%d:\n%s\n\n",i++,F?B:"impossible"),memset(A,0,81))B[scanf("%d%d",&P,&Q)PQ]=F=0;else if(1>i\|i>P\|1>j\|j>Q\|A[i][j]);else{for(B[N2-2]=j+64,B[N2-1]=i+48,n=F=N==PQ,A[i][j]=N++;n<8!F;main(i+C[n++2],j+C[n2+1]));A[i][j]-=--N;}}

	~~/// GCC로 컴파일해야 답이 나옵니당..~~
	~~=== ... ===~~

	* 음... 어디가 틀렸을까요 -[[정진경]]
	* 난데없이 억셉트가 되버렸다. -[[정진경]]