题目链接:传送门 知识点: (1)三个点,三角形求面积公式 (2)精度问题: double 15-16位(参考文章) float 6-7位 long long 约20位 int 约10位 unsigned int 是int的两倍(参考文章) (3)nth_element()函数 思路:一开始想直接暴力求面积,然后面积排序,后来有发现面积不能是0,可以重复, 然后排序求出第k大的值,结果没注意double的位数不能精确到达到18位,然后又想四舍五入, 对尾数进行了处理,还是没过.看来题解才发现最后
链接:http://poj.org/problem?id=3348 Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6677 Accepted: 3020 Description Your friend to the south is interested in building fences and turning plowshares into swords. In order to help with
""" 已知三角形的边长求他的面积和周长 Author:罗万财 Date:2017-3-3 """ import math a=float(input('a=')) b=float(input('b=')) c=float(input('c=')) if a+b>c and a+c>b and b+c>a: d=a+b+c e=(a+b+c)/2 f=math.sqrt(e*(e-a)*(e-b)*(e-c)) print('三
public class Test24 { public static void main(String[] args) { // 鸡蛋0.1元一个,鸭蛋3元一个,鹅蛋6元一个.求一百元买一百个蛋. for (int i = 1; i <= 1000; i++) { for (int j = 1; j <= 100 / 3; j++) { for (int k = 1; k <= 100 / 6; k+
Herding Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1553 Accepted Submission(s): 440 Problem Description Little John is herding his father's cattles. As a lazy boy, he cannot tolerate chasing t
A - Building Fence Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64u Submit Status Description Long long ago, there is a famous farmer named John. He owns a big farm and many cows. There are two kinds of cows on his farm, o