Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
3608 | 孙灏洋 | 蛇形矩阵 | C++ | Wrong Answer | 0 | 0 MS | 248 KB | 378 | 2019-12-20 20:52:48 |
#include<iostream> using namespace std; int main(){ int n,m=1,f=1; cin>>n; int a[n+1][n+1]; for(int i=1;i<=n;i++){ if(f){ for(int j=1;j<=n;j++){ a[i][j]=m++; } f=0; }else{ for(int j=n;j<=1;j--){ a[i][m]=m++; } f=1; } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<a[i][j]<<"\t"; } cout<<endl; } }