zoukankan      html  css  js  c++  java
  • UVa11538 A Chess Queen

    A Chess Queen

    Problem A Chess Queen  Input: Standard Input

    Output: Standard Output

    You probably know how the game of chess is played and how chess queen operates. Two chess queens are in attacking position when they are on same row, column or diagonal of a chess board. Suppose two such chess queens (one black and the other white) are placed on (2x2) chess board. They can be in attacking positions in 12 ways, these are shown in the picture below:

     
       

    Figure: in a (2x2) chessboard 2 queens can be in attacking position in 12 ways

    Given an (NxM) board you will have to decide in how many ways 2 queens can be in attacking position in that.

    Input

    Input file can contain up to 5000 lines of inputs. Each line contains two non-negative integers which denote the value of M and N (0< M, N£106) respectively.

    Input is terminated by a line containing two zeroes. These two zeroes need not be processed.

    Output

    For each line of input produce one line of output. This line contains an integer which denotes in how many ways two queens can be in attacking position in  an (MxN) board, where the values of M and N came from the input. All output values will fit in 64-bit signed integer.

    Sample Input                              Output for Sample Input

    2 2

    100 223

    2300 1000

    0 0

    12

    10907100

    11514134000

     

    Problemsetter: Shahriar Manzoor

    Special Thanks to: Mohammad Mahmudur Rahman

     1 /*
     2 分三种情况:
     3 同行 
     4 同列
     5 同斜
     6 */
     7 
     8 #include<stdio.h>
     9 #include<string.h>
    10 #include<algorithm>
    11 #include<math.h>
    12 #include<queue>
    13 #include<set>
    14 #include<vector>
    15 #include<bitset>
    16 using namespace std;
    17 typedef long long ll;
    18 
    19 const int M=1000010;
    20 
    21 int get(){
    22     char c;
    23     int res=0;
    24     while(c=getchar(),!isdigit(c));
    25     do{
    26         res=(res<<3)+(res<<1)+(c-'0');
    27     }while(c=getchar(),isdigit(c));
    28     return res;
    29 }
    30 
    31 
    32 
    33 
    34 int main()
    35 {
    36     ll ans1,ans2,ans3,ans,n,m;
    37     while(~scanf("%lld%lld",&n,&m))
    38     {
    39         if(n==0&m==0)break;
    40         if(n>m)swap(n,m);
    41         ans1=n*m*(m-1);//同行 
    42         ans2=n*m*(n-1);//同列
    43         ans3=2*n*(n-1)*(3*m-n-1)/3;//同斜
    44         ans=ans1+ans2+ans3;
    45         printf("%lld
    ",ans);         
    46     }
    47     return 0;
    48 }
    View Code
  • 相关阅读:
    Netty源码分析-ChannelPipeline事件传播
    Netty源码分析-NioEventLoop事件轮询
    Netty源码分析-ServerBootstrap启动过程
    Canal基本原理
    [Android]proguard重新编译和如何不混淆第三方jar包
    [Android]listview recycleview的复用问题
    [Android] android .keystore文件转x509pem工具
    [Android] android studio 2.0即时运行功能探秘
    大神都是有个起点的
    Python列表的用法和基本操作
  • 原文地址:https://www.cnblogs.com/skykill/p/3231225.html
Copyright © 2011-2022 走看看