hd 2162 Add ‘em

最新推荐文章于 2020-12-22 13:40:47 发布

lc311309010103

最新推荐文章于 2020-12-22 13:40:47 发布

阅读量314

点赞数

CC 4.0 BY-SA版权

分类专栏：数学文章标签：无符号型数处理方法

本文链接：https://blog.youkuaiyun.com/lc311309010103/article/details/38440163

数学专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一个程序，用于计算一组整数的总和。该程序接收一组整数作为输入，直到遇到小于等于零的整数停止处理。每组输入后的结果会显示为“Sumof#xisy”，其中x是组数，y是总和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Add ‘em

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2636 Accepted Submission(s): 1963

Problem Description

Write a program to determine the summation of several sets of integers.

Input

The input file will consist of up to 250 sets of integers, where each set contains at most 100 integers and the integer values will be between –16000 and + 16000. Each set of numbers is started with the number of integers in the set, n. The next n input lines will each contain one integer of the set. You should stop processing when the size of the set, n, is<= 0.

Output

A single line of output should be generated for each set of integers. The line should have format shown below.

Sample Input

Sample Output

  
   Sum of #1 is 4
Sum of #2 is 36
Sum of #3 is -15979

Source

2008 “Sunline Cup” National Invitational Contest - Warm Up

#include<stdio.h>
int main()
{
    int n,m,s,t=0;
    while(scanf("%d",&n)!=EOF&&(n>0))
    {
     s=0;
      while(n--)
      {
       scanf("%d",&m);
       s+=m;
                }
     printf("Sum of #%d is %d\n",++t,s);
                              }
return 0;
}
//无符号型数处理方法