868A - Bark to Unlock - CodeForces Solution

brute force implementation strings *900

Please click on ads to support us..

Python Code: 


key = input()
k = int(input())

words = []

for _ in range(k):
	words.append(input())


for i in range(k):
	for j in range(k):
		if key in (words[i] + words[j]):
			print('YES')
			exit(0)
print('NO')

C++ Code: 

#include<bits/stdc++.h>

#define dbg printf("in\n");
#define nl printf("\n");

using namespace std;

int main()
{
   // freopen("in.txt","r",stdin);

    int i,j,k;
    int n;
    string p;

    cin>>p>>n;

    string s[n];
    for(i=0;i<n;i++)
    {
        cin>>s[i];

        if(s[i]==p)
        {
            cout<<"YES";
            return 0;
        }
    }

    k=1;
    for(i=0;i<n;i++)
    {
        if(s[i][1]==p[0])
        {
            k=0;break;
        }
    }

    if(k)
    {
        cout<<"NO";
        return 0;
    }

    for(i=0;i<n;i++)
    {
        if(p[1]==s[i][0])
        {
            cout<<"YES";
            return 0;
        }
    }

    cout<<"NO";

    return 0;
}


Comments

Submit
0 Comments
More Questions

158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets
96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters
1478B - Nezzar and Lucky Number
228A - Is your horseshoe on the other hoof
122A - Lucky Division
1611C - Polycarp Recovers the Permutation
432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game
1560C - Infinity Table
1605C - Dominant Character