Official
B - Orthogonality Editorial by en_translator
You can solve it by following the problem statement to calculate the inner product with arrays and loops.
Sample Code (Python)
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
prod = 0
for i in range(n) : prod += a[i] * b[i]
print("No" if prod else "Yes")
Sample Code (C)
#include <stdio.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int a[n];
for (int i = 0; i < n; i++) a[i] = ri();
int b[n];
for (int i = 0; i < n; i++) b[i] = ri();
int prod = 0;
for (int i = 0; i < n; i++) prod += a[i] * b[i];
puts(prod ? "No" : "Yes");
return 0;
}
posted:
last update: