Card game

#include <iostream>
#include <string>
#include <vector>
#include <math.h>

unsigned int simple_hash(std::string str, unsigned int A, unsigned int B){
	unsigned int l = str.length(), hash = 0;
	for(unsigned int i = 0; i < l; i++){
		hash += str[i] * pow(A, (l - i - 1));
		hash %= B;
	}
	return hash;
}

void string_hash_preprocessing(std::string str, unsigned int* h, unsigned int* p, unsigned int A, unsigned int B){
	unsigned int l = str.length();
	h[0] = str[0];
	p[0] = 1;
	for(unsigned int i = 1; i < l; i++){
		h[i] = (h[i - 1] * A + str[i]) % B;
		p[i] = (p[i - 1] * A) % B;
	}
}

unsigned int hash(unsigned int* h, unsigned int* p, unsigned int B,  unsigned int a, unsigned int b){
	if(a == 0){
		return h[b];
	}
	return (h[b] + B - (h[a - 1] * p[b - a + 1]) % B) % B;
}

int main(){
	std::string str;
	std::cin >> str;

	unsigned int n;
	std::cin >> n;

	std::vector<std::string> names;
	for(unsigned int i = 0; i < n; i++){
		std::string name;
		std::cin >> name;
		names.push_back(name);
	}

	const unsigned int l = str.length();
	unsigned int* h = (unsigned int*)malloc(l * sizeof(unsigned int));
	unsigned int* p = (unsigned int*)malloc(l * sizeof(unsigned int));
	const unsigned int A = 3;
	const unsigned int B = 97;

	string_hash_preprocessing(str, h, p, A, B);

	int results[n];
	for(unsigned int i = 0; i < n; i++){
		results[i] = -1;
	}

	for(unsigned int i = 0; i < n; i++){
		if(results[i] == -1){
			unsigned int name_length = names[i].length();

			unsigned int* hashes = (unsigned int*)malloc((l - name_length + 1) * sizeof(unsigned int));
			for(unsigned int j = 0; j < l - name_length + 1; j++){
				hashes[j] = hash(h, p, B, j, j + name_length - 1);
				//std::cout << " hash (" << j << "," << j + name_length << ") = " << hashes[j] << "\n";
			}

			for(unsigned int j = i; j < n; j++){
				if(names[j].length() == name_length){
					results[j] = 0;
					unsigned int my_hash = simple_hash(names[j], A, B);
					//std::cout << "my_hash=" << my_hash << "\n";

					for(unsigned int k = 0; k < l - name_length + 1; k++){
						if(my_hash == hashes[k]){
							bool real_mathch = true;
							for(unsigned int x = 0; x < name_length; x++){
								if(names[j][x] != str[k + x]){
									real_mathch = false;
								}
							}
							if(real_mathch){
								results[j] = 1;
								break;
							}
						}
					}
				}
			}
		}
	}


	for(unsigned int i = 0; i < n; i++){
		std::cout << (results[i] == 1 ? "YES" : "NO") << "\n";
	}
	
	return 0;
}

Test 1

Verdict: UNKNOWN

Test 2

Verdict: UNKNOWN

Test 3

Verdict: UNKNOWN

Test 4

Verdict: UNKNOWN

Test 5

Verdict: UNKNOWN

Test 6

Verdict: UNKNOWN

Test 7

Verdict: UNKNOWN

Test 8

Verdict: UNKNOWN

Test 9

Verdict: UNKNOWN

Test 10

Verdict: UNKNOWN

Test 11

Verdict: UNKNOWN

Test 12

Verdict: UNKNOWN

Test 13

Verdict: UNKNOWN

Test 14

Verdict: UNKNOWN

Test 15

Verdict: UNKNOWN

Test 16

Verdict: UNKNOWN

Test 17

Verdict: UNKNOWN

Test 18

Verdict: UNKNOWN