[SWEA] 8457. 알 덴테 스파게티_JAVA

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWzal4EKksEDFAVU&categoryId=AWzal4EKksEDFAVU&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=6 

SW Expert Academy

 

 

import java.util.Scanner;

public class N8457 {
        public static void main(String args[]) throws Exception{
            Scanner sc = new Scanner(System.in);
            int T;
            T=sc.nextInt();
            for(int test_case = 1; test_case <= T; test_case++) {
                int n=sc.nextInt();
                int b=sc.nextInt();
                int e=sc.nextInt();
                int cnt=0;
                for(int j=0;j<n;j++){
                    int x=sc.nextInt();
                    for(int i=b-e;i<=b+e;i++){
                        if(i%x==0){
                            cnt++;
                            break;
                        }
                    }
                }
                System.out.println("#"+test_case+" "+cnt);
            }
        }
}

나머지 연산으로 배수를 찾는다.