HDU 5605 geometry
来源:互联网 发布:js array pushall 编辑:程序博客网 时间:2024/05/21 17:51
题意:给一个点的坐标,有一条直线经过此点,与xy轴相交于a,b两点,求|pa|*|pb|?
想法:设方程解,得到k^2+1/(k^2),基本不等式可得其>=2,所以带入可得,当k=1的时候为最小值(k为斜率),的到解为2*x*y
#include<stdio.h>int main(){int t;scanf("%d",&t);while(t--){int x,y;scanf("%d%d",&x,&y);printf("%d\n",2*x*y);}return 0;}
1 0
- HDU 5605 geometry
- HDU 5605 geometry
- HDU 5605 geometry
- HDU 5605 geometry
- HDU 5605 geometry(水~)
- hdu 5605 /BC 68A geometry
- HDU 4216-Computational Geometry?
- Geometry Problem HDU
- HDU 4932 Miaomiao's Geometry
- hdu 4932 Miaomiao's Geometry
- HDU 4932 Miaomiao's Geometry
- HDU-4932-Miaomiao's Geometry
- hdu 4932 Miaomiao's Geometry
- HDU 4932 Miaomiao's Geometry
- HDU-4932-Miaomiao's Geometry
- hdu 4932Miaomiao's Geometry
- hdu 5298 Solid Geometry Homework
- HDU 4932 Miaomiao's Geometry
- IOS学习笔记之网格视图
- Ionic基础——CSS布局
- ALAsset 的用法(时间、url 、图片的获取)
- tableview的调用方法
- iOS7崩溃报 UIView _didChangeToFirstResponder
- HDU 5605 geometry
- LeetCode Spiral Matrix
- LLDB调试命令初探
- java基础IO流之字节流
- linux的top命令参数详解
- getFragmentManager和getSupportFragmentManager的区别
- 迭代器模式
- [leetcode] 108. Convert Sorted Array to Binary Search Tree 解题报告
- ubuntu下安装kvm虚拟机