zoukankan      html  css  js  c++  java
  • hdu 5605 geometry(几何,数学)

    Problem Description
    There is a point P at coordinate (x,y). A line goes through the point, and intersects with the postive part of X,Y axes at point A,B. Please calculate the minimum possible value of |PA||PB|.
     
    Input
    the first line contains a positive integer T,means the numbers of the test cases. the next T lines there are two positive integers X,Y,means the coordinates of P. T=500,0<X,Y10000.
     
    Output
    T lines,each line contains a number,means the answer to each test case.
     

    简单推理,来自官方题解:

     1 #pragma comment(linker, "/STACK:1024000000,1024000000")
     2 #include<iostream>
     3 #include<cstdio>
     4 #include<cstring>
     5 #include<cmath>
     6 #include<math.h>
     7 #include<algorithm>
     8 #include<queue>
     9 #include<set>
    10 #include<bitset>
    11 #include<map>
    12 #include<vector>
    13 #include<stdlib.h>
    14 using namespace std;
    15 #define ll long long
    16 #define eps 1e-10
    17 #define MOD 1000000007
    18 #define N 1000000
    19 #define inf 1e12
    20 int x,y;
    21 int main()
    22 {
    23     int t;
    24     scanf("%d",&t);
    25     while(t--){
    26         scanf("%d%d",&x,&y);
    27         printf("%d
    ",2*x*y);
    28          
    29     }
    30     return 0;
    31 }
    View Code

     

  • 相关阅读:
    nodejs发送http请求
    Codeforces Round #655 (Div. 2)
    闇の連鎖 树上LCA + 树上差分
    Tree 换根dp
    「水」悠悠碧波 kmp
    HH的项链
    Educational Codeforces Round 90 (Rated for Div. 2)
    巡逻(论为什么第二次求直径要用dp)
    Codeforces Round #651 (Div. 2)
    Treap板子
  • 原文地址:https://www.cnblogs.com/UniqueColor/p/5164312.html
Copyright © 2011-2022 走看看