1 solutions

  • 0
    @ 2025-3-3 16:33:50

    C :

    #include<stdio.h>
    int getn(int n){
    	if(n==1){
    		return 1;
    	}else{
    		return getn(n-1)+n;
    	}
    }
    int main(){
    	int i,n,s=0;
    	scanf("%d",&n);
    	for(i=1;i<=n;i++){
    		s=s+getn(i);
    	} 
    	printf("%d",s);
    	return 0;
    }
    

    C++ :

    #include<iostream>
    using namespace std;
    
    int digui(int n);
    
    int main(){
    	int n=0,s=0;
    	cin>>n;
    	
    	for(int i=1;i<=n;i++){
    		
    		s=s+digui(i);
    	}
    	cout<<s<<endl;
    }
    
    int digui(int n){
    	
    	if(n==1)
    		return 1;
    	else
    		return n+digui(n-1);
    }
    
    

    Python :

    def jiMu(n):
            #1,3,6,10,15
            s = 0
            if n == 1:
                    s = 1
            else:
                   s = jiMu(n-1) + n 
            return s
    n = int(input())
    s = 0
    for i in range (1,n +1):
            s += jiMu(i)
    print(s)
    
    
    • 1

    Information

    ID
    10798
    Time
    1000ms
    Memory
    16MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By