zoukankan      html  css  js  c++  java
  • NYOJ122Triangular Sums

    Triangular Sums

    时间限制:3000 ms  |  内存限制:65535 KB
    难度:2
     
    描述

    The nth Triangular number, T(n) = 1 + … + n, is the sum of the first n integers. It is the number of points in a triangular array with n points on side. For example T(4):

    X
    X X
    X X X
    X X X X

    Write a program to compute the weighted sum of triangular numbers:

    W(n) = SUM[k = 1…nk * T(k + 1)]

     
    输入
    The first line of input contains a single integer N, (1 ≤ N ≤ 1000) which is the number of datasets that follow.

    Each dataset consists of a single line of input containing a single integer n, (1 ≤ n ≤300), which is the number of points on a side of the triangle.
    输出
    For each dataset, output on a single line the dataset number (1 through N), a blank, the value of n for the dataset, a blank, and the weighted sum ,W(n), of triangular numbers for n.
    样例输入
    4
    3
    4
    5
    10
    样例输出
    1 3 45
    2 4 105
    3 5 210
    4 10 2145
     
    #include<stdio.h>
    #include<string.h>
    int shu[310];
    int main()
    {
        int n,i,j,k,x;
        long long t;
        for(i=0;i<310;i++)
        shu[i]=i*(i+1)/2;
        scanf("%d",&n);
       for(k=1;k<=n;k++)
       {
          scanf("%d",&x);
          t=0;
          for(i=1;i<=x;i++)
          t+=shu[i+1]*i;
          printf("%d %d %lld\n",k,x,t);
       }
       return 0;
    }
          
            
  • 相关阅读:
    作业十一
    作业十
    作业九
    作业八
    作业七
    作业六
    作业五
    作业四
    eclipse+maven+web服务,实现对hdfs的目录浏览展示
    Eclipse+hadoop伪态式分布+API
  • 原文地址:https://www.cnblogs.com/zhaojiedi1992/p/zhaojiedi_2012_08_02000000.html
Copyright © 2011-2022 走看看