Cycles

C. Cycles
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
John Doe started thinking about graphs. After some thought he decided that he wants to paint an undirected graph, containing exactly k cycles 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.

Input
A single line contains an integer k (1 ≤ k ≤ 105) — the number of cycles of length 3 in the required graph.

Output
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.

Examples
inputCopy
1
outputCopy
3
011
101
110
inputCopy
10
outputCopy
5
01111
10111
11011
11101
11110
思路：从三个顶点开始，添加循环节，如果当前顶点数加满了，就再加一个顶点，直到循环节的数量达到n
代码：

#include<bits/stdc++.h>
using namespace std;
const int N = 10000050;
typedef long long ll;
int pos[101][101];

int main()
{
    memset(pos,0,sizeof(pos));
    int n;
    cin>>n;

    pos[1][2]=pos[2][1]=1;
    int i;
    for(i=3; i<=100; i++)
    {
        for(int j=1; j<i; j++)
        {
            int c=0;
            for(int k=1; k<j; k++)
                if(pos[k][i]&&pos[k][j])
                    c++;
            if(c<=n)
            {
                n-=c;
                pos[i][j]=pos[j][i]=1;
            }

            if(!n)
                break;

        }
        if(!n)
            break;
    }
    cout<<i<<endl;
    for(int x=1; x<=i; x++)
    {
        for(int y=1; y<=i; y++)
            cout<<pos[x][y];
        cout<<endl;
    }
}