Friend-Graph
来源:互联网 发布:淘宝上的台式机 编辑:程序博客网 时间:2024/06/05 00:10
Friend-Graph
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3254 Accepted Submission(s): 523
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>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");elseprintf("Great Team!\n");flag=0;}return 0;}
阅读全文
2 0
- Friend-Graph
- Friend-Graph
- Friend-Graph
- Friend-Graph
- Friend-Graph
- Friend-Graph
- HDU_6152 Friend-Graph 【暴力】
- Friend-Graph (暴力)
- HDU6152 Friend-Graph【模拟】
- HDU 6152 Friend-Graph
- HDU 6152 Friend-Graph
- Friend-Graph(hdoj6152)
- Friend-Graph 1003
- hdu-6152 Friend-Graph
- hdu6152 Friend-Graph
- HDU 6152 Friend-Graph
- HDU 6152 Friend-Graph
- HDU6152-Friend-Graph
- 选择排序-直接选择排序
- ListView的简单使用
- MongoDB Replica Set 副本集
- 前缀表达式&后缀表达式
- Client-server model
- Friend-Graph
- iOS开发中OC与H5网页交互之OC传值给JS(WKWebView)
- 数论中的一些模板
- oracle 学习笔记
- ISCSI网络存储服务器
- A Secret
- ajax对json的使用
- CaoHaha's staff
- 二叉树排序(前序、中序、后序)