排队
题目链接: http://oj.csen.org.cn/contest/3/8#
题目描述:
解题思路:
- 暴力解题,将队伍放入ArrayList的数组里,然后遍历窗口的值,通过取模的方式确定ArrayList要被带出的人,然后输出遍历完毕后ArrayList的size()。
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sca = new Scanner(System.in);
int nlength = sca.nextInt();
int mlength = sca.nextInt();
int [] marr = new int[mlength];
for (int i = 0; i < mlength; i++) {
marr[i] = sca.nextInt();
}
sca.close();
ArrayList <Integer> narr =new ArrayList <>();
for (int i = 1;i <= nlength;i++) {
narr.add(i);
}
for (int i = 0;i< marr.length;i++) {
for (int j = 0; j < narr.size(); j++) {
if(narr.get(j) % marr[i] ==0) {
narr.remove(j);
}
}
}
System.out.println(narr.size());
}
}