Submission #71265646

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>
#include <inttypes.h>
int inputs[26];
#define I(x) (inputs[(x) - 'A'])
int tiisakunaihou(int a, int b) {
  return a >= b ? a : b;
}
int ccnt = 0;
char candidates[1 << 9][9];
int cmp(const void* x, const void* y) {
  return strcmp(x, y);
}
#define CYCLE (59 * 61)
int ans_cnt = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int inputs[26];
#define I(x) (inputs[(x) - 'A'])

int tiisakunaihou(int a, int b) {
	return a >= b ? a : b;
}

int ccnt = 0;
char candidates[1 << 9][9];

int cmp(const void* x, const void* y) {
	return strcmp(x, y);
}

#define CYCLE (59 * 61)
int ans_cnt = 0;
int anses[CYCLE];

/* https://oeis.org/A000396 */
const int kanzensu[5] = { 6, 28, 496, 8128, 33550336 };

int main(void) {
	int i;
	for (i = 0; i < 26; i++) {
		if (scanf("%d", &inputs[i]) != 1) return 1;
	}
	printf("%d\n", I('A') - I('B'));
	printf("%d\n", I('C') + I('D'));
	printf("%d\n", tiisakunaihou(I('F') + 1 - I('E'), 0));
	printf("%d\n", (I('G') + I('H') + I('I') + 3) / 3);
	for (i = 1; i < (1 << 8); i++) {
		int j, cnt = 0;
		for (j = 0; j < 8; j++) {
			if ((i >> j) & 1) candidates[ccnt][cnt++] = "dagabaji"[j];
		}
		if (cnt == I('J')) ccnt++;
	}
	qsort(candidates, ccnt, sizeof(*candidates), cmp);
	puts(candidates[0]);
	for (i = 0; i < CYCLE; i++) {
		if (i % 59 == I('K') && i % 61 == I('L')) anses[ans_cnt++] = i;
	}
	if (ans_cnt == 0) {
		puts("null\nnull");
	} else {
		int idx = I('M') - (anses[0] != 0);
		int fav = anses[idx % ans_cnt] + CYCLE * (idx / ans_cnt);
		int fav2 = 0;
		for (i = 0; i < 5; i++) {
			if (abs(kanzensu[i] - fav) >= I('N')) {
				fav2 = kanzensu[i];
				break;
			}
		}
		if (fav < fav2) {
			printf("%d\n%d\n", fav, fav2);
		} else {
			printf("%d\n%d\n", fav2, fav);
		}
	}
	printf("%d\n",
		((I('O') + I('P') + I('Q')) * (I('R') + I('S') + I('T')) % 9973) *
		((I('U') + I('V') + I('W')) * (I('X') + I('Y') + I('Z')) % 9973) % 9973
	);
	return 0;
}

Submission Info

Judge Result