A. Bear and Three Balls CodeForces 653A
2016-08-22 20:22
477 查看
Limak is a little polar bear. He has n balls, the i-th ball has size ti.
Limak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy:
No two friends can get balls of the same size.
No two friends can get balls of sizes that differ by more than 2.
For example, Limak can choose balls with sizes 4, 5 and 3, or balls with sizes 90, 91 and 92. But he can't choose balls with sizes 5, 5 and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 30, 31 and 33 (because sizes 30
and 33 differ by more than 2).
Your task is to check whether Limak can choose three balls that satisfy conditions above.
Input
The first line of the input contains one integer n (3 ≤ n ≤ 50) — the number of balls Limak has.
The second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 1000) where ti denotes the size of the i-th ball.
Output
Print "YES" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print "NO" (without quotes).
Examples
input
4
18 55 16 17
output
YES
input
6
40 41 43 44 44 44
output
NO
input
8
5 972 3 4 1 4 970 971
output
YES
Note
In the first sample, there are 4 balls and Limak is able to choose three of them to satisfy the rules. He must must choose balls with sizes 18, 16 and 17.
In the second sample, there is no way to give gifts to three friends without breaking the rules.
In the third sample, there is even more than one way to choose balls:
Choose balls with sizes 3, 4 and 5.
Choose balls with sizes 972, 970, 971.
题意:就是有三个朋友,你要从多个求里面选三个球分给他们,要求是三个球之间不能差超过2,也不能一样大小
思路:三个for循环
#include<cstdio>
int main()
{
int n,flag,b,c,d,i,j,k;
int a[1005];
scanf("%d",&n);
flag=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
for(k=j+1;k<n;k++)
{
b=a[i]-a[j];
if(b<0) b=-b;
c=a[j]-a[k];
if(c<0) c=-c;
d=a[k]-a[i];
if(d<0) d=-d;
if(b<=2&&c<=2&&d<=2&&a[i]!=a[j]&&a[j]!=a[k]&&a[k]!=a[i])
{
flag=1;
break;
}
}
}
}
if(flag==1) printf("YES");
else printf("NO");
return 0;
}
Limak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy:
No two friends can get balls of the same size.
No two friends can get balls of sizes that differ by more than 2.
For example, Limak can choose balls with sizes 4, 5 and 3, or balls with sizes 90, 91 and 92. But he can't choose balls with sizes 5, 5 and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 30, 31 and 33 (because sizes 30
and 33 differ by more than 2).
Your task is to check whether Limak can choose three balls that satisfy conditions above.
Input
The first line of the input contains one integer n (3 ≤ n ≤ 50) — the number of balls Limak has.
The second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 1000) where ti denotes the size of the i-th ball.
Output
Print "YES" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print "NO" (without quotes).
Examples
input
4
18 55 16 17
output
YES
input
6
40 41 43 44 44 44
output
NO
input
8
5 972 3 4 1 4 970 971
output
YES
Note
In the first sample, there are 4 balls and Limak is able to choose three of them to satisfy the rules. He must must choose balls with sizes 18, 16 and 17.
In the second sample, there is no way to give gifts to three friends without breaking the rules.
In the third sample, there is even more than one way to choose balls:
Choose balls with sizes 3, 4 and 5.
Choose balls with sizes 972, 970, 971.
题意:就是有三个朋友,你要从多个求里面选三个球分给他们,要求是三个球之间不能差超过2,也不能一样大小
思路:三个for循环
#include<cstdio>
int main()
{
int n,flag,b,c,d,i,j,k;
int a[1005];
scanf("%d",&n);
flag=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
for(k=j+1;k<n;k++)
{
b=a[i]-a[j];
if(b<0) b=-b;
c=a[j]-a[k];
if(c<0) c=-c;
d=a[k]-a[i];
if(d<0) d=-d;
if(b<=2&&c<=2&&d<=2&&a[i]!=a[j]&&a[j]!=a[k]&&a[k]!=a[i])
{
flag=1;
break;
}
}
}
}
if(flag==1) printf("YES");
else printf("NO");
return 0;
}
相关文章推荐
- Bear and Three Balls CodeForces - 653A
- codeforces IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) A. Bear and Three Balls
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2) B. Bear and Three Musketeers(STL_暴力)
- 【CodeForces - 653A】Bear and Three Balls(sort)
- 【Codeforces】-653A-Bear and Three Balls
- codeforeceIndiaHacks 2016 - Online Edition (Div. 1 + Div. 2)A. Bear and Three Balls
- 【codeforces 653A】Bear and Three Balls
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2)——B纯暴力——Bear and Three Musketeers
- 【CodeForces】653A - Bear and Three Balls(计数)
- 【CodeForces】[653A]Bear and Three Balls
- Educational Codeforces Round 8 F. Bear and Fair Set 最大流
- Codeforces Round #309 (Div. 2) C. Kyoya and Colored Balls
- [线段树][矩乘][DP]Codeforces Round 573D && RussianCodeCup Thanks-Round .Bear and Cavalry
- Bear and Elections CodeForces - 574A(优先队列)
- 【codeforces】Bear and Three Balls(排序,去重)
- Educational Codeforces Round 31 D. Boxes And Balls
- Codeforces Round #158 (Div. 2)C. Balls and Boxes(模拟)
- CodeForces 653 A. Bear and Three Balls——(IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2))
- Codeforces Round #195 (Div. 2) A. Vasily the Bear and Triangle
- codeforces#233_div2_B Red and Blue Balls