AKnight'sJourney/정진경 - Revision history

imported>qa22ahj at 16:27, 14 November 2013

2013-11-14T16:27:26Z

← Older revision		Revision as of 16:27, 14 November 2013
Line 1:		Line 1:
	~~Describe AKnight'sJourney here~~

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

imported>jereneal20 at 13:25, 14 November 2013

2013-11-14T13:25:20Z

← Older revision		Revision as of 13:25, 14 November 2013
Line 42:		Line 42:
	=== ... ===		=== ... ===
	* 이거슨 poj1등.		* 이거슨 poj1등.
			----
			[[ACM_ICPC/2011년스터디]], [[정진경]]

imported>joojis at 09:18, 3 July 2011

2011-07-03T09:18:01Z

← Older revision		Revision as of 09:18, 3 July 2011
Line 36:		Line 36:
	/// C		/// C

	A[9][9],P,Q,F=1,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,99))B[scanf("%d%d",&P,&Q)PQ]=F=0;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;n++)main(i+(~n%2^(n<6?n>1:0)+n%2),j+n/2-2+n/4);A[i][j]-=--N;}}

	/// GCC, 340B		/// GCC, 340B

imported>jereneal20 at 09:17, 3 July 2011

2011-07-03T09:17:05Z

← Older revision		Revision as of 09:17, 3 July 2011
Line 41:		Line 41:

	=== ... ===		=== ... ===
			* 이거슨 poj1등.

imported>joojis at 09:03, 3 July 2011

2011-07-03T09:03:34Z

← Older revision		Revision as of 09:03, 3 July 2011
Line 36:		Line 36:
	/// C		/// 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;}}		A[9][9],P,Q,F=1,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,99))B[scanf("%d%d",&P,&Q)PQ]=F=0;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;n++)main(i+(~n%2^(n<6?n>1:0)+n%2),j+n/2-2+n/4);A[i][j]-=--N;}}

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

	=== ... ===		=== ... ===

imported>joojis at 06:17, 3 July 2011

2011-07-03T06:17:52Z

New page

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)*P*Q]=F=0;else if(1>i|i>P|1>j|j>Q|A[i][j]);else{for(B[N*2-2]=j+64,B[N*2-1]=i+48,n=F=N==P*Q,A[i][j]=N++;n<8*!F;main(i+C[n++*2],j+C[n*2+1]));A[i][j]-=--N;}}

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

=== ... ===