Submission #69793178

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 <inttypes.h>
int cmp(const void* x, const void* y) {
  uint64_t a = *(const uint64_t*)x, b = *(const uint64_t*)y;
  return a < b ? -1 : a > b;
}
int kore;
int sore[114514];
uint64_t are[114514];
int ans_cnt;
uint64_t* ans;
void sumipe(int pos, uint64_t cur) {
  if (pos >= kore) {
    ans[ans_cnt++] = cur;
  } else {
    int i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

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

int kore;
int sore[114514];
uint64_t are[114514];

int ans_cnt;
uint64_t* ans;

void sumipe(int pos, uint64_t cur) {
	if (pos >= kore) {
		ans[ans_cnt++] = cur;
	} else {
		int i;
		for (i = 0; i <= sore[pos]; i++) {
			sumipe(pos + 1, cur);
			cur *= are[pos];
		}
	}
}

int main(void) {
	uint64_t X, Y;
	uint64_t asumisu, mizuhasu;
	uint64_t i;
	int num, j;
	if (scanf("%" SCNu64 "%" SCNu64, &X, &Y) != 2) return 1;
	/* GCD */
	asumisu = X - 2015;
	mizuhasu = Y - 2015;
	while (mizuhasu > 0) {
		uint64_t kitaeri = asumisu % mizuhasu;
		asumisu = mizuhasu;
		mizuhasu = kitaeri;
	}
	/* 素因数分解 */
	for (i = 2; i * i <= asumisu; i++) {
		if (asumisu % i == 0) {
			are[kore] = i;
			while (asumisu % i == 0) {
				sore[kore]++;
				asumisu /= i;
			}
			kore++;
		}
	}
	if (asumisu > 1) {
		are[kore] = asumisu;
		sore[kore] = 1;
		kore++;
	}
	/* 答えの数を計算 */
	num = 1;
	for (j = 0; j < kore; j++) {
		num *= sore[j] + 1;
	}
	/* 答えを求める */
	ans = malloc(sizeof(*ans) * num);
	if (ans == NULL) return 2;
	sumipe(0, 1);
	qsort(ans, ans_cnt, sizeof(*ans), cmp);
	for (j = 0; j < ans_cnt; j++) {
		printf("%" PRIu64 "\n", ans[j]);
	}
	return 0;
}

Submission Info

Judge Result