BOJ 3052 나머지(C++)

#define _CRT_SECURE_NO_WARNINGS
#include    <iostream>
#include	<math.h>
#include	<stdlib.h>
using namespace std;


int main()
{
	int val;
	int remain[42];
	int result = 0;
	for (int i = 0; i < 42; ++i)
	{
		remain[i] = 0;
	}
	for (int i = 0; i < 10; ++i)
	{
		scanf("%d", &val);
		remain[val % 42] += 1;
	}


	for (int i = 0; i < 42; ++i)
	{
		if (remain[i] != 0)
			result++;
	}
	
	printf("%d\n", result);




	return 0;
}

1차원 배열도 거의 다 해결. 마지막 한 문제 남았다.