[SW Expert Academy] 알 덴테 스파게티 (D3)

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

SW Expert Academy

 

방법2

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			int n = sc.nextInt();
			int b = sc.nextInt();
			int e = sc.nextInt();
			int result = 0;

			for (int i = 0; i < n; i++) {

				int sand = sc.nextInt();

				for (int j = b - e; j <= b + e; j++) {
					if (j % sand == 0) {
						result++;
						break;
					}
				}

			}

			System.out.println("#" + tc + " " + result);
		}

	}
}

 

방법1

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int t = sc.nextInt();
		
		for(int tc=1;tc<=t;tc++) {
			int n = sc.nextInt();
			int b = sc.nextInt();
			int e = sc.nextInt();
			boolean isPossible=false;
			int result=0;
			
			for(int i=0;i<n;i++) {
				
				isPossible=false;
				
				int sand = sc.nextInt();
				
				int idx=1;
				
				int ans=sand*idx;
				
				while(ans<=b+e) {
					if(ans>=b-e&&ans<=b+e) {
						isPossible=true;
						break;
					}
					
					ans = sand*idx++;
				}
				
				if(isPossible) {
					result++;
				}
				
			}
			
			System.out.println("#"+tc+" "+result);
		}
		
		
	}
}