| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 40729 | yejiaxiangBMT | 向量点积计算 | C++ | Accepted | 1 MS | 272 KB | 514 | 2024-02-16 00:33:13 |
#include<iostream> #include<cmath> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int a[10001]; int b[10001]; int tot[10001]; long long int ans; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i=1;i<=n;i++) { cin>>b[i]; } for(int i=1;i<=n;i++) { tot[i]=a[i]*b[i]; } for(int i=1;i<=n;i++) { ans=tot[i]+ans; } cout<<ans; return 0; }