LanQiaoTestCodes/求和2.java

25 lines
493 B
Java
Raw Permalink Normal View History

2023-04-23 12:30:47 +00:00
package LanQiaoOJ;
import java.util.Scanner;
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƽ<C6BD><E2A1AA>ʱ<EFBFBD><EFBFBD>Ӷ<EFBFBD>ΪO(n^2)
//<2F><>ΧΪ2e5*2e5=4e10 <20><>ʱ
public class <EFBFBD><EFBFBD><EFBFBD><EFBFBD>2 {
static int N=200010;
static long[]a=new long[N];
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
for(int i=1;i<n;i++) {
a[i]=sc.nextInt();
}
long ans=0;
for(int i=1;i<=n;i++) {
for(int j=i+1;j<=n;j++) {
ans+=a[i]+a[j];
}
}
System.out.println(ans);
}
}