Competitive-Programming-Problem-Solutions/QuickBrownFox.cpp at master · ahochheiden/Competitive-Programming-Problem-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <iostream>
#include <string>
#include <cctype>

using namespace std;

const int tableSize = 26;
const char lowerA = 'a';

bool table[tableSize];

void reset()
{
	for(int i = 0; i < tableSize; i++)
	{
		table[i] = false;
	}
}

void answer()
{
	bool isPangram = true;
	string answer = "";

	for(int i = 0; i < tableSize; i++)
	{
		if(table[i])
		{
			continue;
		}
		else
		{
			isPangram = false;
		}

		if(isPangram)
		{
			continue;
		}
		else
		{
			answer += static_cast<char>('a' + i);
		}
	}

	if(isPangram)
	{
		cout << "pangram" << endl;
	}
	else
	{
		cout << "missing " << answer << endl;
	}

}

int main()
{
	int count = 0;

	cin >> count;

	string garbage = "";

	getline(cin, garbage);

	string line = "";

	for(int i = 0; i < count; i++)
	{
		reset();

		getline(cin, line);

		for(int j = 0; j < line.size(); j++)
		{
			char character = line[j];

			if(isalpha(character))
			{
				table[tolower(character) - 'a'] = true;
			}
		}

		answer();
	}

	return 0;
}