HDOJ 题目5100 Chessboard（数学乱搞）

Chessboard

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 857    Accepted Submission(s): 356

Problem Description

Consider the problem of tiling an n×n chessboard by polyomino pieces that are k×1 in size; Every one of the k pieces of each polyomino tile must align exactly with one of the chessboard squares. Your task is to figure out the maximum number of chessboard squares tiled.

 

Input

There are multiple test cases in the input file.
First line contain the number of cases T ( T≤10000 ). 
In the next T lines contain T cases , Each case has two integers n and k. ( 1≤n,k≤100 )

 

Output

Print the maximum number of chessboard squares tiled.

 

Sample Input

  
  

   
   2
6 3
5 3
  
  

 

Sample Output

  
  

   
   36
24
  
  

 

Source

BestCoder Round #17

 

Recommend

heyang   |   We have carefully selected several similar problems for you:   5551  5550  5549  5548  5547 

 

题目大意： n*n的棋盘，用kX1的木板覆盖，问最大覆盖的面积

15378325

2015-11-04 15:52:30

Accepted

5100

0MS

1732K

831 B

C++

XY_

ac代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        if(m>n)
        {
            printf("0\n");
            continue;
        }
        if(n%m==0)
        {
            printf("%d\n",n*n);
            continue;
        }
        int c;
        c=n>>1;
        if(m<c)
        {
            int i=1,tn=n;
            while(m<(tn>>1))
            {
                tn-=m;
            }
            int k=tn-m;
            int d=min(tn-k-k,k);
           printf("%d\n",n*n-d*d);
        }
        else
        {
            int k=n-m;
            int d=min(n-k-k,k);
                printf("%d\n",n*n-d*d);
        }
    }
}