2014 Multi-University Training Contest 6 Apple Tree(数学题)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4925
Apple Tree
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 176 Accepted Submission(s): 120
For each test case, two integers N, M (1<=N, M<=100) are given in a line, which denote the size of the map.
2 2 2 3 3
8 32
代码如下:
#include <cstdio> #include <cstring> int mp[217][217]; int main() { int t; int n,i,a,ans,k,er,m,j; while(scanf("%d",&t)!=EOF) { while(t--) { scanf("%d%d",&n,&m); memset(mp,0,sizeof(mp)); if(n == 1 && m == 1) { printf("1\n"); continue; } for(i = 1; i <= n; i++) { for(j = 1; j <= m; j++) { if((i+j)&1) mp[i][j]=1; } } ans=0; for(i = 1; i <= n; i++) { for(j = 1; j <= m; j++) { if(mp[i][j] == 0) { if(mp[i-1][j]) { mp[i-1][j]*=2; } if(mp[i][j-1]) { mp[i][j-1]*=2; } if(mp[i][j+1]) { mp[i][j+1]*=2; } if(mp[i+1][j]) { mp[i+1][j]*=2; } } } } for(i = 1; i <= n; i++) { for(j = 1; j <= m; j++) { if(mp[i][j]) ans+=mp[i][j]; } } printf("%d\n",ans); } } return 0; }
2014 Multi-University Training Contest 6 Apple Tree(数学题),,5-wow.com
郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。