解题思路:
找出每个数的质因子用map存起来,key存质因子,val则是存储最小下标。
后续如果发现相同的质因子,则枚举该数字出现的质因子找最小下标
参考代码:
import java.io.*; import java.util.ArrayList; import java.util.HashMap; import java.util.List; import java.util.Map; public class Main{ static BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out)); static int Inf = 0x7fffffff; public static void main(String[] args) throws IOException { int n = sc.nextInt(); int[] a = new int[n + 1]; for (int i = 1; i <= n; i++) a[i] = sc.nextInt(); Map<Integer, Integer> map = new HashMap<>(); int l = Inf, r = Inf; for (int i = 1; i <= n; i++) { List<Integer> list = new ArrayList<>(); int m = a[i]; for (int j = 2; j <= m / j; j++) { if (m % j == 0) { while (m % j == 0) { m /= j; } if (!map.containsKey(j)) { map.put(j, i); } else { map.put(j, Math.min(map.get(j), i)); list.add(j); } } } if (m > 1) { if (!map.containsKey(m)) { map.put(m, i); } else { map.put(m, Math.min(map.get(m), i)); list.add(m); } } if (!list.isEmpty()) { for (int x : list) { int val = map.get(x); if (l > val) { l = val; r = i; } } } } out.println(l + " " + r); out.close(); } static class sc { private static final StreamTokenizer input = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in))); public static int nextInt() throws IOException { input.nextToken(); return (int) input.nval; } } }
0.0分
3 人评分
C语言程序设计教程(第三版)课后习题4.9 (C语言代码)浏览:689 |
C语言程序设计教程(第三版)课后习题8.8 (C语言代码)浏览:588 |
C二级辅导-进制转换 (C语言代码)浏览:615 |
C语言程序设计教程(第三版)课后习题9.3 (Java代码)浏览:957 |
【绝对值排序】 (C++代码)浏览:672 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:636 |
C语言程序设计教程(第三版)课后习题8.8 (C语言代码)浏览:862 |
【蟠桃记】 (C语言代码)浏览:1024 |
有关字符,字符串的输入输出函数说明浏览:479 |
蛇行矩阵 (C语言代码)浏览:502 |