2017ccpc网络赛 1003Friend-Graph
来源:互联网 发布:淘宝联盟高佣金通过 编辑:程序博客网 时间:2024/06/07 17:36
Friend-Graph
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 781 Accepted Submission(s): 412
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!
签到题,建立map,循环遍历找朋友
#include <stdio.h>int map[3001][3001];int main(int argc, char *argv[]){int t;scanf("%d",&t);while(t--){int n;scanf("%d",&n);int i,j;int a;for(i=0;i<n-1;i++){for(j=i+1;j<n;j++){int a;scanf("%d",&a);map[i][j]=map[j][i]=a;}}int flag=0;for(i=0;i<n;i++){int sum1=0,sum2=0;for(j=0;j<n;j++){if(map[i][j]==1)sum1++;elsesum2++;if(sum1>=3||sum2>=3){flag=1;break;}}if(flag==1)break;}if(flag==1)printf("Bad Team!\n");elseprintf("Great Team!\n");}return 0;}
阅读全文
0 0
- 2017ccpc网络赛 1003Friend-Graph
- 2017CCPC网络选拔赛1003Friend-Graph
- 2017CCPC 网络选拔赛 1003 Friend-Graph
- 2017CCPC网络选拔赛 1003-Friend-Graph
- 2017 ccpc 网络赛 Friend-Graph
- ccpc网络赛Friend-Graph
- [ccpc网络赛]Friend-Graph
- 2017ccpc网络赛——Friend-Graph
- hdu5152.Friend-Graph(CCPC网络赛)
- 2017ccpc网赛-1003-Friend-Graph
- ccpc预选赛-1003Friend-Graph
- hdu6152-CCPC网络赛&思维&拉姆齐定理-Friend-Graph
- hdu6152 Friend-Graph (2017 ccpc 网络赛 (暴力 + 一个神奇的定理)
- 2017CCPC网络赛 Friend-Graph(暴力、拉姆齐(Ramsey)定理)
- HDU 6152 Friend-Graph(2017CCPC网络选拔赛)【Floyed求传递闭包】
- hdu6152 Friend-Graph CCPC网赛1003 Ramsey定理
- CCPC2017网络赛1003Friend-Graph——暴力
- HDU-2017中国大学生程序设计竞赛-网络选拔赛-1003-Friend-Graph
- UEditor Java版更改上传文件路径
- 自定义View之小球自由落体弹跳加载控件
- 实现表格冻结顶栏效果
- NOIP2012普及组-寻宝
- 高一暑假集训总结
- 2017ccpc网络赛 1003Friend-Graph
- oracle简单归纳
- 读书笔记_CLR.via.c#第十六章_数组
- XRecyclerview用法以及遇到的一些问题
- Get请求和Post请求的区别
- 2018网易校招内推笔试-独立的小易(python)
- C#性能优化黑科技(一)【反射】修改属性的快速方法
- 一种比较省内存的稀疏矩阵Python存储方案
- 数据结构编程笔记十:第三章 栈和队列 循环队列的实现