第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-463 相邻两个数的和

#include<stdio.h>
int main(){
  int n,i,j,len;
  scanf("%d",&n);
  int arr[n],arr2[n-1];
  for(i=0;i<n;i++){
    scanf("%d",&arr[i]);
  }
  for(i=0;i<n-1;i++){
    arr2[i]=arr[i]+arr[i+1];
  }
  for(i=0;i<n-1;i++){
    printf("%d\n",arr2[i]);
  } 
  return 0;
}

#include <iostream>
using namespace std;
int main()
{
  int n, i, a[1005], sum[1005];
  cin >> n;
  cin >> a[0];
  for (i = 1; i < n; ++i)
  {
    cin >> a[i];
    sum[i - 1] = a[i] + a[i - 1];
  }
  for (i = 0; i < n - 1; i++)
  {
    cout << sum[i] << endl;
  }
  return 0;
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.Scanner;
import java.util.StringTokenizer;
public class Main {
  // 快速输入
  static class Reader {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer tokenizer = new StringTokenizer("");
    boolean hasNext() throws IOException {
      if (next() == null) {
        return false;
      }
      return true;
    }
    String next() throws IOException {
      while (!tokenizer.hasMoreTokens()) {
        tokenizer = new StringTokenizer(reader.readLine());
      }
      return tokenizer.nextToken();
    }
    int nextInt() throws IOException {
      return Integer.parseInt(next());
    }
    double nextDouble() throws IOException {
      return Double.parseDouble(next());
    }
  }
  static int ans=0;
  public static void main(String[] args) throws IOException {
    Reader in=new Reader();
    PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
    int n=in.nextInt();
    int a=in.nextInt();
    int b;
    for (int i = 1; i < n; i++) {
      b=in.nextInt();
      System.out.println(a+b);
      a=b;
    }
  }
}

a=int(input())
ls=list(map(int,input().split()))
ls1=[]
ls2=[]
ls3=[]
ls1=ls
ls2=ls
for i in range(a-1):
    s=ls1[i]+ls2[i+1]
    ls3.append(s)
for i in range(len(ls2)-1):
    print(ls3[i])