HDU4925:Apple Tree
来源:互联网 发布:北京招聘ios程序员 编辑:程序博客网 时间:2024/06/05 07:15
Problem Description
I’ve bought an orchard and decide to plant some apple trees on it. The orchard seems like an N * M two-dimensional map. In each grid, I can either plant an apple tree to get one apple or fertilize the soil to speed up its neighbors’ production. When a grid is fertilized, the grid itself doesn’t produce apples but the number of apples of its four neighbor trees will double (if it exists). For example, an apple tree locates on (x, y), and (x - 1, y), (x, y - 1) are fertilized while (x + 1, y), (x, y + 1) are not, then I can get four apples from (x, y). Now, I am wondering how many apples I can get at most in the whole orchard?
Input
The input contains multiple test cases. The number of test cases T (T<=100) occurs in the first line of input.
For each test case, two integers N, M (1<=N, M<=100) are given in a line, which denote the size of the map.
For each test case, two integers N, M (1<=N, M<=100) are given in a line, which denote the size of the map.
Output
For each test case, you should output the maximum number of apples I can obtain.
Sample Input
22 23 3
Sample Output
832
Author
BUPT
对于这种题 ,我只想说 ,推吧,少年!
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;__int64 a[105][105];void set(){ int i,j; a[1][1] = 1; a[2][2] = 8; a[1][2] = 2; for(i = 3;i<=100;i++) a[i][i] = (8*(i-1)*(i-1)); for(i = 1;i<=100;i++) { for(j = i+1;j<=100;j++) { if(i == 1) { if(j == 2) continue; else a[i][j] = a[i][j-1]+2; } else a[i][j] = a[i][j-1]+a[i][i]/(i-1); } }}int main(){ set(); int t,n,m; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); if(n>m) swap(n,m); printf("%I64d\n",a[n][m]); } return 0;}
0 0
- HDU4925-Apple Tree
- HDU4925-Apple Tree
- HDU4925:Apple Tree
- HDU4925 Apple Tree(位运算相关知识)
- HDU4925
- Apple Tree
- Apple Tree
- Apple Tree
- Apple Tree
- Apple Tree
- The Apple Tree
- The Apple Tree
- POJ 3321 Apple Tree
- POJ 3321 Apple Tree
- Apple Tree(动态规划)
- poj 3321 Apple Tree
- G - Apple Tree
- poj3321---Apple Tree
- IT忍者神龟之JS调用JAVA CLASS
- 求表中数据占总数百分比的SQL
- Generic Netlink详解
- Phonegap中自定义插件的使用
- vim编辑器使用方法
- HDU4925:Apple Tree
- 折半查找
- 【神经网络学习笔记】LIBSVM参数讲解
- vmlinux, zImage, Image的区别
- CUDA 6.0在 VS 2010下的安装和配置
- 网络爬虫(一)-------抓取网页之理解URL
- IT忍者神龟之查看、修改oracle字符集,查看oracle版本
- QtCreator 点击标题排序,QHeadView
- chrome JavaScript 断点设置和调试技巧