题解 | #蛇形矩阵#
蛇形矩阵
http://www.nowcoder.com/practice/649b210ef44446e3b1cd1be6fa4cab5e
#include<iostream> using namespace std; int main() { int num; while(cin>>num) { double tmp[num]; for(int i=1; i<=num; i++) { tmp[i-1] = ((double)i+1)/2*(double)i; cout<<tmp[i-1]<<" "; } cout<<endl; for(int j=0; j<num-1;j++) { for(int k=0; k<num-j-1;k++) { cout<<tmp[k+j+1]-j-1<<" "; } cout<<endl; } } return 0; }