题目链接:https://codeforces.com/problemset/problem/232/A
题目大意:
John Doe画画,他的画至多100个点,而且恰好包括k个长度为3的圈,长度为3一个圈是一个无序三点集合,每两点之间都连着无向边。现在要求你把符合题目条件之一的画画出来。用一个数组表示答案。
解题思路:
一个完全图含有的圈数为C(n, 3). 先找到这个图的最大完全子图的点的数目,连接完成后,用新点去连接这个子图的点,若连接n个,贡献为1+2+...+(n-1),按照规律贪心作图即可。如果单纯按照组合数贪心点数会超过题目要求。
代码如下:
# include <bits/stdc++.h>
using namespace std;
int C3[105];
int use[105];
int G[105][105];
int n, remain;
void cal(){
for(int i = 3; i <= 100; ++i)
C3[i] = i * (i-1) * (i-2) / 6;
}
void paint(int beg, int x){
//cout << beg + x << endl;
for(int i = beg; i < beg + x; ++i)
for(int j = beg; j < beg + x; ++j){
if(i != j) G[i][j] = 1;
}
}
void paint1(int beg, int x){
for(int i = 1; i <= x-1; ++i){
//cout << remain << endl;
if(remain < i-1) return;
G[i][beg] = 1;
G[beg][i] = 1;
remain -= i-1;
//cout << remain << endl;
}
}
int main(){
std::ios::sync_with_stdio(false);
cal();
while(cin >> n){
int cop = n;
memset(use, 0, sizeof(use));
memset(G, 0, sizeof(G));
for(int i = 100; i >= 3; --i){
while(n >= C3[i]){
use[i]++;
n -= C3[i];
}
}
//cout << 1 << endl;
int beg = 1;
remain = cop;
for(int i = 100; i >= 3; --i){
if(use[i]){
paint(beg, i);
beg += i;
remain -= C3[i];
//cout << remain << endl;
use[i]--;
while(remain){
paint1(beg, i);
beg++;
}
break;
}
}
cout << 100 << endl;
for(int i = 1; i <= 100; ++i){
for(int j = 1; j <= 100; ++j)
cout << G[i][j];
cout << endl;
}
}
return 0;
}