hdu1065

#include <stdio.h>

int main()
{
    int t;
    double x, y;
    scanf("%d", &t);
    for(int i = 1; i <= t; ++i){
        scanf("%lf%lf", &x, &y);
        printf("Property %d: This property will begin eroding in year %d.\n",
            i, int((x*x + y*y) * 3.1415926 / 100 + 1));
    }
    printf("END OF OUTPUT.\n");
    return 0;
}
时间: 2025-01-31 07:57:24

hdu1065的相关文章

HDU1065 I Think I Need a Houseboat 【数学递推】

I Think I Need a Houseboat Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9530    Accepted Submission(s): 2733 Problem Description Fred Mapper is considering purchasing some land in Louisiana

hdu1065计算几何

Problem Description Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actually shrinking by 50 square miles each year, due to erosio

ceil()函数的应用-hdu1065

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1065 题目描述: floor(x)  is the largest integer not greater than x , 也就是,floor(x) 返回的是小于等于x的所有整数中最大的整数,简单的说,就是去掉x的小数部分的整数 ceil(x)  is the smallest integer not less than x,也就是,ceil(x) 返回的是大于等于x的所有整数中最小的整数,简单的