hdu-6152
来源:互联网 发布:潍坊行知学校网站 编辑:程序博客网 时间:2024/06/05 03:12
Friend-Graph
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1151 Accepted Submission(s): 591
Problem Description
It is well known that small groups are not conducive of the development of a team. Therefore, there shouldn’t be any small groups in a good team.
In a team with n members,if there are three or more members are not friends with each other or there are three or more members who are friends with each other. The team meeting the above conditions can be called a bad team.Otherwise,the team is a good team.
A company is going to make an assessment of each team in this company. We have known the team with n members and all the friend relationship among these n individuals. Please judge whether it is a good team.
In a team with n members,if there are three or more members are not friends with each other or there are three or more members who are friends with each other. The team meeting the above conditions can be called a bad team.Otherwise,the team is a good team.
A company is going to make an assessment of each team in this company. We have known the team with n members and all the friend relationship among these n individuals. Please judge whether it is a good team.
Input
The first line of the input gives the number of test cases T; T test cases follow.(T<=15)
The first line od each case should contain one integers n, representing the number of people of the team.(n≤3000 )
Then there are n-1 rows. Thei th row should contain n-i numbers, in which number aij represents the relationship between member i and member j+i. 0 means these two individuals are not friends. 1 means these two individuals are friends.
The first line od each case should contain one integers n, representing the number of people of the team.(
Then there are n-1 rows. The
Output
Please output ”Great Team!” if this team is a good team, otherwise please output “Bad Team!”.
Sample Input
141 1 00 01
Sample Output
Great Team!
题目应该容易懂,直接暴力 不要想多,就直接暴力
代码:
#include<stdio.h>using namespace std;int a[3001][3001];int main(){ int t; int n,count1=0,count2=0; scanf("%d",&t); int flag=0; while(t--) { scanf("%d",&n); for(int i=1;i<=n-1;i++) for(int j=i+1;j<=n;j++) scanf("%d",&a[i][j]); for(int i=1;i<=n-1;i++) { for(int j=i+1;j<=n;j++) { if(a[i][j]==1) count1++; if(a[i][j]==0) count2++; if(count1>=3||count2>=3) { flag=1; count1=0; count2=0; } } count1=0; count2=0; } if(flag) printf("Bad Team!\n"); else printf("Great Team!\n"); flag=0; } return 0;}
阅读全文
0 0
- HDU 6152
- hdu-6152
- HDU 6152 Friend-Graph
- HDU 6152 Friend-Graph
- hdu-6152 Friend-Graph
- HDU 6152 Friend-Graph
- HDU 6152 Friend-Graph
- hdu 6152 Friend-Graph
- HDU-6152Friend-Graph
- HDU 6152 Friend-Graph
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- 限制网页只能在微信浏览器打开
- 前端异常:Uncaught SyntaxError: missing ) after argument list 解决办法
- jpa onetomany 使用级连表 删除被维护表数据时的坑
- MFC2-实时读取视频
- linux 工具篇
- hdu-6152
- react 快速启动
- 存储过程 触发器 视图
- 计蒜客-最大子阵列 / NYOJ题目44-子串和
- Struts2处理数据
- android文件系统挂载分析(1)---正常开机挂载
- Sublime text3 编译Python 只显示时间无输出结果处理
- effective C++条款二十三解读
- HTTP首部