6 solutions

  • 1
    @ 2025-11-22 16:23:18
    
    ```cpp
    #include<bits/stdc++.h>
    using namespace std;
    int n;
    int main(){
    	cin>>n;
    	if(n==0){
    		cout<<0;
    	}else{
    		for(int i=0;i<=n;i++){
    		if(i%2!=0){
    			cout<<i<<' ';
    		}
    	}
    	cout<<endl;
    	for(int j=0;j<=n;j++){
    		if(j%2==0){
    			cout<<j<<' ';
    		} 
    	}
    	}
    	
    	return 0;
    }
    
    • @ 2026-5-23 10:47:13

      预测与关怀返回结果我当初就不该不许胡闹下去从此告别v吧v工程检测不出参观博物馆v一个深更半夜的岗位v给v恐惧和 二点 v尺寸v无色的vvBBC v v从给几个v刚才v刚才v从v从vv1瓦耶特fix余📋

  • 0
    @ 2025-3-23 15:58:46
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
    	long long n;cin>>n;
    	for(int i=0;i<=n;i++)if(i%2!=0)cout<<i<<' ';
    	cout<<endl;
    	for(int i=0;i<=n;i++)if(i%2==0)cout<<i<<' ';
    	return 0;
    }
    
    • -1
      @ 2025-12-13 13:55:23

      菜就多练

      • -1
        @ 2024-7-5 9:39:59

        #include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; for(int i=1;i<=n;i+=2) { cout<<i<<" "; } cout<<endl; for(int i=0;i<=n;i+=2) { cout<<i<<" "; } return 0; }

        • -1
          @ 2024-6-2 11:41:10

          #include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; for(int i=1;i<=n;i+=2) cout<<i<<" "; cout<<endl; for(int i=0;i<=n;i+=2) cout<<i<<" ";

          return 0;
          

          }

          • -3
            @ 2025-8-13 16:11:00
            #include<bits/stdc++.h>
            using namespace std;
            int n;
            int main(){
            	cin>>n;
            	if(n==0){
            		cout<<0;
            	}else{
            		for(int i=0;i<=n;i++){
            		if(i%2!=0){
            			cout<<i<<' ';
            		}
            	}
            	cout<<endl;
            	for(int j=0;j<=n;j++){
            		if(j%2==0){
            			cout<<j<<' ';
            		} 
            	}
            	}
            	
            	return 0;
            }
            
            • 1

            Information

            ID
            870
            Time
            1000ms
            Memory
            256MiB
            Difficulty
            1
            Tags
            (None)
            # Submissions
            378
            Accepted
            111
            Uploaded By