John Doe started thinking about graphs. After some thought he decided that he wants to paint an undirected graph, containing exactly kcycles of length 3.
A cycle of length 3 is an unordered group of three distinct graph vertices a, b and c, such that each pair of them is connected by a graph edge.
John has been painting for long, but he has not been a success. Help him find such graph. Note that the number of vertices there shouldn't exceed 100, or else John will have problems painting it.
A single line contains an integer k (1 ≤ k ≤ 105) — the number of cycles of length 3 in the required graph.
In the first line print integer n (3 ≤ n ≤ 100) — the number of vertices in the found graph. In each of next n lines print n characters "0" and "1": the i-th character of the j-th line should equal "0", if vertices i and j do not have an edge between them, otherwise it should equal "1". Note that as the required graph is undirected, the i-th character of the j-th line must equal the j-th character of the i-th line. The graph shouldn't contain self-loops, so the i-th character of the i-th line must equal "0" for all i.
1
3
011
101
110
10
5
01111
10111
11011
11101
11110
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int n,i,j,k,l,m,ans[110][110];
while(scanf("%d",&n)!=EOF)
{
memset(ans,0,sizeof(0));
for(i=3;i<=100;i++)//求最大完全图
{
if(i*(i-1)*(i-2)/6>n)
{
k=i-1;
break;
}
}
for(i=1;i<=k;i++)
{
for(j=1;j<=k;j++)
{
if(i!=j)
{
ans[i][j]=1;
}
else
ans[i][j]=0;
}
}
n=n-k*(k-1)*(k-2)/6;
while(n)
{
k++;//顶点数加1
for(i=2;n>=i*(i+1)/2;i++);//添加边
n-=i*(i-1)/2;
for(j=1;j<=i;j++)
ans[k][j]=ans[j][k]=1;
}
printf("%d\n",k);
for(i=1;i<=k;i++)
{
for(j=1;j<=k;j++)
{
printf("%d",ans[i][j]);
}
printf("\n");
}
}
return 0;
}