5 solutions

  • 1
    @ 2025-12-20 11:04:06
    • 1
      @ 2024-12-15 14:41:06
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
          int n,a,b; // a = 行,b = 列。先输入行,在输入列。
          cin>>n>>a>>b;
          for(int i = 1;i <= n;i++)
          {
              cout<<"("<<a<<","<<i<<") ";
          }
          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 = n;i >= 1;i--)
          {
              for(int j = 1;j <= n;j++)
              {
                  if(i + j == a + b)
                  {
                      cout<<"("<<i<<","<<j<<") ";
                  }
              }
          }
          return 0;
      }
      
      
      • 1
        @ 2024-11-10 11:20:04
        #include<bits/stdc++.h>
        using namespace std;
        int main()
        {
            int n,a,b;
            cin>>n>>a>>b;
            for(int i=1;i<=n;i++){
                cout<<"("<<a<<","<<i<<")";
            }
            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=n;i>=1;i--){
                for(int j=1;j<=n;j++){
                    if(i+j==a+b){
                        cout<<"("<<i<<","<<j<<")";
                    }
                }
            }
            return 0;
        }
        
      • 1
        @ 2024-9-22 10:05:07
        #include<bits/stdc++.h>
        using namespace std;
        int main()
        {
        	int n,a,b;
        	cin>>n>>a>>b;
        	for(int i=1;i<=n;i++)
        	{
        		cout<<"("<<a<<","<<i<<") ";
        	}
        	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=n;i>=1;i--)
        	{
        		for(int j=1;j<=n;j++)
        		{
        			if(i+j==a+b)
        			{
        				cout<<"("<<i<<","<<j<<") ";
        			}
        		}
        	} 
        	 
            return 0;
        }
        
      • -1
        @ 2024-11-10 11:45:03

        #include<bits/stdc++.h> using namespace std; int main() { int n,a,b; cin>>n>>a>>b; for(int i=1;i<=n;i++) { cout<<"("<<a<<","<<i<<") "; } 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-ja-b) { cout<<"("<<i<<","<<j<<") "; } } } cout<<endl; for(int i=n;i>=1;i--) { for(int j=1;j<=n;j++) { if(i+ja+b) { cout<<"("<<i<<","<<j<<") "; } } }

        return 0;
        

        }$$

        • 1

        Information

        ID
        902
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        1
        Tags
        (None)
        # Submissions
        223
        Accepted
        44
        Uploaded By