Hackerrank | Divisible Sum Pairs

133210·2021년 7월 26일
0

2020 문제풀이

목록 보기
7/14
post-thumbnail

https://www.hackerrank.com/challenges/divisible-sum-pairs/problem

Problem

Code

차례로 더해서 k로 나누어 떨어지면 count++

#include <assert.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define STACK_SIZE 100

char* readline();
char** split_string(char*);

// Complete the divisibleSumPairs function below.
int divisibleSumPairs(int n, int k, int ar_count, int* ar) {
	int count = 0;

	for (int i = 0; i < ar_count; i++)
	{
		for (int j = 0; j < i; j++)
			if ((ar[i] + ar[j]) % k == 0)
				count++;
	}

	return count;
}

int main()
{
	FILE* fptr = fopen(getenv("OUTPUT_PATH"), "w");

	char** nk = split_string(readline());

	char* n_endptr;
	char* n_str = nk[0];
	int n = strtol(n_str, &n_endptr, 10);

	if (n_endptr == n_str || *n_endptr != '\0') { exit(EXIT_FAILURE); }

	char* k_endptr;
	char* k_str = nk[1];
	int k = strtol(k_str, &k_endptr, 10);

	if (k_endptr == k_str || *k_endptr != '\0') { exit(EXIT_FAILURE); }

	char** ar_temp = split_string(readline());

	int* ar = malloc(n * sizeof(int));

	for (int i = 0; i < n; i++) {
		char* ar_item_endptr;
		char* ar_item_str = *(ar_temp + i);
		int ar_item = strtol(ar_item_str, &ar_item_endptr, 10);

		if (ar_item_endptr == ar_item_str || *ar_item_endptr != '\0') { exit(EXIT_FAILURE); }

		*(ar + i) = ar_item;
	}

	int ar_count = n;

	int result = divisibleSumPairs(n, k, ar_count, ar);

	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; }

		size_t new_length = alloc_length << 1;
		data = realloc(data, new_length);

		if (!data) { break; }

		alloc_length = new_length;
	}

	if (data[data_length - 1] == '\n') {
		data[data_length - 1] = '\0';
	}

	data = realloc(data, data_length);

	return data;
}

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;
}

Result

0개의 댓글