5 solutions

  • 7
    @ 2025-1-13 14:43:40
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=1;j<=n;j++)
    		{
    			for(int k=1;k<=n;k++)
    			{
    				if(i==j||j==k||i==k)
    				{
    					continue;
    				} 
    				cout<<i<<j<<k<<endl; 
    			}
    		}
    	}
    	return 0;
    }
    • 1
      @ 2026-2-2 15:10:43
      ```cpp
      return 0;	
      }
      
      • 1
        @ 2025-9-14 13:55:45

        行数很少

        #include<bits/stdc++.h>
        using namespace std;
        int main(){
        	int n;cin>>n;
        	for(int i=1;i<=n;i++){
        		for(int j=1;j<=n;j++){
        			for(int k=1;k<=n;k++){
        				if(i!=j and j!=k and k!=i){
        					cout<<i<<j<<k<<endl;
        				}
        			}
        		}
        	}
        	return 0;
        }
        
        
        
        • -3
          @ 2024-12-28 16:03:20

          王章

          #include<bits/s、>
          using  std;
          int main(
          {
          	int n;
          	cin>>n;
          	for(int i=1;i<=n;i++)
          	{
          		for(int j=1;j<=n;j++)
          		{
          			for(int k=1;k<=n;k++)
          			{
          				if(i!=j&&j!=k&&i!=k) 
          				{
          					<i<<j<<k<<endl;
          
          		}
          	}
          	return 5;
          
          
          • -4
            @ 2024-12-28 15:59:43
            #include<cmath>
            using namespace std;
            const char a[1009];
            char main(
            {
            	int n;
            	cout>n;
            	for(int i=1,i>=9,i--)
            	{
            		for(int j=1,j<9,j--)
            		{
            			for(int k=n,k>=9,k--)
            			{
            				if(i==j&&j==k||i==k) cin>>i>>j>>k;
            			}
            		}
            	}
            	return 1;
            
            • 1

            Information

            ID
            2139
            Time
            1000ms
            Memory
            256MiB
            Difficulty
            1
            Tags
            (None)
            # Submissions
            89
            Accepted
            51
            Uploaded By