2017年中国大学生程序设计竞赛网络赛杭电OJ---1003 Friend-Graph
2017-08-22 11:29
489 查看
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.
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. The ith
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.
Output
Please output ”Great Team!” if this team is a good team, otherwise please output “Bad Team!”.
Sample Input
1
4
1 1 0
0 0
1
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;
}
相关文章推荐
- Friend-Graph(中国大学生程序选拔赛2017年网络大赛)
- xtu 1260 Determinant [2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛(湖南) A]
- hdu 5833 2016年中国大学生程序设计竞赛网络赛 高斯消元
- 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛:H—Highway
- xtu 1260 Determinant [2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛(湖南) A题]
- 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛 Strange Optimization
- 2017中国大学生程序设计竞赛 - 网络选拔赛 1003 Friend-Graph
- HDU 6152 2017中国大学生程序设计大赛网络赛 1003
- HDU 6152 - Friend-Graph 2017中国大学生程序设计竞赛 - 网络选拔赛 1003 - Friend-Graph
- Friend-Graph 2017中国大学生程序竞赛网络赛
- XTU 1268 Strange Optimization 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛(湖南)
- 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛:E—Partial Sum
- XTU 1264 Partial Sum 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛(湖南)
- xtu 1268 Strange Optimization 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛(湖南)
- 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛 Highway
- 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛:I— Strange Optimization
- 2017中国大学生程序设计竞赛 - 网络选拔赛 :1003&hdu6152、Friend-Graph
- HDU-2017中国大学生程序设计竞赛-网络选拔赛-1003-Friend-Graph
- 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛 Super Resolution
- XTU 1263 Super Resolution 2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛(湖南)