Submission #72598350

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>
int main(void) {
  int n;
  int soinsu[64], n_soinsu[64];
  int soinsu_cnt = 0;
  int i, m;
  if (scanf("%d", &n) != 1) return 1;
  /* 素因数分解をする */
  for (i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      soinsu[soinsu_cnt] = i;
      n_soinsu[soinsu_cnt] = 0;
      while (n % i == 0) {
        n_soinsu[soinsu_cnt]++;
        n /= i;
      }
      soinsu_cnt++;
    }
  }
  if (n > 1) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int main(void) {
	int n;
	int soinsu[64], n_soinsu[64];
	int soinsu_cnt = 0;
	int i, m;
	if (scanf("%d", &n) != 1) return 1;
	/* 素因数分解をする */
	for (i = 2; i * i <= n; i++) {
		if (n % i == 0) {
			soinsu[soinsu_cnt] = i;
			n_soinsu[soinsu_cnt] = 0;
			while (n % i == 0) {
				n_soinsu[soinsu_cnt]++;
				n /= i;
			}
			soinsu_cnt++;
		}
	}
	if (n > 1) {
		soinsu[soinsu_cnt] = n;
		n_soinsu[soinsu_cnt] = 1;
		soinsu_cnt++;
	}
	/* 下から素因数を削っていく */
	for (m = 2; ; m++) {
		int all_clear = 1;
		int oh = 1, oh_min = 0, oh_max = 0;
		int cur = m;
		for (i = 0; i < soinsu_cnt; i++) {
			while (n_soinsu[i] > 0 && cur % soinsu[i] == 0) {
				n_soinsu[i]--;
				cur /= soinsu[i];
			}
			all_clear = all_clear && n_soinsu[i] == 0;
			oh = oh && n_soinsu[i] <= 1;
			if (n_soinsu[i] == 1) {
				if (oh_min == 0) oh_min = soinsu[i];
				oh_max = soinsu[i];
			}
		}
		if (all_clear) {
			printf("%d\n", m);
			return 0;
		}
		if (oh && m < oh_min) {
			printf("%d\n", oh_max);
			return 0;
		}
	}
}

Submission Info

Judge Result