2017年中国大学生程序设计竞赛网络赛杭电OJ---1003 Friend-Graph
来源:互联网 发布:javascript的continue 编辑:程序博客网 时间:2024/06/05 00:30
Friend-Graph
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6514 Accepted Submission(s): 1610
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>#include<string.h>int a[3001][3001]; int fun(int n){for(int i=1;i<n;i++){for(int j=1;j<n-i;j++){if(a[i][j]==1 && a[i][j+1]==1){if(a[i+j][1]==1) return 0;}if(a[i][j]==0 && a[i][j+1]==0){if(a[i+j][1]==0) return 0;}}}return 1;}int main(){int T;scanf("%d",&T);while(T--){int n;scanf("%d",&n);for(int i=1;i<n;i++){for(int j=1;j<n-i+1;j++) scanf("%d",&a[i][j]);}if(fun(n)) printf("Great Team!\n");else printf("Bad Team!\n");}return 0;}
阅读全文
1 0
- 2017年中国大学生程序设计竞赛网络赛杭电OJ---1003 Friend-Graph
- HDU-2017中国大学生程序设计竞赛-网络选拔赛-1003-Friend-Graph
- 2015年中国大学生程序设计竞赛排名
- hdu 5833 2016年中国大学生程序设计竞赛网络赛 高斯消元
- HDU6152 Friend-Graph(拉姆齐定理,2017中国大学生程序设计竞赛
- 2016年中国大学生程序设计竞赛(杭州)-重现赛
- 2016年中国大学生程序设计竞赛(杭州)-重现赛
- 2016年中国大学生程序设计竞赛(杭州)
- 2016年中国大学生程序设计竞赛(杭州) 部分题解
- HDU5965--2016年中国大学生程序设计竞赛(合肥)
- 2016年中国大学生程序设计竞赛(合肥)-重现赛
- HDU5938+贪心+(2016年中国大学生程序设计竞赛(杭州))
- Friend-Graph 2017中国大学生程序竞赛网络赛
- 2017CCPC网络选拔赛1003Friend-Graph
- 2017CCPC 网络选拔赛 1003 Friend-Graph
- 2017CCPC网络选拔赛 1003-Friend-Graph
- 2017ccpc网络赛 1003Friend-Graph
- HDU 5933 ArcSoft's Office Rearrangement 【模拟】(2016年中国大学生程序设计竞赛(杭州))
- jvm metaspace导致FGC
- 迁移/home目录到单独分区
- UFT之检查点
- Java 后台逻辑,合同编号生成
- 爬虫 IP代理策略
- 2017年中国大学生程序设计竞赛网络赛杭电OJ---1003 Friend-Graph
- DOM的変动事件总结
- synchronized 和java.util.concurrent.locks.Lock 的异同
- 欢迎使用CSDN-markdown编辑器
- 原型模式
- Android进阶#(6/12)让程序更优的技术——性能优化_布局优化
- jQuery的append/prepend和after/before有什么区别?
- MAVEN 引入jar包没问题,但是程序中使用jar中的类报错的坑
- 生成器、迭代器