문제 풀이 및 개발 공간

[백준] 1004번 어린 왕자 문제! (silver 3 본문

백준공부/java

[백준] 1004번 어린 왕자 문제! (silver 3

gomduri43 2022. 8. 25. 21:37

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;

public class Main{

	public static void main(String[] args) throws IOException {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
		int t=Integer.parseInt(br.readLine());
		StringTokenizer st;
		for(int i=0; i<t; i++) {
			int sum=0;
			st=new StringTokenizer(br.readLine());
			int x1=Integer.parseInt(st.nextToken());
			int y1=Integer.parseInt(st.nextToken());
			int x2=Integer.parseInt(st.nextToken());
			int y2=Integer.parseInt(st.nextToken());

			int n=Integer.parseInt(br.readLine());
			for(int j=0; j<n; j++) {
				st=new StringTokenizer(br.readLine());
				int cx=Integer.parseInt(st.nextToken());
				int cy=Integer.parseInt(st.nextToken());
				int r=Integer.parseInt(st.nextToken());

				if(Math.pow(cx-x1, 2)+Math.pow(cy-y1, 2)<Math.pow(r, 2)) {
					if(Math.pow(cx-x2,2)+Math.pow(cy-y2, 2)<Math.pow(r, 2)) {
						sum--;
					}
					sum++;
				}
				else if(Math.pow(cx-x2,2)+Math.pow(cy-y2, 2)<Math.pow(r, 2)) {
					sum++;
				}

			}
			bw.write(sum+"\n");
		}
		bw.flush();
	}			
}