Submission #74212158

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int cmp(const void* x, const void* y) {
  int a = *(const int*)x, b = *(const int*)y;
  return (a > b) - (a < b);
}
int n;
int k;
char seisuu[16][8];
int cnt = 0;
int tukuru[114514];
void meow(const char* cur, int left, int used) {
  if (left <= 0) {
    tukuru[cnt++] = atoi(cur);
  } else {
    int i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	return (a > b) - (a < b);
}

int n;
int k;
char seisuu[16][8];

int cnt = 0;
int tukuru[114514];

void meow(const char* cur, int left, int used) {
	if (left <= 0) {
		tukuru[cnt++] = atoi(cur);
	} else {
		int i;
		char next[16], *pend;
		strcpy(next, cur);
		pend = next + strlen(next);
		for (i = 0; i < n; i++) {
			if (((used >> i) & 1) == 0) {
				strcpy(pend, seisuu[i]);
				meow(next, left - 1, used | (1 << i));
			}
		}
	}
}

int main(void) {
	int i;
	int ans = 0;
	if (scanf("%d", &n) != 1) return 1;
	if (scanf("%d", &k) != 1) return 1;
	for (i = 0; i < n; i++) {
		if (scanf("%7s", seisuu[i]) != 1) return 1;
	}
	meow("", k, 0);
	qsort(tukuru, cnt, sizeof(*tukuru), cmp);
	for (i = 0; i < cnt; i++) {
		if (!(i > 0 && tukuru[i - 1] == tukuru[i])) ans++;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result