Fox and Minimal path CodeForces - 389D

http://codeforces.com/problemset/problem/389/D

拼凑一个数通常考虑二进制 构造图也一样 先构造3-4 4-5 5-6 6-4   7-8 8-9 9-10 10-8这样的小环然后连起来成环链 有几个就是二的几次幂 然后在构造一条直链 直链和环链相互连一下就凑出了所有二进制位 细节比较恶心

#include <bits/stdc++.h>
using namespace std;

int e[2010][2010];
int pre[50],pos1[50],pos2[50];
int k,len,dis,n;

void solve()
{
    int i;
    n=3;
    e[1][n]=e[n][1]=1;
    for(i=0;i<dis;i++)
    {
        e[n][n+1]=e[n+1][n]=1;
        e[n][n+2]=e[n+2][n]=1;
        e[n+3][n+1]=e[n+1][n+3]=1;
        e[n+3][n+2]=e[n+2][n+3]=1;
        n+=3;
    }
    e[2][n]=e[n][2]=1;
    for(i=0;i<dis;i++) pos1[i]=3*(dis+1-i);
    n++;
    e[3][n]=e[n][3]=1;
    for(i=0;i<dis;i++)
    {
        e[n][n+1]=e[n+1][n]=1;
        e[n+1][n+2]=e[n+2][n+1]=1;
        pos2[dis-1-i]=n;
        n+=2;
    }
    n-=2;

    for(i=0;i<dis;i++)
    {
        if(pre[i])
        {
            e[pos1[i]][pos2[i]]=e[pos2[i]][pos1[i]]=1;
        }
    }
}

int main()
{
    int i,j;
    scanf("%d",&k);
    if(k==1)
    {
        printf("2\n");
        printf("NY\nYN\n");
    }
    else
    {
        while(k>0)
        {
            pre[len]=k%2;
            k/=2,len++;
            if(pre[len-1]) dis=len-1;
        }
        solve();

        printf("%d\n",n);
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                if(e[i][j]==1) printf("Y");
                else printf("N");
                //if(e[i][j]) printf("*%d %d*\n",i,j);
            }
            printf("\n");
        }
    }
    return 0;
}

//1000000000