Codeforces Round #228 (Div. 1)B

进制构造 这里用了十进制 有点像串并联 每一位代表的数分开表示出来再把每一位的数并起来 比如892  就是800+90+2 800又可分为8*10*10。。。

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
int w[1010][1010],s[20],en[20];
int a[20];
int main()
{
    int k,i,j;
    cin>>k;
    int g = 0;
    while(k)
    {
        a[++g] = k%10;
        k/=10;
    }
    int o = 2;
    int t;
    for(i = 1 ; i <= g ; i++)
    {
        if(!a[i]) continue;
        o++;
        w[1][o] = w[o][1] = 1;
        for(j = 1 ; j < 10-i ; j++)
        {
            w[o][o+1] = w[o+1][o] = 1;
            o++;
        }
        for(j = 1; j <= a[i] ; j++)
        w[o][o+j] = w[o+j][o] = 1;
        t = o+a[i];
        for(j = 1 ; j < i ; j++)
        {
            for(int k = o+1 ; k <= t ; k ++)
            {
                for(int e = t+1 ; e <= t+10 ; e++)
                w[k][e] = w[e][k] = 1;
                o = t;
            }
            t+=10;
        }
        for(j = o+1 ; j <= t ; j++)
        w[j][t+1] = w[t+1][j] = 1;
        o = t+1;
        w[o][2] = w[2][o] = 1;
    }
    cout<<o<<endl;
    for(i = 1; i <= o ; i++)
    {
        for(j = 1; j <= o ; j++)
        if(w[i][j])
        cout<<"Y";
        else
        cout<<"N";
        puts("");
    }
    return 0;
}