[백준 2991] 사나운 개

문제

https://www.acmicpc.net/problem/2991

2991번: 사나운 개

---

내가 작성한 코드

import java.io.*;
import java.util.StringTokenizer;

public class qor2991 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        StringTokenizer st = new StringTokenizer(br.readLine());
        int dog1Move = Integer.parseInt(st.nextToken());
        int dog1Break = Integer.parseInt(st.nextToken());

        int dog2Move = Integer.parseInt(st.nextToken());
        int dog2Break = Integer.parseInt(st.nextToken());

        int dog1 = dog1Move+dog1Break;
        int dog2 = dog2Move+dog2Break;

        StringTokenizer st2 = new StringTokenizer(br.readLine());
        for(int i = 0; i<3; i++){
            int count = 0;

            int people = Integer.parseInt(st2.nextToken());

            if(people%dog1<=dog1Move && people%dog1!=0){
                count++;
            }
            if(people%dog2<=dog2Move && people%dog2!=0){
                count++;
            }

            bw.write(Integer.toString(count));
            bw.newLine();
        }

        bw.close();
    }
}

나머지 개념을 도입해서 풀어봤는데 이거 말고 다른 풀이 방식이 있을까 궁금하다

다른 사람은 어떻게 풀었을까