pku acm 1005
2011-08-20 19:14
183 查看
#include <iostream> #include <cmath> using namespace std; const float PI = 3.1515926; const int AREA = 50; int year(float x,float y) { x = fabs(x); int k = 0; int area;//面积 float r;//半径 float dis = sqrt(pow(x,2)+pow(y,2)); for(k = 1;; k++) { r = sqrt((k*AREA*2*1.0)/PI); if(r > dis)break; } return k; } int main() { int count; float x,y; freopen("in.txt","r",stdin); cin>>count; int k = 1; while(k <= count) { cin>>x>>y; cout<<"Property "<<k<<": This property will begin eroding in year "<<year(x,y)<<"."<<endl; k++; } cout<<"END OF OUTPUT."<<endl; return 0; }
测试数据如下:
3
1.0 1.0
25.0 0.0
-25.0 0.0
相关文章推荐
- POJ 1005I Think I Need a Houseboat解题报告——【PKU ACM】
- pku acm 1005 解题报告
- ACM 1005. 数独
- 杭电acm 1005
- 杭电ACM 1005:Number Sequence
- 2017 ACM/ICPC Asia Regional Shenyang Online 1005 number number number(矩阵快速幂)
- pku 1005
- 聪明的打字员 -- ACM PKU 1184 解题报告
- ACM基本算法分类、推荐学习资料和配套pku习题
- PKU ACM 1002 487-3279 C++实现
- PKU_1005_I Think I Need a Houseboat
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2528 成段更新,区间统计颜色的种类(离散化处理线段)
- PKU JudgeOnline FAQ 中文版 【ACM判题系统常见问题】
- acm pku 1258 Agri-Net的Prim算法实现
- PKU ACM 1164 源代码
- ACM 多重背包 pku 1276
- 【ACM】hdu_zs3_1005_String Matching_201308100920
- pku acm 2488 源码
- ACM 1000 1003 1004 1005 1006
- Pku ACM 1002