Computer Game
Sophia is playing a game on the computer. There are two random arrays A & B, each having the same number of elements. The game begins with Sophia removing a pair (Ai, Bj) from the array if they are not co-prime. She keeps a count on the number of times this operation is done.
Sophia wants to find out the maximal number of times(S) she can do this on the arrays. Could you help Sophia find the value?
Input Format
The first line contains an integer n. 2 lines follow, each line containing n numbers separated by a single space. The format is shown below.
n
A[0] A[1] ... A[n - 1]
B[0] B[1] ... B[n - 1]
Constraints
0 < n <= 105
2 <= A[i], B[i] <= 109
Each element in both arrays are generated randomly between 2 and 109
Output Format
Output S which is the maximum number of times the above operation can be made.
Sample Input
4
2 5 6 7
4 9 10 12
Sample Output
3
Explanation
You can remove:
(2, 4)
(5, 10)
(6, 9)
hence 3.
xxxxxxxxxxchar* readline();char* ltrim(char*);char* rtrim(char*);char** split_string(char*);int parse_int(char*);/* * Complete the 'computerGame' function below. * * The function is expected to return an INTEGER. * The function accepts following parameters: * 1. INTEGER_ARRAY a * 2. INTEGER_ARRAY b */int computerGame(int a_count, int* a, int b_count, int* b) {}int main(){ FILE* fptr = fopen(getenv("OUTPUT_PATH"), "w"); int n = parse_int(ltrim(rtrim(readline()))); char** a_temp = split_string(rtrim(readline())); int* a = malloc(n * sizeof(int)); for (int i = 0; i < n; i++) { int a_item = parse_int(*(a_temp + i)); *(a + i) = a_item; } char** b_temp = split_string(rtrim(readline())); int* b = malloc(n * sizeof(int)); for (int i = 0; i < n; i++) { int b_item = parse_int(*(b_temp + i)); *(b + i) = b_item; } int result = computerGame(n, a, n, b); fprintf(fptr, "%d\n", result); fclose(fptr); return 0;}char* readline() { size_t alloc_length = 1024; size_t data_length = 0; char* data = malloc(alloc_length); while (true) { char* cursor = data + data_length; char* line = fgets(cursor, alloc_length - data_length, stdin); if (!line) { break; } data_length += strlen(cursor); if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') { break; } alloc_length <<= 1; data = realloc(data, alloc_length); if (!data) { data = '\0'; break; } } if (data[data_length - 1] == '\n') { data[data_length - 1] = '\0'; data = realloc(data, data_length); if (!data) { data = '\0'; } } else { data = realloc(data, data_length + 1); if (!data) { data = '\0'; } else { data[data_length] = '\0'; } } return data;}char* ltrim(char* str) { if (!str) { return '\0'; } if (!*str) { return str; } while (*str != '\0' && isspace(*str)) { str++; } return str;}char* rtrim(char* str) { if (!str) { return '\0'; } if (!*str) { return str; } char* end = str + strlen(str) - 1; while (end >= str && isspace(*end)) { end--; } *(end + 1) = '\0'; return str;}char** split_string(char* str) { char** splits = NULL; char* token = strtok(str, " "); int spaces = 0; while (token) { splits = realloc(splits, sizeof(char*) * ++spaces); if (!splits) { return splits; } splits[spaces - 1] = token; token = strtok(NULL, " "); } return splits;}int parse_int(char* str) { char* endptr; int value = strtol(str, &endptr, 10); if (endptr == str || *endptr != '\0') { exit(EXIT_FAILURE); } return value;}