Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

代码!

Posted by chenxuan123456789 at 2012-07-29 11:01:05 on Problem 2488
#include <stdio.h>
#include <string.h>
int flag[30][30];
int mov[8][2]={{-2,-1},{-2,1},{-1,-2},{-1,2},{1,-2},{1,2},{2,-1},{2,1}};
int n,k;
int p,q;
char path[30][2];
int tag;
int dfs(int x,int y,int step)
{ 
	int n_x,n_y,i;
    if(step==p*q)
    {
        tag=1;
        return 1;
    }

    for(i=0;i<8;i++)
    {
        n_x=x+mov[i][0];
        n_y=y+mov[i][1];
        if(n_x>=1 && n_x<=q && n_y>=1 && n_y<=p && !flag[n_x][n_y])
        {
            path[step][0]=n_x+'A'-1;
            path[step][1]=n_y+'0';
            flag[n_x][n_y]=1;
            dfs(n_x,n_y,step+1);
            if(tag)
             return 1;
            flag[n_x][n_y]=0;
        }
    }
    return 0;
}

int main()
{
    
    int i;
    scanf("%d",&n);
    for(k=1;k<=n;k++)
    {
        scanf("%d%d",&p,&q);
        memset(path,0,sizeof(path));
        memset(flag,0,sizeof(flag));

        tag=0;
        flag[1][1]=1;
        path[0][0]='A';
        path[0][1]='1';

        printf("Scenario #%d:\n",k);
        if(dfs(1,1,1))
        {
            for(i=0;i<p*q;i++)
                printf("%c%c",path[i][0],path[i][1]);
        }
        else
            printf("impossible");
        printf("\n\n");
    }
    return 0;
}


Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator