2 条题解

  • 0
    @ 2025-1-25 18:40:01

    #include<bits/stdc++.h> using namespace std; int main() { int n,a,b; cin>>n>>a>>b; for(int j=1;j<=n;j++) cout<<"("<<a<<","<<j<<")"; cout<<endl; for(int i=1;i<=n;i++) cout<<"("<<i<<","<<b<<")"; cout<<endl; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if((i-j)(a-b)) cout<<"("<<i<<","<<j<<")"; cout<<endl; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if((i+j)(a+b)) cout<<"("<<j<<","<<i<<") "; } 不需要二维数组@——@

    • 0
      @ 2025-1-25 15:50:45

      #include<bits/stdc++.h> using namespace std; int main() { int n,x,y; cin>>n>>x>>y; for(int i=1;i<=n;i++){ cout<<"("<<x<<","<<i<<")"<<" "; } cout<<endl; for(int i=1;i<=n;i++){ cout<<"("<<i<<","<<y<<")"<<" "; } cout<<endl; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(i-jx-y){ cout<<"("<<i<<","<<j<<")"<<" "; } } } cout<<endl; for(int i=n;i>=1;i--){ for(int j=1;j<=n;j++){ if(i+jx+y){ cout<<"("<<i<<","<<j<<")"<<" "; } } } cout<<endl; return 0; } 不需要二维数组@——@

      • @ 2025-1-25 18:40:38

        不需要二维数组👍

    • 1

    信息

    ID
    111
    时间
    1000ms
    内存
    128MiB
    难度
    7
    标签
    (无)
    递交数
    75
    已通过
    16
    上传者