最小拉丁矩阵

来源:互联网 发布:java 检测url连接 编辑:程序博客网 时间:2024/04/28 20:52
#include<iostream>using namespace std;int main(void){    int n;    int temp;    while (cin >> n)    {        for (int i = 1; i <= n; ++i)        {            temp = i;            while (temp <= n)            {                cout << temp << " ";                ++temp;            }            temp = 1;            while( temp < i)            {                cout << temp << " ";                ++temp;            }            cout << endl;        }    }    return 0;}

 
原创粉丝点击