DHU OJ 循环结构棋盘

jtymyxmz

于 2024-08-07 23:37:53 发布

阅读量122

点赞数 3

分类专栏： DHU OJ 文章标签：算法 c++

本文链接：https://blog.csdn.net/jtymyxmz/article/details/140964418

版权

DHU OJ 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

思路及代码一口气写完没有编译没有报错，开心！

先找了下规律

//input 多组n,i,j int 1<= <= 12 1<=i<=j<=n

#include<iostream>
using namespace std;
int main(){
    int n, i, j;
    while (cin >> n >> i >> j){
//solution
//output 1
        for (int k = 1; k <= n; k++){
            cout << "(" << i << "," << k << ")";
        }
        cout << endl;
//output 2
        for (int k = 1; k <= n; k++){
            cout << "(" << k << "," << j << ")";
        }
        cout << endl;
//output 3
        int r, c;
        if (j-i >= 0){
            r = 1;
            c = j - i + 1;
            for (int k = 1; k <= n-(j-i); k++){
                cout << "(" << r << "," << c << ")";
                r++;
                c++;
            }
            cout << endl;
        }else{
            r = i - j + 1;
            c = 1;
            for (int k = 1; k <= n+(j-i); k++){
                cout << "(" << r << "," << c << ")";
                r++;
                c++;
            }
            cout << endl;
        }
//output 4
        if (i+j <= n+1){
            r = i + j -1;
            c = 1;
            for (int k = 1; k <= i+j-1; k++){
                cout << "(" << r << "," << c << ")";
                r--;
                c++;
            }
            cout << endl;
        }else{
            r = n;
            c = i + j - n;
            for (int k = 1; k <= 2*n-(i+j)+1; k++){
                cout << "(" << r << "," << c << ")";
                r--;
                c++;
            }
            cout << endl;
        }
        cout << endl;
    }
    return 0;
}

参考：无

收获：无

菜菜，不是教程，做题和学习记录