HDU 6152-Friend-Graph(ccpc)
来源:互联网 发布:android 7.0源码 编辑:程序博客网 时间:2024/06/15 00:54
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<iostream>#include<cstdio>#include<bits/stdc++.h>using namespace std;bool Map[3010][3010];bool finded(int n){ int i,j,k; for(i=1;i<=n;i++) { for(j=i+1;j<=n;j++) { for(k=j+1;k<=n;k++) { if(Map[i][j]==Map[i][k]&&Map[i][k]==Map[j][k]&&Map[i][j]==Map[j][k]) return true; } } } return 0;}int main(){ int i,j; int n,m; scanf("%d",&n); int q; while(n--) { scanf("%d",&m); for(i=1;i<m;i++) { for(j=1+i;j<=m;j++) { scanf("%d",&q); if(q==1) Map[j][i]=Map[i][j]=false; else Map[j][i]=Map[i][j]=true; } } bool flag=finded(m); if(flag==false) printf("Great Team!\n"); else printf("Bad Team!\n"); } return 0;}
- HDU 6152-Friend-Graph(ccpc)
- hdu 6152 Friend-Graph(ccpc)
- HDU 6152 Friend-Graph(2017CCPC网络选拔赛)【Floyed求传递闭包】
- hdu5152.Friend-Graph(CCPC网络赛)
- 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 6152 Friend-Graph(定理)
- Hdu 6152 Friend-Graph(Ramsey定理)
- HDU 6152 Friend-Graph (最大团)
- HDU 6152 Friend-Graph(暴力)
- HDU-6152 Friend-Graph (思维+暴力)
- HDU 6152 Friend-Graph (CCPC2017)
- Bootstrap实例2---导航栏的实现
- IntelliJ Idea 快捷键列表
- Express hello world
- Android视频播放 的几种方式
- Unity1--生命周期函数和颜色配置
- HDU 6152-Friend-Graph(ccpc)
- 启用lumen的user token认证
- BZOJ[1367][Baltic2004]Sequence 可并堆
- Evaluate the value of an arithmetic expression in Reverse Polish Notation.
- 算法入门经典——果园里的树
- 23.odoo入门——工作杂记
- [12] LNMP架构
- A*算法浅析
- 并查集-总结