hdu 5605 geometry（几何，数学）-白红宇

hdu 5605 geometry（几何，数学）

阅读量：4991 次

发布时间：2019-06-12

本文共 1161 字，大约阅读时间需要 3 分钟。

Problem Description

There is a point

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.

Output

T lines,each line contains a number,means the answer to each test case.

简单推理，来自官方题解：

1 #pragma comment(linker, "/STACK:1024000000,1024000000") 2 #include
      
        3 #include
       
         4 #include
        
          5 #include
         
           6 #include
          
            7 #include
           
             8 #include
            
              9 #include
             
              10 #include
              
               11 #include
               12 #include
                
                 13 #include
                 
                  14 using namespace std;15 #define ll long long16 #define eps 1e-1017 #define MOD 100000000718 #define N 100000019 #define inf 1e1220 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\n",2*x*y);28 29 }30 return 0;31 }