uva 375(数学)
2014-07-19 17:38
387 查看
题解:在一个等腰三角形内找到内切圆半径,如果小于精度0.000001,就将底平移到内切圆上面找下一个内切圆,直到精度达到0.000001,这些内切圆的周长的和就是输出结果。
#include <stdio.h>
#include <math.h>
double sum = 0;
void count(double d, double h) {
double d1 = d / 2;
double temp = sqrt(h * h + d1 * d1);
double r = (h * d) / (d + 2 * temp);
if (r < 0.000001)
return;
else {
sum += r * 2 * M_PI;
double h1 = h - 2 * r;
double d1 = d * h1 / h;
count(d1, h1);
}
}
int main() {
int t;
double d, h, a;
scanf("%d", &t);
while (t--) {
scanf("%lf%lf", &d, &h);
sum = 0;
count(d, h);
printf("%13.6lf\n", sum);
if (t)
printf("\n");
}
return 0;
}
#include <stdio.h>
#include <math.h>
double sum = 0;
void count(double d, double h) {
double d1 = d / 2;
double temp = sqrt(h * h + d1 * d1);
double r = (h * d) / (d + 2 * temp);
if (r < 0.000001)
return;
else {
sum += r * 2 * M_PI;
double h1 = h - 2 * r;
double d1 = d * h1 / h;
count(d1, h1);
}
}
int main() {
int t;
double d, h, a;
scanf("%d", &t);
while (t--) {
scanf("%lf%lf", &d, &h);
sum = 0;
count(d, h);
printf("%13.6lf\n", sum);
if (t)
printf("\n");
}
return 0;
}
相关文章推荐
- uva 11461 数学
- uva 10161 Ant on a Chessboard 蛇形矩阵 简单数学题
- uva 10161 Ant on a Chessboard 蛇形矩阵 简单数学题
- Uva 11752 The Super Powers 解题报告(数学)
- UVA 375 Inscribed Circles and Isosceles Triangles
- 数学专项matrix:UVa 11149
- 数学专项counting:UVa 10128
- 【数学期望】Candy, ACM/ICPC Chengdu 2012, UVa1639 【精度】
- UVA11005 Cheapest Base【数学】
- UVA 11027 Palindromic Permutation(组合数学)
- Uva 375 - Inscribed Circles and Isosceles Triangles
- UVA1363 - Joseph's Problem(数学,迷之优化)
- UVA&&POJ离散概率与数学期望入门练习[4]
- 数学题uva107-The Cat in the Hat
- [UVA 107] The Cat int the Hat 数学公式和细节啊细节
- UVA 10883 - Supermean(组合数学+数值优化)
- uva 645(数学)
- UVALive 7040 Color (容斥原理 + 组合数学递推公式 + 求逆元 + 基础数论)
- 数学专项number_theory:UVa 10090
- UVa12230 - Crossing Rivers (数学期望)