UVa 11040 - Add bricks in the wall(规律)
2015-02-18 15:06
330 查看
给出墙上的部分数字,求所有的数字。
简单题,直接算就行。
简单题,直接算就行。
#include<cstdio> int a[9][9]; int main(){ int t; scanf("%d",&t); while(t--){ for(int i=0;i<9;i+=2) for(int j=0;j<=i;j+=2) scanf("%d",&a[i][j]); for(int i=8;i>0;i-=2) for(int j=1;j<i;j+=2) a[i][j]=(a[i-2][j-1]-a[i][j-1]-a[i][j+1])/2; for(int i=1;i<9;i+=2) for(int j=0;j<=i;++j) a[i][j]=a[i+1][j]+a[i+1][j+1]; for(int i=0;i<9;++i){ for(int j=0;j<=i;++j){ if(j) printf(" "); printf("%d",a[i][j]); } printf("\n"); } } return 0; }
相关文章推荐
- 【UVA】11040 - Add bricks in the wall(找规律)
- UVA-11040-Add Bricks in the wall(规律、递推)
- UVa11040 - Add bricks in the wall (规律递推)
- UVa 11040 - Add bricks in the wall
- UVA 11040 Add bricks in the wall
- UVa 11040 (水题) Add bricks in the wall
- UVA 11040(p342)----Add Bricks in the Wall
- UVa 11040 Add bricks in the wall (水题递推)
- UVa 11040 - Add bricks in the wall
- uva 11040 - Add bricks in the wall
- UVA11040 - Add bricks in the wall
- UVa 11040 - Add bricks in the wall
- UVA 11040 - Add bricks in the wall
- UVa 11040 - Add bricks in the wall
- Add bricks in the wall UVA - 11040——递推
- UVa11040 - Add bricks in the wall
- UVA 11040 Add bricks in the wall(线性组合)
- 11040 - Add bricks in the wall(简单题)
- UVA1426-Add Bricks in The Wall
- 11040 - Add bricks in the wall