Studying Alphabet codechef solution in c++

 

Studying Alphabet Problem Code: ALPHABET

Submit

Read problems statements in Mandarin Chinese, Russian and Vietnamese as well.

Not everyone probably knows that Chef has younder brother Jeff. Currently Jeff learns to read.

He knows some subset of the letter of Latin alphabet. In order to help Jeff to study, Chef gave him a book with the text consisting of N words. Jeff can read a word iff it consists only of the letters he knows.

Now Chef is curious about which words his brother will be able to read, and which are not. Please help him!

Input

The first line of the input contains a lowercase Latin letter string S, consisting of the letters Jeff can read. Every letter will appear in S no more than once.

The second line of the input contains an integer N denoting the number of words in the book.

Each of the following N lines contains a single lowecase Latin letter string W_i, denoting the i^th word in the book.

Output

For each of the words, output "Yes" (without quotes) in case Jeff can read it, and "No" (without quotes) otherwise.

Constraints

• 1 ≤ |S| ≤ 26
• 1 ≤ N ≤ 1000
• 1 ≤ |W_i| ≤ 12
• Each letter will appear in S no more than once.
• S, W_i consist only of lowercase Latin letters.

Subtasks

• Subtask #1 (31 point): |S| = 1, i.e. Jeff knows only one letter.
• Subtask #2 (69 point) : no additional constraints

Example

Input:
act
2
cat
dog

Output:
Yes
No

Explanation

The first word can be read.

The second word contains the letters d, o and g that aren't known by Jeff.

solution

#include<iostream>
using namespace std;

int main()
{
	string s;
	cin >> s;
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		string le;
		cin >> le;
		int count = 0;
		for (int j = 0; j < s.length(); j++)
		{
			for (int k = 0; k < le.length(); k++)
			{
				if (s[j] == le[k])
					count++;
			}
		}
		if (count==le.size())
			cout << "Yes\n";
		else
			cout << "No\n";
	}

	return 0;
}