653A - Bear and Three Balls - CodeForces Solution

brute force implementation sortings *900

Please click on ads to support us..

Python Code: 

n=int(input().split(" ")[0])
dls=input().split(" ")
bls=list()
for i in range(0,n):
    bls.append(int(dls[i]))
for i in bls:
    for j in bls:
        for k in bls:
            y=sorted([i,j,k])
            if y[1]-y[0]==y[2]-y[1]==1:
                print("YES")
                exit(0)
print("NO")

C++ Code: 

#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;
int t[51],fr[1001];
int main()
{
    int n,ok;
    cin>>n;
    for(int i=1; i<=n; ++i){
        cin>>t[i];
        fr[t[i]]++;}
    ok=0;
    for(int i=1; i<=1000; ++i){
        if((fr[i] != 0) && (fr[i+1] != 0) && (fr[i+2] != 0))
            ok=1;}
    if(ok == 1)
        cout<<"YES";
       else
        cout<<"NO";
    return 0;
}


Comments

Submit
0 Comments
More Questions

1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
501A - Contest
160A- Twins
752. Open the Lock
1535A - Fair Playoff
1538F - Interesting Function
1920. Build Array from Permutation
494. Target Sum
797. All Paths From Source to Target
1547B - Alphabetical Strings
1550A - Find The Array
118B - Present from Lena
27A - Next Test
785. Is Graph Bipartite
90. Subsets II
1560A - Dislike of Threes
36. Valid Sudoku
557. Reverse Words in a String III
566. Reshape the Matrix
167. Two Sum II - Input array is sorted
387. First Unique Character in a String
383. Ransom Note
242. Valid Anagram
141. Linked List Cycle
21. Merge Two Sorted Lists
203. Remove Linked List Elements
733. Flood Fill
206. Reverse Linked List
83. Remove Duplicates from Sorted List
116. Populating Next Right Pointers in Each Node