[summer daily question] Luogu p6320 [coci2006-2007 4] sibice

Topic link ：P6320 [COCI2006-2007#4] SIBICE - Luogu | New ecology of computer science education (luogu.com.cn)

Background

Beardless Mirko Throw matches everywhere . His mother wanted him to put the matches in the box .

Title Description

Mirko Now I want to place n  A match , He has one w×h  Rectangular box .

He now wants you to judge this n  Whether each match can be put into this box .

We can think of the box as a plane , Just judge whether the match can be put down in this plane .

Input format

Enter the first three integers n,w,h.

Next n  That's ok , Each row of a [1,1000]  An integer in an interval , Indicates the length of a match .

Output format

The output, n  That's ok , For each match , Output DA  It means it can be put down , Otherwise output NE  Can't put down .

Examples #1

The sample input #1

5 3 4
3
4
5
6
7

Sample output #1

DA
DA
DA
NE
NE

Examples #2

The sample input #2

2 12 17
21
20

Sample output #2

NE
DA

Tips

Data scale and agreement

about 100%  The data of , Guarantee 1 <= n <= 50,1 <= w,h <= 100.

explain

The title is translated from  COCI2006-2007 CONTEST #4 T1 SIBICE

AC code:

#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

int main()
{
	int n;
	cin>>n;
	int a,b;
	cin>>a>>b;
	double c; //  Diagonal length 
	c=sqrt(a*a+b*b); 
	while(n--)
	{
		int x;
		cin>>x;
		if(x<=c)
			cout<<"DA"<<endl;
		else
			cout<<"NE"<<endl;
	}
	
	return 0;
}