codeforces 232A Cycles (构建图,贪心+模拟)
来源:互联网 发布:制作二维动漫软件 编辑:程序博客网 时间:2024/06/05 14:18
Cycles
Description
描述
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.
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.
Sample Input
Input
1
Output
3011101110
Input
10
Output
50111110111110111110111110
贪心手法。点最多一百个,那么,要让每个点的作用都发挥出来。所有,可以模拟每次加入点所带来的影响,来确定,两个点是否要连接。
#include <iostream>#include<cstdio>using namespace std;int ans,k,ss;int gra[103][103];int main(){ int n,i,j,k; scanf("%d",&n); gra[1][2]=gra[2][1]=1;//最少存在一条边 for(i=3;i<=100;i++)//依次增加顶点 { for(j=1;j<i;j++) { ss=0;//三元环个数 for(k=1;k<j;k++) if(gra[k][j]&&gra[k][i]) ss++; if(n>=ss) { n-=ss; gra[i][j]=gra[j][i]=1; } if(n==0)break; } if(n==0)break; } n=i; printf("%d\n",n); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) printf("%d",gra[i][j]); printf("\n"); } return 0;}
0 0
- codeforces 232A Cycles (构建图,贪心+模拟)
- codeforces 232A Cycles 图论 贪心 思维
- 【CodeForces】233C - Cycles(贪心)
- CodeForces Round #144(232A) - Cycles
- codeforces 233c Cycles【贪心】
- Codeforces-----233C---Cycles模拟
- CodeForces - 730A 贪心+模拟
- Codeforces 232A Cycles 比较有趣的思路题
- Codeforces 137A-Postcards and photos(模拟+贪心)
- CodeForces 593A 2Char(贪心,模拟)
- Codeforces Round #144 (Div. 1) A. Cycles
- Codeforces 233C Cycles(图的三元环)
- codeforces-232【A贪心、思维、图】
- CodeForces 233C Cycles(思维)
- CodeForces 233 C.Cycles(构造)
- Codeforces Round #192 (Div. 1) A. Purification(贪心模拟+清除每行每列)
- 【Codeforces 780 D Innokenty and a Football League 】+ 模拟 + 贪心
- CodeForces 780D Innokenty and a Football League【模拟+贪心】
- Mac下Oracle JDK的安装配置
- JSTL标签中import,redirect标签的使用
- file_get_contents采集加入库
- [js点滴]JavaScript之触摸事件07
- 协议森林04 地址耗尽危机 (IPv4与IPv6地址)
- codeforces 232A Cycles (构建图,贪心+模拟)
- 学习Linux系统和服务器管理的注意事项
- JSP内置对象2
- Servlet——1
- 《控方证人》
- [js点滴]JavaScript之文档事件08
- 分类问题中的类别不平衡-总结
- Sublime快捷键大全(by 星空武哥)
- jequery特效楼层