Wuhan University of Science and Technology acm:1001:0 starting point algorithm 34--continue to seek polynomial

Problem Description

Enter a 1 positive integer n,
Calculation 1+ (1+2) + (1+2+3) +...+ (1+2+3+...+n)

Input

Input positive integer n (multiple sets of data)

Output

Output 1+ (1+2) + (1+2+3) +...+ (1+2+3+...+n) value (one row per group of data)

Sample Input

2

Sample Output

4

1#include <iostream>2 3 using namespacestd;4 5 intMain ()6 7 {8 9          intn,t;Ten  One          Longsum; A  -           while(cin>>N) -  the          { -  -sum=0; -  +t=0; -  +                     for(intI=1; i<=n;i++) A  at                    { -  -t+=i; -  -sum+=T; -  in                    } -  tocout<<sum<<Endl; +  -          } the  *          return 1; $ Panax Notoginseng          -  the          +  A}

Other code

1#include <stdio.h>2 intMain ()3 {4     intn,sum,i;5      while(SCANF ("%d", &n)! =EOF)6     {7          for(i=1, sum=0; i<=n;i++)8sum+= (n-i+1)*i;9printf"%d\n", sum);Ten     } One     return 0; A}

Wuhan University of Science and Technology acm:1001:0 starting point algorithm 34--continue to seek polynomial