8
import java.util.ArrayList; import java.util.Scanner; public class XingYunShu { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int m = scanner.nextInt(); int n = scanner.nextInt(); int k = 1; int luck = 2; ArrayList<Integer> link = new ArrayList<Integer>(); for (int i = 0; i < n; i++) { link.add(i + 1); } while (luck <= link.size()) { for (int j = 1; j <= link.size(); j++) { if (j % luck == 0) { link.set(j - 1, 0); } } for (int j = 0; j < link.size(); j++) { if ((link.get(j)) == 0) { link.remove(j); } } luck = link.get(k++); } int count = 0; for (int i = 0; i < link.size(); i++) { if ( link.get(i) > m && link.get(i) < n) { count++; } } System.out.println(count); } }
原文:http://blog.csdn.net/xurunhong/article/details/23670997