CCF 201412(2)之字形扫描
2017-03-12 10:58
246 查看
Java优化算法参见:https://my.oschina.net/chenzuhuang/blog/356073
#include <stdio.h> int main() { int i,j,n; int a[501][501]; int book[2501]={0}; int count=0; scanf("%d",&n); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&a[i][j]); i=1; j=1; int k; if(n==1) printf("%d\n",a[1][1]); else { k=1; while(i<=n&&j<=n&&k<=(2*n-1)) { if(i==n&&j==n) { book[count]=a[i][j]; count++; break; } else if(i==1&&j==1) { book[count]=a[i][j]; count++; j++; k++; book[count]=a[i][j]; count++; j--; i++; } else if(i==1&&j==n) { book[count]=a[i][j]; count++; i++; k++; book[count]=a[i][j]; count++; i++; j--; } else if(i==1) { book[count]=a[i][j]; count++; j++; k++; book[count]=a[i][j]; count++; i++; j--; } else if(j==n&&(i!=1)) { book[count]=a[i][j]; count++; i++; k++; book[count]=a[i][j]; count++; i++; j--; } else if(j==1&&!(i==n)) { book[count]=a[i][j]; count++; i++; k++; book[count]=a[i][j]; count++; i--; j++; } else if(i==n&&(j!=1)) { book[count]=a[i][j]; count++; j++; k++; book[count]=a[i][j]; count++; j++; i--; } else if(i==n&&j==1&&n%2==0) { book[count]=a[i][j]; count++; j++; k++; book[count]=a[i][j]; count++; j++; i--; } else if(i==n&&j==1&&n%2==1) { book[count]=a[i][j]; count++; i--; j++; } else if(k%2==1) { book[count]=a[i][j]; count++; i--; j++; } else if(k%2==0) { book[count]=a[i][j]; count++; i++; j--; } } } if(n!=1) { for(i=0;i<count;i++) printf("%d ",book[i]); printf("\n"); } return 0; }50分sad...还要再想一下,代码太冗余整个思路是一下出来的,所以写完之后不太明白哪里出错
相关文章推荐
- CCF 201412-2 Z字形扫描
- CCF CSP认证 题解:201412-2 Z字形扫描(Java语言原创)
- 第三次CCF计算机软件能力认证考试题解(Java)--201412--Z字形扫描--100分通过
- CCF-201412-2 Z字形扫描
- CCF 201412-2 Z字形扫描
- CCF-201412-2-Z字形扫描
- CCF CSP试题 201412-2 Z字形扫描
- CCF 201412-2 Z字形扫描 c++/java(100分)
- CCF CSP 201412-2 Z字形扫描
- CCF 201412-2 Z字形扫描 JAVA实现
- CCF CSP 编程题目和解答-----试题名称:Z字形扫描-------201412-2
- [CCFwithAxin]201412-2 Z字形扫描(类似蛇形矩阵)
- 201412-2 Z字形扫描 ccf
- CCF 201412-2 Z字形扫描
- CCF计算机软件能力认证考试-201412-2-Z字形扫描
- CCF 201412-2 Z字形扫描 题解
- ccf-201412-2 Z字形扫描
- CCF系列之Z字形扫描(201412-2)
- CCF真题——Z字形扫描(java)
- CCF题目:Z字形扫描