【lightoj1010】
来源:互联网 发布:mac雪花高光粉饼试色 编辑:程序博客网 时间:2024/05/20 03:08
Given an m x n chessboard where you want to place chess knights. You have to find the number of maximum knights that can be placed in the chessboard such that no two knights attack each other.
Those who are not familiar with chess knights, note that a chess knight can attack 8 positions in the board as shown in the picture below.
Input starts with an integer T (≤ 41000), denoting the number of test cases.
Each case contains two integers m, n (1 ≤ m, n ≤ 200). Here m and n corresponds to the number of rows and the number of columns of the board respectively.
For each case, print the case number and maximum number of knights that can be placed in the board considering the above restrictions.
3
8 8
3 7
4 10
Case 1: 32
Case 2: 11
Case 3: 20
题目大意:求m*n的棋盘中最多放几个马
思路:T<=41000,搜索肯定超时,只能找规律。
m,n都大于2时ans=max(黑块数,白块数)
其中一个等于1或2时要特殊考虑,是2时要遵循四个一块放,隔四个的规律才能放最多。模拟出这个过程即可
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;int main(){ int t,i,m,n,ans; cin>>t; for(i=1; i<=t; i++) { scanf("%d%d",&m,&n); if(m>n) swap(m,n); if(m==1) ans=n; else if(m==2) { int x=(m*n)%8; if(x>4) x=4; int y=(m*n)/8; ans=x+y*4; } else { if((m*n)&1) ans=(m*n+1)/2; else ans=(m*n)/2; } printf("Case %d: %d\n",i,ans); } return 0;}
- 【lightoj1010】
- lightoj1010【LCS】
- lightoj1010【规律】
- LightOJ1010---Knights in Chessboard (规律题)
- LightOJ1010 棋盘上能放的最多马数
- lightoj1010 Knights in Chessboard(找规律)
- Lightoj1010——Knights in Chessboard(找规律)
- 基于TCP/UDP的网络聊天程序
- oracle 时间函数整理
- 计划任务crontab
- Spring和AOP之间的详解
- SpringBoot简单入门(一)
- 【lightoj1010】
- 洛谷P1533 可怜的狗狗
- 算法提高 11-2删除重复元素
- 2015ccpc G
- Master-Mind Hints—UVa340
- 凸函数
- 两年Java开发工作经验面试总结
- SpringBoot简单入门(二)
- Python 是什么