| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 2257 | zhuangshuyi | 循环比赛 | C++ | Accepted | 100 | 0 MS | 400 KB | 405 | 2019-11-16 17:28:14 |
#include<iostream> #include <cmath> using namespace std; int main() { int a[513][513],n,e; cin>>n; e=pow(2,n); a[1][1]=1; for(int i=1; i<e; i*=2) for(int j=1; j<=i; j++) for(int k=1; k<=i; k++) { a[j][k+i]=a[j][k]+i; a[j+i][k]=a[j][k]+i; a[j+i][k+i]=a[j][k]; } for(int j=1; j<=e; j++) { for(int k=1; k<=e; k++) printf("%3d",a[j][k]); printf("\n"); } }