提出 #14868366

---

ソースコード 拡げる

#include <stdio.h>

int sum[33], binom[33][33], rem[33][100003] = {};

void merge_sort(int x[], int n)
{
	static int y[33] = {};
	if (n <= 1) return;
	merge_sort(&(x[0]), n/2);
	merge_sort(&(x[n/2]), (n+1)/2);
	
	int i, p, q;
	for (i = 0, p = 0, q = n/2; i < n; i++) {
		if (p >= n/2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p] < x[q])? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

int recursion(int w[], int n, int X)
{
	if (X == 0 || sum[n] == X) return 1;
	else if (n == 0 || sum[n] < X || w[0] > X || rem[n][X%100003] == 0) return 0;
	else if (w[n-1] > X) return recursion(w, n - 1, X);
	else if (w[n-1] != w[n-2]) return recursion(w, n - 1, X - w[n-1]) + recursion(w, n - 1, X);
	
	int i, j, ans = 0;
	for (i = 2; i <= n && w[n-i] == w[n-1]; i++);
	for (j = 0; j < i; j++) ans += recursion(w, n - i + 1, X - w[n-1] * j) * binom[i-1][j];
	return ans;
}

int main()
{
	int i, j, N, X, w[33];
	scanf("%d %d", &N, &X);
	for (i = 0; i < N; i++) scanf("%d", &(w[i]));
	merge_sort(w, N);
	for (i = 0, sum[0] = 0; i < N; i++) sum[i+1] = sum[i] + w[i];
	for (i = 0; i <= N; i++) {
		binom[i][0] = 1;
		binom[i][i] = 1;
		for (j = 1; j < i; j++) binom[i][j] = binom[i-1][j-1] + binom[i-1][j];
	}
	for (i = 0, rem[0][0] = 1; i < N; i++) {
		for (j = 0; j < 100003; j++) {
			rem[i+1][j] |= rem[i][j];
			rem[i+1][(j+w[i])%100003] |= rem[i][j];
		}
	}
	printf("%d\n", recursion(w, N, X));
	fflush(stdout);
	return 0;
}

提出情報

コンパイルエラー

./Main.c: In function ‘main’:
./Main.c:37:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   37 |  scanf("%d %d", &N, &X);
      |  ^~~~~~~~~~~~~~~~~~~~~~
./Main.c:38:26: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   38 |  for (i = 0; i < N; i++) scanf("%d", &(w[i]));
      |                          ^~~~~~~~~~~~~~~~~~~~

ジャッジ結果