杭电ACM-1.2.1 Elevator

本文介绍了一个计算整数之和的程序实现,包括输入处理、求和逻辑和输出展示,适用于编程初学者。

A+B for Input-Output Practice (IV)

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12561 Accepted Submission(s): 7364
 

Problem Description

Your task is to Calculate the sum of some integers.

 

Input

Input contains multiple test cases. Each test case contains a integer N, and then N integers follow in the same line. A test case starting with 0 terminates the input and this test case is not to be processed.

 

Output

For each group of input integers you should output their sum in one line, and with one line of output for each line in input. 

 

Sample Input

4 1 2 3 4

5 1 2 3 4 5

0

 

Sample Output

10

15

 

 

代码:

#include<iostream>
using namespace std;

int main()
{
     int N,i,a,c[100];
     while(cin>>N&&N&&(N<100))
     {
          c[0]=0;
          int sum=0;
          for(i=1;i<=N;i++)
          {
               cin>>a;
               c[i]=a;
               if(c[i]>c[i-1])
                    sum+=5+(c[i]-c[i-1])*6;
               else if(c[i]<c[i-1])
                    sum+=5+(c[i-1]-c[i])*4;
               else
                    sum+=5;
          }
          cout<<sum<<endl;    
     }
    
     return 0;
}

 

 

转载于:https://www.cnblogs.com/cityflickr/archive/2013/06/12/3133016.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值