当前位置:网站首页>末日将至(简单计算几何)
末日将至(简单计算几何)
2022-04-21 06:21:00 【Bzdhxs_nt】
思路
简单计算几何
读题!
double a,b,k,k1;
Point p[100005];
bool check(int i){
if(p[i].y- (p[i].x-a)*k1-b > eps) return true;
return false;
}
void solve(){
cin >>a>>b>>n>>k;
forr(i,1,n){
cin>>p[i].x>>p[i].y;
}
k1 = b/a;
k1 = sin(atan(k1));
k1 /= k;
k1 = tan(asin(k1));
forr(i,1,n){
if(check(i)){
puts("NO");
return;
}
}
puts("YES");
}
signed main()
{
int t;cin>>t;
while(t--) solve();
return 0;
}
版权声明
本文为[Bzdhxs_nt]所创,转载请带上原文链接,感谢
https://blog.csdn.net/qq_51687628/article/details/124244312
边栏推荐
猜你喜欢
随机推荐
[WPF] notes
JDBC simple implementation of student management system
mysql与oracle的区别小总结
【LeetCode 19】删除链表的倒数第 N 个结点
3. 事务和视图
This site cannot provide a secure connection. An unsupported protocol is used
微信小程序request封装
Build your own blog
3. Date command problem in bat
Write tweets for one year and share five commonly used writing software
Linux启动MySQL报错
Making books with bookdown
[SSM integration] 1 Basic environment construction
Reproduce the 3D density function diagram in the top issue of SCI
TP下载文件夹,压缩文件夹并下载
The jupyter notebook of win10 uses pyspark 2 3.2 error reporting problems solved
记录tx2上安装配置gestermer进而使用gst-rtsp-server
完全清理mysql-win
学习笔记-最长子序列,最大子方块
用JS函數形式實現一個Array.prototype.forEach(),.map(),.filter()








